./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/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 ede185df305af642a5265096891dc95893f4609c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:50:04,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:04,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:04,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:04,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:04,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:04,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:04,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:04,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:04,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:04,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:04,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:04,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:04,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:04,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:04,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:04,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:04,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:04,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:04,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:04,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:04,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:04,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:04,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:04,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:04,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:04,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:04,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:04,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:04,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:04,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:04,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:04,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:04,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:04,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:04,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:04,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:04,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:04,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:04,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:04,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:04,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:04,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:04,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:04,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:04,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:04,853 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:04,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:04,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:04,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:04,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:04,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:04,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:04,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:04,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:04,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:04,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:04,855 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:04,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:04,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:04,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:04,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:04,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:04,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:04,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:04,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:04,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:04,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:04,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:04,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:04,858 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_5d2553e6-1ac9-4234-b908-b9ea5947d800/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 -> ede185df305af642a5265096891dc95893f4609c [2019-11-25 08:50:05,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:05,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:05,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:05,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:05,042 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:05,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_accelerometer_1.c [2019-11-25 08:50:05,103 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/data/0fe81ee53/da98a20d39a04a139491bcc0ae92b886/FLAG8cab0938c [2019-11-25 08:50:05,754 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:05,755 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/sv-benchmarks/c/psyco/psyco_accelerometer_1.c [2019-11-25 08:50:05,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/data/0fe81ee53/da98a20d39a04a139491bcc0ae92b886/FLAG8cab0938c [2019-11-25 08:50:05,921 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/data/0fe81ee53/da98a20d39a04a139491bcc0ae92b886 [2019-11-25 08:50:05,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:05,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:05,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:05,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:05,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:05,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:05" (1/1) ... [2019-11-25 08:50:05,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743e54a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:05, skipping insertion in model container [2019-11-25 08:50:05,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:05" (1/1) ... [2019-11-25 08:50:05,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:06,059 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:06,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:06,822 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:07,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:07,124 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:07,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07 WrapperNode [2019-11-25 08:50:07,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:07,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:07,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:07,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:07,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:07,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:07,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:07,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:07,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... [2019-11-25 08:50:07,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:07,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:07,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:07,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:07,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/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-25 08:50:07,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:07,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:09,415 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:09,416 INFO L284 CfgBuilder]: Removed 25 assume(true) statements. [2019-11-25 08:50:09,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:09 BoogieIcfgContainer [2019-11-25 08:50:09,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:09,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:09,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:09,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:09,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:05" (1/3) ... [2019-11-25 08:50:09,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49565655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:09, skipping insertion in model container [2019-11-25 08:50:09,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:07" (2/3) ... [2019-11-25 08:50:09,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49565655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:09, skipping insertion in model container [2019-11-25 08:50:09,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:09" (3/3) ... [2019-11-25 08:50:09,429 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-11-25 08:50:09,437 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:09,444 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:50:09,454 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:50:09,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:09,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:09,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:09,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:09,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:09,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:09,486 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:09,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-11-25 08:50:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:50:09,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 352572211, now seen corresponding path program 1 times [2019-11-25 08:50:09,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116179999] [2019-11-25 08:50:09,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,706 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-25 08:50:09,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116179999] [2019-11-25 08:50:09,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:09,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20925851] [2019-11-25 08:50:09,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:50:09,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:50:09,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:50:09,729 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 2 states. [2019-11-25 08:50:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,794 INFO L93 Difference]: Finished difference Result 463 states and 910 transitions. [2019-11-25 08:50:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:50:09,795 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-25 08:50:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,815 INFO L225 Difference]: With dead ends: 463 [2019-11-25 08:50:09,816 INFO L226 Difference]: Without dead ends: 224 [2019-11-25 08:50:09,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:50:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-25 08:50:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-11-25 08:50:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-25 08:50:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 393 transitions. [2019-11-25 08:50:09,881 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 393 transitions. Word has length 9 [2019-11-25 08:50:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,881 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 393 transitions. [2019-11-25 08:50:09,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:50:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 393 transitions. [2019-11-25 08:50:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:50:09,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1422696861, now seen corresponding path program 1 times [2019-11-25 08:50:09,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816704606] [2019-11-25 08:50:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,922 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-25 08:50:09,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816704606] [2019-11-25 08:50:09,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:09,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983364157] [2019-11-25 08:50:09,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:09,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:09,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:09,925 INFO L87 Difference]: Start difference. First operand 224 states and 393 transitions. Second operand 3 states. [2019-11-25 08:50:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,084 INFO L93 Difference]: Finished difference Result 449 states and 788 transitions. [2019-11-25 08:50:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:50:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,087 INFO L225 Difference]: With dead ends: 449 [2019-11-25 08:50:10,087 INFO L226 Difference]: Without dead ends: 227 [2019-11-25 08:50:10,090 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-25 08:50:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-25 08:50:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-11-25 08:50:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-25 08:50:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 396 transitions. [2019-11-25 08:50:10,124 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 396 transitions. Word has length 10 [2019-11-25 08:50:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,125 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 396 transitions. [2019-11-25 08:50:10,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 396 transitions. [2019-11-25 08:50:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:50:10,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,126 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash 658033430, now seen corresponding path program 1 times [2019-11-25 08:50:10,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59598199] [2019-11-25 08:50:10,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:10,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59598199] [2019-11-25 08:50:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288673567] [2019-11-25 08:50:10,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,221 INFO L87 Difference]: Start difference. First operand 227 states and 396 transitions. Second operand 3 states. [2019-11-25 08:50:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,354 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2019-11-25 08:50:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-25 08:50:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,357 INFO L225 Difference]: With dead ends: 436 [2019-11-25 08:50:10,357 INFO L226 Difference]: Without dead ends: 212 [2019-11-25 08:50:10,358 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-25 08:50:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-25 08:50:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-11-25 08:50:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-25 08:50:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 374 transitions. [2019-11-25 08:50:10,381 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 374 transitions. Word has length 15 [2019-11-25 08:50:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,381 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 374 transitions. [2019-11-25 08:50:10,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 374 transitions. [2019-11-25 08:50:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:50:10,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,388 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,388 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash 259035552, now seen corresponding path program 1 times [2019-11-25 08:50:10,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804451510] [2019-11-25 08:50:10,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:10,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804451510] [2019-11-25 08:50:10,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165850230] [2019-11-25 08:50:10,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,463 INFO L87 Difference]: Start difference. First operand 212 states and 374 transitions. Second operand 3 states. [2019-11-25 08:50:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,763 INFO L93 Difference]: Finished difference Result 614 states and 1098 transitions. [2019-11-25 08:50:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:50:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,766 INFO L225 Difference]: With dead ends: 614 [2019-11-25 08:50:10,767 INFO L226 Difference]: Without dead ends: 406 [2019-11-25 08:50:10,767 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-25 08:50:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-25 08:50:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 400. [2019-11-25 08:50:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-11-25 08:50:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 718 transitions. [2019-11-25 08:50:10,782 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 718 transitions. Word has length 18 [2019-11-25 08:50:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,783 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 718 transitions. [2019-11-25 08:50:10,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 718 transitions. [2019-11-25 08:50:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:10,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,784 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2040900468, now seen corresponding path program 1 times [2019-11-25 08:50:10,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941744728] [2019-11-25 08:50:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:10,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941744728] [2019-11-25 08:50:10,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035375931] [2019-11-25 08:50:10,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,813 INFO L87 Difference]: Start difference. First operand 400 states and 718 transitions. Second operand 3 states. [2019-11-25 08:50:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,942 INFO L93 Difference]: Finished difference Result 636 states and 1130 transitions. [2019-11-25 08:50:10,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:10,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:50:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,944 INFO L225 Difference]: With dead ends: 636 [2019-11-25 08:50:10,944 INFO L226 Difference]: Without dead ends: 244 [2019-11-25 08:50:10,945 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-25 08:50:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-25 08:50:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-11-25 08:50:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-25 08:50:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 418 transitions. [2019-11-25 08:50:10,953 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 418 transitions. Word has length 19 [2019-11-25 08:50:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,953 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 418 transitions. [2019-11-25 08:50:10,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 418 transitions. [2019-11-25 08:50:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:10,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,954 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -548412413, now seen corresponding path program 1 times [2019-11-25 08:50:10,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448617022] [2019-11-25 08:50:10,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:10,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448617022] [2019-11-25 08:50:10,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:10,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130599877] [2019-11-25 08:50:10,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:10,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:10,991 INFO L87 Difference]: Start difference. First operand 242 states and 418 transitions. Second operand 3 states. [2019-11-25 08:50:11,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,135 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2019-11-25 08:50:11,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:11,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:50:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,138 INFO L225 Difference]: With dead ends: 244 [2019-11-25 08:50:11,138 INFO L226 Difference]: Without dead ends: 242 [2019-11-25 08:50:11,139 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-25 08:50:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-25 08:50:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-25 08:50:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-25 08:50:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 410 transitions. [2019-11-25 08:50:11,146 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 410 transitions. Word has length 19 [2019-11-25 08:50:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,146 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 410 transitions. [2019-11-25 08:50:11,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 410 transitions. [2019-11-25 08:50:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:50:11,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,147 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash -296229375, now seen corresponding path program 1 times [2019-11-25 08:50:11,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850869154] [2019-11-25 08:50:11,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:11,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850869154] [2019-11-25 08:50:11,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:11,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171098124] [2019-11-25 08:50:11,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:11,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:11,195 INFO L87 Difference]: Start difference. First operand 242 states and 410 transitions. Second operand 3 states. [2019-11-25 08:50:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,702 INFO L93 Difference]: Finished difference Result 649 states and 1104 transitions. [2019-11-25 08:50:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:11,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:50:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,705 INFO L225 Difference]: With dead ends: 649 [2019-11-25 08:50:11,706 INFO L226 Difference]: Without dead ends: 411 [2019-11-25 08:50:11,706 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-25 08:50:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-25 08:50:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 398. [2019-11-25 08:50:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-25 08:50:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 610 transitions. [2019-11-25 08:50:11,716 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 610 transitions. Word has length 22 [2019-11-25 08:50:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,717 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 610 transitions. [2019-11-25 08:50:11,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 610 transitions. [2019-11-25 08:50:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:50:11,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,718 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,719 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1547420847, now seen corresponding path program 1 times [2019-11-25 08:50:11,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30013715] [2019-11-25 08:50:11,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:11,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30013715] [2019-11-25 08:50:11,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:11,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548365140] [2019-11-25 08:50:11,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:11,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:11,756 INFO L87 Difference]: Start difference. First operand 398 states and 610 transitions. Second operand 3 states. [2019-11-25 08:50:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,805 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2019-11-25 08:50:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:11,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-25 08:50:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,808 INFO L225 Difference]: With dead ends: 729 [2019-11-25 08:50:11,808 INFO L226 Difference]: Without dead ends: 339 [2019-11-25 08:50:11,809 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-25 08:50:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-25 08:50:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2019-11-25 08:50:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-11-25 08:50:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 522 transitions. [2019-11-25 08:50:11,818 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 522 transitions. Word has length 32 [2019-11-25 08:50:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,818 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 522 transitions. [2019-11-25 08:50:11,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 522 transitions. [2019-11-25 08:50:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 08:50:11,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,820 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:50:11,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash -968828347, now seen corresponding path program 1 times [2019-11-25 08:50:11,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944159513] [2019-11-25 08:50:11,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:11,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944159513] [2019-11-25 08:50:11,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:11,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555478249] [2019-11-25 08:50:11,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:11,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:11,867 INFO L87 Difference]: Start difference. First operand 339 states and 522 transitions. Second operand 3 states. [2019-11-25 08:50:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,925 INFO L93 Difference]: Finished difference Result 664 states and 1029 transitions. [2019-11-25 08:50:11,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:11,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-25 08:50:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,927 INFO L225 Difference]: With dead ends: 664 [2019-11-25 08:50:11,928 INFO L226 Difference]: Without dead ends: 333 [2019-11-25 08:50:11,928 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-25 08:50:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-25 08:50:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-11-25 08:50:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-25 08:50:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 502 transitions. [2019-11-25 08:50:11,937 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 502 transitions. Word has length 33 [2019-11-25 08:50:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,938 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 502 transitions. [2019-11-25 08:50:11,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 502 transitions. [2019-11-25 08:50:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:50:11,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,941 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:50:11,942 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1704110053, now seen corresponding path program 1 times [2019-11-25 08:50:11,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265274053] [2019-11-25 08:50:11,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265274053] [2019-11-25 08:50:11,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955660746] [2019-11-25 08:50:11,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,996 INFO L87 Difference]: Start difference. First operand 333 states and 502 transitions. Second operand 4 states. [2019-11-25 08:50:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,414 INFO L93 Difference]: Finished difference Result 376 states and 543 transitions. [2019-11-25 08:50:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:12,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-25 08:50:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,417 INFO L225 Difference]: With dead ends: 376 [2019-11-25 08:50:12,417 INFO L226 Difference]: Without dead ends: 339 [2019-11-25 08:50:12,418 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-25 08:50:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-25 08:50:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2019-11-25 08:50:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-25 08:50:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2019-11-25 08:50:12,428 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 37 [2019-11-25 08:50:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,428 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2019-11-25 08:50:12,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2019-11-25 08:50:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:50:12,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,430 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:50:12,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -533172694, now seen corresponding path program 1 times [2019-11-25 08:50:12,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855125559] [2019-11-25 08:50:12,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:12,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855125559] [2019-11-25 08:50:12,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:12,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356614399] [2019-11-25 08:50:12,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:12,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:12,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:12,462 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand 3 states. [2019-11-25 08:50:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,508 INFO L93 Difference]: Finished difference Result 635 states and 888 transitions. [2019-11-25 08:50:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:12,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:50:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,511 INFO L225 Difference]: With dead ends: 635 [2019-11-25 08:50:12,511 INFO L226 Difference]: Without dead ends: 310 [2019-11-25 08:50:12,512 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-25 08:50:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-25 08:50:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-11-25 08:50:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-25 08:50:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2019-11-25 08:50:12,521 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 38 [2019-11-25 08:50:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,522 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2019-11-25 08:50:12,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2019-11-25 08:50:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:50:12,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,523 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:50:12,524 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,524 INFO L82 PathProgramCache]: Analyzing trace with hash -717812843, now seen corresponding path program 1 times [2019-11-25 08:50:12,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229562493] [2019-11-25 08:50:12,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:12,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229562493] [2019-11-25 08:50:12,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:12,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309002134] [2019-11-25 08:50:12,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:12,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:12,621 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand 3 states. [2019-11-25 08:50:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,666 INFO L93 Difference]: Finished difference Result 474 states and 665 transitions. [2019-11-25 08:50:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:12,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-25 08:50:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,667 INFO L225 Difference]: With dead ends: 474 [2019-11-25 08:50:12,667 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:50:12,668 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-25 08:50:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:50:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:50:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:50:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:50:12,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-11-25 08:50:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,669 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:50:12,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:50:12,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:50:12,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:50:12,808 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-11-25 08:50:12,853 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-11-25 08:50:12,854 INFO L444 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-11-25 08:50:12,855 INFO L444 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-11-25 08:50:12,856 INFO L444 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L440 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-11-25 08:50:12,857 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-11-25 08:50:12,858 INFO L444 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-11-25 08:50:12,859 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-11-25 08:50:12,860 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L440 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~this_m_conn~0)) (.cse1 (<= 1 ULTIMATE.start_main_~this_m_delta~0)) (.cse2 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0)) (.cse3 (= 0 ULTIMATE.start_main_~this_m_conn~0))) (or (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~this_m_conn_data_listener~0)) (and (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~q~0 2)) (and .cse1 (= ULTIMATE.start_main_~q~0 0) .cse2 .cse3))) [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-11-25 08:50:12,861 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-11-25 08:50:12,862 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-11-25 08:50:12,863 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-11-25 08:50:12,864 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:50:12,864 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-11-25 08:50:12,866 INFO L444 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-11-25 08:50:12,866 INFO L444 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-11-25 08:50:12,866 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-25 08:50:12,866 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-11-25 08:50:12,867 INFO L444 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-11-25 08:50:12,868 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-11-25 08:50:12,869 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-11-25 08:50:12,870 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-11-25 08:50:12,871 INFO L444 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-11-25 08:50:12,872 INFO L444 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-11-25 08:50:12,873 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L447 ceAbstractionStarter]: At program point L16(lines 16 1255) the Hoare annotation is: true [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-11-25 08:50:12,874 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-11-25 08:50:12,875 INFO L444 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-11-25 08:50:12,876 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-11-25 08:50:12,877 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-11-25 08:50:12,878 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-11-25 08:50:12,879 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-11-25 08:50:12,880 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-11-25 08:50:12,881 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-11-25 08:50:12,882 INFO L444 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-11-25 08:50:12,882 INFO L444 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-11-25 08:50:12,882 INFO L440 ceAbstractionStarter]: At program point L32-2(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~this_m_delta~0)) (.cse1 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0))) (or (and (<= 4 ULTIMATE.start_main_~q~0) (<= 1 ULTIMATE.start_main_~this_m_conn~0) .cse0 .cse1) (and .cse0 (= ULTIMATE.start_main_~q~0 0) .cse1 (= 0 ULTIMATE.start_main_~this_m_conn~0)))) [2019-11-25 08:50:12,882 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-11-25 08:50:12,882 INFO L444 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-11-25 08:50:12,882 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-11-25 08:50:12,883 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-11-25 08:50:12,884 INFO L444 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-11-25 08:50:12,884 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-11-25 08:50:12,884 INFO L444 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-25 08:50:12,884 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-11-25 08:50:12,884 INFO L444 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-11-25 08:50:12,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:12 BoogieIcfgContainer [2019-11-25 08:50:12,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:12,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:12,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:12,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:12,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:09" (3/4) ... [2019-11-25 08:50:12,905 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:50:12,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:50:12,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:50:12,965 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5d2553e6-1ac9-4234-b908-b9ea5947d800/bin/uautomizer/witness.graphml [2019-11-25 08:50:12,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:12,967 INFO L168 Benchmark]: Toolchain (without parser) took 7042.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.4 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -300.4 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,967 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:12,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1196.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -107.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,971 INFO L168 Benchmark]: Boogie Preprocessor took 138.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,972 INFO L168 Benchmark]: RCFGBuilder took 1986.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -194.0 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,972 INFO L168 Benchmark]: TraceAbstraction took 3482.84 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 73.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -42.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,973 INFO L168 Benchmark]: Witness Printer took 64.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:12,976 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1196.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -107.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1986.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -194.0 MB). Peak memory consumption was 220.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3482.84 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 73.4 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -42.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Witness Printer took 64.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: 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: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((q == 3 && 1 <= this_m_conn) && 1 <= this_m_delta) && 1 <= this_m_conn_data_listener) || (((4 <= q && 1 <= this_m_conn) && 1 <= this_m_delta) && this_m_conn_data_listener == 0)) || (((1 <= this_m_delta && this_m_conn_data_listener == 0) && 0 == this_m_conn) && q == 2)) || (((1 <= this_m_delta && q == 0) && this_m_conn_data_listener == 0) && 0 == this_m_conn) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((4 <= q && 1 <= this_m_conn) && 1 <= this_m_delta) && this_m_conn_data_listener == 0) || (((1 <= this_m_delta && q == 0) && this_m_conn_data_listener == 0) && 0 == this_m_conn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 237 locations, 1 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 4033 SDtfs, 2122 SDslu, 1761 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 82 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 11989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 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...