./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c -s /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/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 f6f6898c620b0d8224e47aa166b6d9a445824f7a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:58:32,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:58:32,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:58:32,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:58:32,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:58:32,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:58:32,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:58:32,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:58:32,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:58:32,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:58:32,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:58:32,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:58:32,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:58:32,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:58:32,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:58:32,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:58:32,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:58:32,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:58:32,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:58:32,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:58:32,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:58:32,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:58:32,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:58:32,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:58:32,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:58:32,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:58:32,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:58:32,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:58:32,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:58:32,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:58:32,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:58:32,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:58:32,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:58:32,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:58:32,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:58:32,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:58:32,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:58:32,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:58:32,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:58:32,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:58:32,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:58:32,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:58:32,777 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:58:32,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:58:32,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:58:32,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:58:32,779 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:58:32,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:58:32,780 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:58:32,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:58:32,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:58:32,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:58:32,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:58:32,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:58:32,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:58:32,781 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:58:32,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:58:32,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:58:32,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:58:32,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:58:32,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:58:32,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:58:32,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:58:32,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:58:32,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:58:32,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:58:32,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:58:32,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:58:32,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:58:32,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:58:32,785 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_041b75d8-f4fd-4db2-ba6b-367d91117463/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 -> f6f6898c620b0d8224e47aa166b6d9a445824f7a [2019-11-15 22:58:32,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:58:32,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:58:32,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:58:32,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:58:32,826 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:58:32,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2019-11-15 22:58:32,879 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/data/3195f0267/1138da3d14794950890cd4bc08969f40/FLAG193ceeb43 [2019-11-15 22:58:33,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:58:33,445 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2019-11-15 22:58:33,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/data/3195f0267/1138da3d14794950890cd4bc08969f40/FLAG193ceeb43 [2019-11-15 22:58:33,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/data/3195f0267/1138da3d14794950890cd4bc08969f40 [2019-11-15 22:58:33,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:58:33,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:58:33,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:58:33,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:58:33,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:58:33,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:58:33" (1/1) ... [2019-11-15 22:58:33,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2258f497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:33, skipping insertion in model container [2019-11-15 22:58:33,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:58:33" (1/1) ... [2019-11-15 22:58:33,867 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:58:33,927 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:58:34,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:58:34,610 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:58:34,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:58:34,879 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:58:34,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34 WrapperNode [2019-11-15 22:58:34,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:58:34,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:58:34,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:58:34,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:58:34,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:34,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:58:35,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:58:35,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:58:35,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:58:35,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... [2019-11-15 22:58:35,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:58:35,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:58:35,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:58:35,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:58:35,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/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-15 22:58:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:58:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:58:37,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:58:37,351 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:58:37,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:58:37 BoogieIcfgContainer [2019-11-15 22:58:37,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:58:37,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:58:37,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:58:37,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:58:37,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:58:33" (1/3) ... [2019-11-15 22:58:37,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1b987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:58:37, skipping insertion in model container [2019-11-15 22:58:37,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:58:34" (2/3) ... [2019-11-15 22:58:37,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1b987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:58:37, skipping insertion in model container [2019-11-15 22:58:37,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:58:37" (3/3) ... [2019-11-15 22:58:37,363 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2019-11-15 22:58:37,372 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:58:37,380 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:58:37,389 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:58:37,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:58:37,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:58:37,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:58:37,425 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:58:37,425 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:58:37,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:58:37,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:58:37,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:58:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-15 22:58:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:58:37,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:37,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:37,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:37,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1825602715, now seen corresponding path program 1 times [2019-11-15 22:58:37,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:37,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171803055] [2019-11-15 22:58:37,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:37,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:37,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:38,071 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-15 22:58:38,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171803055] [2019-11-15 22:58:38,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:38,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:58:38,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297057377] [2019-11-15 22:58:38,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:38,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:38,093 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-15 22:58:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:39,513 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-15 22:58:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:39,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-15 22:58:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:39,541 INFO L225 Difference]: With dead ends: 829 [2019-11-15 22:58:39,541 INFO L226 Difference]: Without dead ends: 463 [2019-11-15 22:58:39,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-15 22:58:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-15 22:58:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 22:58:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-15 22:58:39,630 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 201 [2019-11-15 22:58:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:39,633 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-15 22:58:39,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-15 22:58:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 22:58:39,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:39,643 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:39,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:39,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1178885579, now seen corresponding path program 1 times [2019-11-15 22:58:39,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:39,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838446635] [2019-11-15 22:58:39,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:39,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:39,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:58:39,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838446635] [2019-11-15 22:58:39,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:39,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:39,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366668153] [2019-11-15 22:58:39,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:58:39,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:58:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:58:39,763 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-15 22:58:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:41,398 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-15 22:58:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:58:41,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-15 22:58:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:41,407 INFO L225 Difference]: With dead ends: 1737 [2019-11-15 22:58:41,410 INFO L226 Difference]: Without dead ends: 1290 [2019-11-15 22:58:41,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:58:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-15 22:58:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-15 22:58:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-15 22:58:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-15 22:58:41,477 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 206 [2019-11-15 22:58:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:41,477 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-15 22:58:41,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:58:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-15 22:58:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 22:58:41,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:41,482 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:41,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1955705264, now seen corresponding path program 1 times [2019-11-15 22:58:41,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:41,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773462018] [2019-11-15 22:58:41,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:41,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:41,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:58:41,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773462018] [2019-11-15 22:58:41,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:41,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:41,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266443259] [2019-11-15 22:58:41,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:41,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:41,785 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 3 states. [2019-11-15 22:58:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:42,662 INFO L93 Difference]: Finished difference Result 2541 states and 3899 transitions. [2019-11-15 22:58:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:42,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-15 22:58:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:42,677 INFO L225 Difference]: With dead ends: 2541 [2019-11-15 22:58:42,677 INFO L226 Difference]: Without dead ends: 1684 [2019-11-15 22:58:42,680 INFO L600 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-15 22:58:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-15 22:58:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1683. [2019-11-15 22:58:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-11-15 22:58:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-11-15 22:58:42,720 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 208 [2019-11-15 22:58:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:42,720 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-11-15 22:58:42,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-11-15 22:58:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 22:58:42,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:42,726 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:42,727 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash -577423835, now seen corresponding path program 1 times [2019-11-15 22:58:42,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:42,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25680199] [2019-11-15 22:58:42,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:42,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:42,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:58:42,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25680199] [2019-11-15 22:58:42,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:42,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:58:42,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695499157] [2019-11-15 22:58:42,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:42,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:42,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:42,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:42,813 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-11-15 22:58:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:43,800 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-11-15 22:58:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:43,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-15 22:58:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:43,813 INFO L225 Difference]: With dead ends: 4189 [2019-11-15 22:58:43,814 INFO L226 Difference]: Without dead ends: 2508 [2019-11-15 22:58:43,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-15 22:58:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-11-15 22:58:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-11-15 22:58:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-11-15 22:58:43,868 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 216 [2019-11-15 22:58:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:43,869 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-11-15 22:58:43,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-11-15 22:58:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-15 22:58:43,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:43,876 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:43,877 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:43,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2019535467, now seen corresponding path program 1 times [2019-11-15 22:58:43,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:43,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503934569] [2019-11-15 22:58:43,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:43,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:43,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:58:43,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503934569] [2019-11-15 22:58:43,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:43,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:58:43,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109738917] [2019-11-15 22:58:43,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:43,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:43,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:43,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:43,981 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-11-15 22:58:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:44,434 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-11-15 22:58:44,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:44,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-11-15 22:58:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:44,460 INFO L225 Difference]: With dead ends: 7497 [2019-11-15 22:58:44,460 INFO L226 Difference]: Without dead ends: 4992 [2019-11-15 22:58:44,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-11-15 22:58:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-11-15 22:58:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-11-15 22:58:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-11-15 22:58:44,675 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 221 [2019-11-15 22:58:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:44,675 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-11-15 22:58:44,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-11-15 22:58:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 22:58:44,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:44,687 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:44,688 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:44,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1510049729, now seen corresponding path program 1 times [2019-11-15 22:58:44,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:44,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250895812] [2019-11-15 22:58:44,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:44,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:44,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 22:58:44,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250895812] [2019-11-15 22:58:44,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372093914] [2019-11-15 22:58:44,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:58:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:44,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:58:44,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:58:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 22:58:45,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:58:45,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-15 22:58:45,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922306035] [2019-11-15 22:58:45,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:45,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:58:45,068 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-11-15 22:58:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:45,449 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-11-15 22:58:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:45,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-11-15 22:58:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:45,502 INFO L225 Difference]: With dead ends: 14957 [2019-11-15 22:58:45,502 INFO L226 Difference]: Without dead ends: 9970 [2019-11-15 22:58:45,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 230 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-15 22:58:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-11-15 22:58:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-11-15 22:58:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-11-15 22:58:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-11-15 22:58:45,737 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 230 [2019-11-15 22:58:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:45,738 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-11-15 22:58:45,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-11-15 22:58:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 22:58:45,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:45,766 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:45,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:58:45,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash -165449129, now seen corresponding path program 1 times [2019-11-15 22:58:45,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:45,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209762046] [2019-11-15 22:58:45,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:45,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:45,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:58:46,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209762046] [2019-11-15 22:58:46,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:46,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:58:46,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509310023] [2019-11-15 22:58:46,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:58:46,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:58:46,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:58:46,178 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-11-15 22:58:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:48,420 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-11-15 22:58:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:58:48,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 239 [2019-11-15 22:58:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:48,480 INFO L225 Difference]: With dead ends: 22448 [2019-11-15 22:58:48,480 INFO L226 Difference]: Without dead ends: 12482 [2019-11-15 22:58:48,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:58:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-11-15 22:58:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-11-15 22:58:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-15 22:58:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-11-15 22:58:48,715 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 239 [2019-11-15 22:58:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:48,715 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-11-15 22:58:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:58:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-11-15 22:58:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 22:58:48,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:48,736 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:48,737 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2048084382, now seen corresponding path program 1 times [2019-11-15 22:58:48,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:48,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943468978] [2019-11-15 22:58:48,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:48,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:48,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:58:48,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943468978] [2019-11-15 22:58:48,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:48,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:48,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183219046] [2019-11-15 22:58:48,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:48,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:48,849 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-11-15 22:58:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:49,958 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-11-15 22:58:49,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:49,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-15 22:58:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:49,981 INFO L225 Difference]: With dead ends: 21582 [2019-11-15 22:58:49,981 INFO L226 Difference]: Without dead ends: 10804 [2019-11-15 22:58:49,995 INFO L600 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-15 22:58:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-11-15 22:58:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-11-15 22:58:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-11-15 22:58:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-11-15 22:58:50,330 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 239 [2019-11-15 22:58:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:50,331 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-11-15 22:58:50,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-11-15 22:58:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 22:58:50,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:50,350 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:50,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash 543919919, now seen corresponding path program 1 times [2019-11-15 22:58:50,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:50,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782972620] [2019-11-15 22:58:50,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:50,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:50,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:58:50,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782972620] [2019-11-15 22:58:50,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:50,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:50,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589371559] [2019-11-15 22:58:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:58:50,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:58:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:58:50,454 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-11-15 22:58:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:52,054 INFO L93 Difference]: Finished difference Result 39482 states and 52679 transitions. [2019-11-15 22:58:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:58:52,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-15 22:58:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:52,105 INFO L225 Difference]: With dead ends: 39482 [2019-11-15 22:58:52,105 INFO L226 Difference]: Without dead ends: 28704 [2019-11-15 22:58:52,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:58:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28704 states. [2019-11-15 22:58:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28704 to 20132. [2019-11-15 22:58:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-11-15 22:58:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26025 transitions. [2019-11-15 22:58:52,459 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26025 transitions. Word has length 239 [2019-11-15 22:58:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:52,460 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26025 transitions. [2019-11-15 22:58:52,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:58:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26025 transitions. [2019-11-15 22:58:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 22:58:52,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:52,496 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:52,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1047521392, now seen corresponding path program 1 times [2019-11-15 22:58:52,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:52,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829499606] [2019-11-15 22:58:52,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:52,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:52,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:58:52,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829499606] [2019-11-15 22:58:52,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:52,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:52,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031853872] [2019-11-15 22:58:52,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:52,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:52,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:52,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:52,612 INFO L87 Difference]: Start difference. First operand 20132 states and 26025 transitions. Second operand 3 states. [2019-11-15 22:58:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:53,988 INFO L93 Difference]: Finished difference Result 55495 states and 71437 transitions. [2019-11-15 22:58:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:53,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-15 22:58:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:54,049 INFO L225 Difference]: With dead ends: 55495 [2019-11-15 22:58:54,050 INFO L226 Difference]: Without dead ends: 35365 [2019-11-15 22:58:54,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-11-15 22:58:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-11-15 22:58:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-11-15 22:58:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41632 transitions. [2019-11-15 22:58:54,527 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41632 transitions. Word has length 245 [2019-11-15 22:58:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:54,527 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41632 transitions. [2019-11-15 22:58:54,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41632 transitions. [2019-11-15 22:58:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-15 22:58:54,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:54,573 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:54,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 195659315, now seen corresponding path program 1 times [2019-11-15 22:58:54,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:54,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559263218] [2019-11-15 22:58:54,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:54,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:54,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:58:54,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559263218] [2019-11-15 22:58:54,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377841954] [2019-11-15 22:58:54,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:58:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:54,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:58:54,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:58:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:58:55,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:58:55,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-15 22:58:55,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096254600] [2019-11-15 22:58:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:55,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:55,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:58:55,003 INFO L87 Difference]: Start difference. First operand 35357 states and 41632 transitions. Second operand 3 states. [2019-11-15 22:58:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:55,936 INFO L93 Difference]: Finished difference Result 102510 states and 120668 transitions. [2019-11-15 22:58:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:55,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-11-15 22:58:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:56,075 INFO L225 Difference]: With dead ends: 102510 [2019-11-15 22:58:56,075 INFO L226 Difference]: Without dead ends: 67155 [2019-11-15 22:58:56,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:58:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67155 states. [2019-11-15 22:58:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67155 to 67149. [2019-11-15 22:58:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67149 states. [2019-11-15 22:58:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67149 states to 67149 states and 79021 transitions. [2019-11-15 22:58:56,927 INFO L78 Accepts]: Start accepts. Automaton has 67149 states and 79021 transitions. Word has length 269 [2019-11-15 22:58:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:58:56,931 INFO L462 AbstractCegarLoop]: Abstraction has 67149 states and 79021 transitions. [2019-11-15 22:58:56,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:58:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 67149 states and 79021 transitions. [2019-11-15 22:58:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 22:58:56,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:58:56,970 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:58:57,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:58:57,174 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:58:57,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:58:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash -515489302, now seen corresponding path program 1 times [2019-11-15 22:58:57,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:58:57,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145558825] [2019-11-15 22:58:57,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:57,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:58:57,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:58:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:58:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:58:57,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145558825] [2019-11-15 22:58:57,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:58:57,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:58:57,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800235016] [2019-11-15 22:58:57,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:58:57,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:58:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:58:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:57,313 INFO L87 Difference]: Start difference. First operand 67149 states and 79021 transitions. Second operand 3 states. [2019-11-15 22:58:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:58:59,051 INFO L93 Difference]: Finished difference Result 159671 states and 190266 transitions. [2019-11-15 22:58:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:58:59,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-15 22:58:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:58:59,160 INFO L225 Difference]: With dead ends: 159671 [2019-11-15 22:58:59,160 INFO L226 Difference]: Without dead ends: 92524 [2019-11-15 22:58:59,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:58:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92524 states. [2019-11-15 22:59:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92524 to 92524. [2019-11-15 22:59:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92524 states. [2019-11-15 22:59:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92524 states to 92524 states and 106045 transitions. [2019-11-15 22:59:00,243 INFO L78 Accepts]: Start accepts. Automaton has 92524 states and 106045 transitions. Word has length 278 [2019-11-15 22:59:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:00,244 INFO L462 AbstractCegarLoop]: Abstraction has 92524 states and 106045 transitions. [2019-11-15 22:59:00,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:59:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 92524 states and 106045 transitions. [2019-11-15 22:59:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-15 22:59:00,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:00,284 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:59:00,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:59:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash 571873565, now seen corresponding path program 1 times [2019-11-15 22:59:00,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:00,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741822583] [2019-11-15 22:59:00,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:00,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:00,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:59:00,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741822583] [2019-11-15 22:59:00,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:00,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:59:00,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866775367] [2019-11-15 22:59:00,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:59:00,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:59:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:59:00,543 INFO L87 Difference]: Start difference. First operand 92524 states and 106045 transitions. Second operand 4 states. [2019-11-15 22:59:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:02,974 INFO L93 Difference]: Finished difference Result 256447 states and 294319 transitions. [2019-11-15 22:59:02,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:59:02,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-15 22:59:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:03,177 INFO L225 Difference]: With dead ends: 256447 [2019-11-15 22:59:03,177 INFO L226 Difference]: Without dead ends: 163925 [2019-11-15 22:59:03,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:59:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163925 states. [2019-11-15 22:59:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163925 to 126425. [2019-11-15 22:59:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126425 states. [2019-11-15 22:59:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126425 states to 126425 states and 145685 transitions. [2019-11-15 22:59:05,131 INFO L78 Accepts]: Start accepts. Automaton has 126425 states and 145685 transitions. Word has length 299 [2019-11-15 22:59:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:05,131 INFO L462 AbstractCegarLoop]: Abstraction has 126425 states and 145685 transitions. [2019-11-15 22:59:05,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:59:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 126425 states and 145685 transitions. [2019-11-15 22:59:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-15 22:59:05,199 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:05,199 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:59:05,200 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:59:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1000248581, now seen corresponding path program 1 times [2019-11-15 22:59:05,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:05,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758389421] [2019-11-15 22:59:05,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:05,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:05,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 22:59:05,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758389421] [2019-11-15 22:59:05,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:05,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:59:05,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33075463] [2019-11-15 22:59:05,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:59:05,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:59:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:05,383 INFO L87 Difference]: Start difference. First operand 126425 states and 145685 transitions. Second operand 3 states. [2019-11-15 22:59:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:06,481 INFO L93 Difference]: Finished difference Result 252840 states and 291360 transitions. [2019-11-15 22:59:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:59:06,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-15 22:59:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:06,638 INFO L225 Difference]: With dead ends: 252840 [2019-11-15 22:59:06,639 INFO L226 Difference]: Without dead ends: 126417 [2019-11-15 22:59:06,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126417 states. [2019-11-15 22:59:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126417 to 126417. [2019-11-15 22:59:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126417 states. [2019-11-15 22:59:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126417 states to 126417 states and 145661 transitions. [2019-11-15 22:59:09,036 INFO L78 Accepts]: Start accepts. Automaton has 126417 states and 145661 transitions. Word has length 326 [2019-11-15 22:59:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:09,037 INFO L462 AbstractCegarLoop]: Abstraction has 126417 states and 145661 transitions. [2019-11-15 22:59:09,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:59:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 126417 states and 145661 transitions. [2019-11-15 22:59:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-15 22:59:09,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:09,088 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:59:09,088 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:59:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1115478692, now seen corresponding path program 1 times [2019-11-15 22:59:09,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:09,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047225744] [2019-11-15 22:59:09,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:09,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:09,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-15 22:59:09,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047225744] [2019-11-15 22:59:09,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:59:09,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:59:09,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452972558] [2019-11-15 22:59:09,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:59:09,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:59:09,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:09,292 INFO L87 Difference]: Start difference. First operand 126417 states and 145661 transitions. Second operand 3 states. [2019-11-15 22:59:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:10,400 INFO L93 Difference]: Finished difference Result 233377 states and 268997 transitions. [2019-11-15 22:59:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:59:10,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-11-15 22:59:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:10,505 INFO L225 Difference]: With dead ends: 233377 [2019-11-15 22:59:10,505 INFO L226 Difference]: Without dead ends: 106962 [2019-11-15 22:59:10,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:59:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106962 states. [2019-11-15 22:59:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106962 to 60220. [2019-11-15 22:59:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60220 states. [2019-11-15 22:59:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 68997 transitions. [2019-11-15 22:59:11,352 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 68997 transitions. Word has length 327 [2019-11-15 22:59:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:11,353 INFO L462 AbstractCegarLoop]: Abstraction has 60220 states and 68997 transitions. [2019-11-15 22:59:11,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:59:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 68997 transitions. [2019-11-15 22:59:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-15 22:59:11,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:59:11,374 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:59:11,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:59:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:59:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1143996101, now seen corresponding path program 1 times [2019-11-15 22:59:11,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:59:11,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312490751] [2019-11-15 22:59:11,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:11,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:59:11,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:59:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-15 22:59:14,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312490751] [2019-11-15 22:59:14,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686942825] [2019-11-15 22:59:14,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:59:14,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:59:14,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:59:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:59:14,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:59:14,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 22:59:14,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98111761] [2019-11-15 22:59:14,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:59:14,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:59:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:59:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:14,500 INFO L87 Difference]: Start difference. First operand 60220 states and 68997 transitions. Second operand 3 states. [2019-11-15 22:59:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:59:15,620 INFO L93 Difference]: Finished difference Result 123718 states and 141396 transitions. [2019-11-15 22:59:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:59:15,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-15 22:59:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:59:15,622 INFO L225 Difference]: With dead ends: 123718 [2019-11-15 22:59:15,622 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:59:15,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:59:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:59:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:59:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:59:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:59:15,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2019-11-15 22:59:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:59:15,656 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:59:15,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:59:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:59:15,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:59:15,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:59:15,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:59:18,972 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-15 22:59:21,041 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 1506 DAG size of output: 491 [2019-11-15 22:59:23,207 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 437 DAG size of output: 55 [2019-11-15 22:59:25,086 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 437 DAG size of output: 55 [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,088 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,089 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-15 22:59:25,090 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,091 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-15 22:59:25,092 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,093 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:59:25,094 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,095 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-15 22:59:25,096 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-15 22:59:25,097 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-15 22:59:25,097 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-15 22:59:25,097 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,097 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,097 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,098 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse14 (= ~a12~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (= ~a27~0 1)) (.cse13 (not .cse14))) (let ((.cse6 (and .cse7 .cse13)) (.cse4 (= 1 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse3 (= ~a26~0 1)) (.cse12 (<= ~a3~0 0)) (.cse1 (= ~a18~0 1)) (.cse11 (and .cse0 .cse9)) (.cse5 (<= ~a26~0 0)) (.cse2 (= ~a5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse2) (and .cse1 .cse6 .cse5 .cse2) (and .cse0 .cse1 .cse6 .cse2) (and .cse0 .cse1 .cse7 .cse5 .cse2 .cse8) (and .cse1 .cse2 (and .cse6 .cse9)) (and .cse1 (and .cse0 .cse10) .cse5 .cse2) (and .cse11 .cse1 .cse4 .cse2) (and .cse12 .cse1 .cse7 .cse2) (and .cse1 .cse5 .cse2 (and .cse13 .cse9)) (and (<= ~a6~0 0) .cse1 .cse2 .cse3) (and .cse1 (and .cse0 .cse7 .cse9) .cse5 .cse2) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse3) (and .cse1 .cse4 .cse14 .cse5 .cse2 .cse10) (and .cse12 .cse1 .cse2 .cse3) (and .cse0 .cse13 .cse1 .cse5 .cse2) (and .cse0 .cse13 .cse1 .cse2 .cse8) (and .cse1 .cse7 .cse14 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3) (and .cse12 .cse1 .cse11 .cse5 .cse2))))) [2019-11-15 22:59:25,098 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,098 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,098 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,098 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,099 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-15 22:59:25,100 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,101 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-15 22:59:25,102 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,103 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse14 (= ~a12~0 1))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse9 (not (= 1 ~a6~0))) (.cse7 (= ~a27~0 1)) (.cse13 (not .cse14))) (let ((.cse6 (and .cse7 .cse13)) (.cse4 (= 1 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse10 (= ~a16~0 1)) (.cse3 (= ~a26~0 1)) (.cse12 (<= ~a3~0 0)) (.cse1 (= ~a18~0 1)) (.cse11 (and .cse0 .cse9)) (.cse5 (<= ~a26~0 0)) (.cse2 (= ~a5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse2) (and .cse1 .cse6 .cse5 .cse2) (and .cse0 .cse1 .cse6 .cse2) (and .cse0 .cse1 .cse7 .cse5 .cse2 .cse8) (and .cse1 .cse2 (and .cse6 .cse9)) (and .cse1 (and .cse0 .cse10) .cse5 .cse2) (and .cse11 .cse1 .cse4 .cse2) (and .cse12 .cse1 .cse7 .cse2) (and .cse1 .cse5 .cse2 (and .cse13 .cse9)) (and (<= ~a6~0 0) .cse1 .cse2 .cse3) (and .cse1 (and .cse0 .cse7 .cse9) .cse5 .cse2) (and .cse1 .cse7 .cse2 .cse8 .cse9 .cse3) (and .cse1 .cse4 .cse14 .cse5 .cse2 .cse10) (and .cse12 .cse1 .cse2 .cse3) (and .cse0 .cse13 .cse1 .cse5 .cse2) (and .cse0 .cse13 .cse1 .cse2 .cse8) (and .cse1 .cse7 .cse14 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3) (and .cse12 .cse1 .cse11 .cse5 .cse2))))) [2019-11-15 22:59:25,103 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,103 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,103 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,104 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1638) no Hoare annotation was computed. [2019-11-15 22:59:25,105 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,106 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-15 22:59:25,107 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,108 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-15 22:59:25,109 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,110 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-15 22:59:25,111 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,112 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,113 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-15 22:59:25,114 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,115 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,116 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,117 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-15 22:59:25,118 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-15 22:59:25,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:59:25 BoogieIcfgContainer [2019-11-15 22:59:25,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:59:25,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:59:25,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:59:25,147 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:59:25,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:58:37" (3/4) ... [2019-11-15 22:59:25,150 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:59:25,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:59:25,192 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:59:25,455 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_041b75d8-f4fd-4db2-ba6b-367d91117463/bin/uautomizer/witness.graphml [2019-11-15 22:59:25,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:59:25,457 INFO L168 Benchmark]: Toolchain (without parser) took 51604.53 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 938.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,457 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:59:25,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1026.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,458 INFO L168 Benchmark]: Boogie Preprocessor took 114.69 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,458 INFO L168 Benchmark]: RCFGBuilder took 2219.00 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: 17.1 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,459 INFO L168 Benchmark]: TraceAbstraction took 47792.60 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,459 INFO L168 Benchmark]: Witness Printer took 309.36 ms. Allocated memory is still 4.1 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:59:25,461 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1026.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.69 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2219.00 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: 17.1 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47792.60 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 309.36 ms. Allocated memory is still 4.1 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1638]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == a11) && a18 == 1) && a5 == 1) && a26 == 1) || ((((!(1 == a11) && a18 == 1) && 1 == a3) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || (((!(1 == a11) && a18 == 1) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(1 == a11) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((a18 == 1 && a5 == 1) && (a27 == 1 && !(a12 == 1)) && !(1 == a6))) || (((a18 == 1 && !(1 == a11) && a16 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(1 == a6)) && a18 == 1) && 1 == a3) && a5 == 1)) || (((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1)) || (((a18 == 1 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((a18 == 1 && (!(1 == a11) && a27 == 1) && !(1 == a6)) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && a27 == 1) && a5 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && 1 == a3) && a12 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a5 == 1) && a29 == 1)) || ((((a18 == 1 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && !(1 == a11) && !(1 == a6)) && a26 <= 0) && a5 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == a11) && a18 == 1) && a5 == 1) && a26 == 1) || ((((!(1 == a11) && a18 == 1) && 1 == a3) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && a27 == 1 && !(a12 == 1)) && a26 <= 0) && a5 == 1)) || (((!(1 == a11) && a18 == 1) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(1 == a11) && a18 == 1) && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1)) || ((a18 == 1 && a5 == 1) && (a27 == 1 && !(a12 == 1)) && !(1 == a6))) || (((a18 == 1 && !(1 == a11) && a16 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(1 == a6)) && a18 == 1) && 1 == a3) && a5 == 1)) || (((a3 <= 0 && a18 == 1) && a27 == 1) && a5 == 1)) || (((a18 == 1 && a26 <= 0) && a5 == 1) && !(a12 == 1) && !(1 == a6))) || (((a6 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || (((a18 == 1 && (!(1 == a11) && a27 == 1) && !(1 == a6)) && a26 <= 0) && a5 == 1)) || (((((a18 == 1 && a27 == 1) && a5 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || (((((a18 == 1 && 1 == a3) && a12 == 1) && a26 <= 0) && a5 == 1) && a16 == 1)) || (((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || ((((!(1 == a11) && !(a12 == 1)) && a18 == 1) && a5 == 1) && a29 == 1)) || ((((a18 == 1 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((!(a12 == 1) && a18 == 1) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && !(1 == a11) && !(1 == a6)) && a26 <= 0) && a5 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 47.6s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, HoareTripleCheckerStatistics: 3237 SDtfs, 5456 SDslu, 1446 SDs, 0 SdLazy, 9602 SolverSat, 1909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 879 GetRequests, 846 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126425occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 95006 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 625 NumberOfFragments, 707 HoareAnnotationTreeSize, 3 FomulaSimplifications, 54814 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 21184 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 4906 NumberOfCodeBlocks, 4906 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 4887 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060154 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 1612/1626 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...