./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/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 9197060d9e6f590900f81f4b5b3ae266edbba8aa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:53:54,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:53:54,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:53:54,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:53:54,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:53:54,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:53:54,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:53:54,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:53:54,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:53:54,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:53:54,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:53:54,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:53:54,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:53:54,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:53:54,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:53:54,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:53:54,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:53:54,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:53:54,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:53:54,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:53:54,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:53:54,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:53:54,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:53:54,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:53:54,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:53:54,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:53:54,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:53:54,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:53:54,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:53:54,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:53:54,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:53:54,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:53:54,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:53:54,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:53:54,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:53:54,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:53:54,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:53:54,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:53:54,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:53:54,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:53:54,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:53:54,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:53:54,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:53:54,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:53:54,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:53:54,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:53:54,839 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:53:54,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:53:54,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:53:54,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:53:54,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:53:54,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:53:54,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:53:54,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:53:54,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:53:54,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:53:54,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:53:54,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:53:54,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:53:54,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:53:54,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:53:54,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:53:54,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:53:54,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:53:54,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:53:54,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:53:54,844 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_4e85511c-7992-4955-9d9e-24a529794286/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 -> 9197060d9e6f590900f81f4b5b3ae266edbba8aa [2019-12-07 18:53:54,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:53:54,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:53:54,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:53:54,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:53:54,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:53:54,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2019-12-07 18:53:55,012 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/data/258404402/e5f9fb93874b4670985a071c3ec00253/FLAGb5040a94a [2019-12-07 18:53:55,495 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:53:55,496 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2019-12-07 18:53:55,508 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/data/258404402/e5f9fb93874b4670985a071c3ec00253/FLAGb5040a94a [2019-12-07 18:53:55,517 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/data/258404402/e5f9fb93874b4670985a071c3ec00253 [2019-12-07 18:53:55,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:53:55,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:53:55,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:55,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:53:55,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:53:55,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:55" (1/1) ... [2019-12-07 18:53:55,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:55, skipping insertion in model container [2019-12-07 18:53:55,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:53:55" (1/1) ... [2019-12-07 18:53:55,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:53:55,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:53:55,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:55,972 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:53:56,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:53:56,141 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:53:56,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56 WrapperNode [2019-12-07 18:53:56,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:53:56,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:53:56,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:53:56,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:53:56,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:53:56,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:53:56,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:53:56,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:53:56,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... [2019-12-07 18:53:56,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:53:56,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:53:56,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:53:56,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:53:56,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/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-12-07 18:53:56,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:53:56,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:53:57,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:53:57,484 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:53:57,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:57 BoogieIcfgContainer [2019-12-07 18:53:57,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:53:57,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:53:57,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:53:57,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:53:57,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:53:55" (1/3) ... [2019-12-07 18:53:57,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c33ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:53:57, skipping insertion in model container [2019-12-07 18:53:57,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:53:56" (2/3) ... [2019-12-07 18:53:57,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c33ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:53:57, skipping insertion in model container [2019-12-07 18:53:57,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:57" (3/3) ... [2019-12-07 18:53:57,491 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label14.c [2019-12-07 18:53:57,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:53:57,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:53:57,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:53:57,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:53:57,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:53:57,530 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:53:57,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:53:57,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:53:57,530 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:53:57,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:53:57,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:53:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 18:53:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 18:53:57,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:57,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:53:57,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 294910218, now seen corresponding path program 1 times [2019-12-07 18:53:57,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:57,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851816471] [2019-12-07 18:53:57,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:57,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851816471] [2019-12-07 18:53:57,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:57,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:57,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114228468] [2019-12-07 18:53:57,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:57,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:57,987 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 18:53:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:59,189 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-12-07 18:53:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:53:59,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-12-07 18:53:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:53:59,204 INFO L225 Difference]: With dead ends: 1068 [2019-12-07 18:53:59,204 INFO L226 Difference]: Without dead ends: 670 [2019-12-07 18:53:59,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-07 18:53:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-12-07 18:53:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-12-07 18:53:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-12-07 18:53:59,258 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 170 [2019-12-07 18:53:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:53:59,259 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-12-07 18:53:59,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:53:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-12-07 18:53:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 18:53:59,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:53:59,264 INFO L410 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] [2019-12-07 18:53:59,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:53:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash -429687334, now seen corresponding path program 1 times [2019-12-07 18:53:59,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:53:59,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340167716] [2019-12-07 18:53:59,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:53:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:59,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340167716] [2019-12-07 18:53:59,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:53:59,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:53:59,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828710391] [2019-12-07 18:53:59,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:53:59,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:53:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:53:59,342 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-12-07 18:54:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:00,372 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-12-07 18:54:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:00,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-12-07 18:54:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:00,378 INFO L225 Difference]: With dead ends: 1762 [2019-12-07 18:54:00,378 INFO L226 Difference]: Without dead ends: 1308 [2019-12-07 18:54:00,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-12-07 18:54:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-12-07 18:54:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 18:54:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-12-07 18:54:00,401 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 175 [2019-12-07 18:54:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:00,401 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-12-07 18:54:00,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-12-07 18:54:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 18:54:00,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:00,404 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:54:00,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:00,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1109940201, now seen corresponding path program 1 times [2019-12-07 18:54:00,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:00,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407879120] [2019-12-07 18:54:00,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:54:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407879120] [2019-12-07 18:54:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:00,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:54:00,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320925513] [2019-12-07 18:54:00,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:00,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:00,458 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-12-07 18:54:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:01,139 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-12-07 18:54:01,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:01,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-12-07 18:54:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:01,145 INFO L225 Difference]: With dead ends: 2567 [2019-12-07 18:54:01,145 INFO L226 Difference]: Without dead ends: 1700 [2019-12-07 18:54:01,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-07 18:54:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-12-07 18:54:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-12-07 18:54:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-12-07 18:54:01,171 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 178 [2019-12-07 18:54:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:01,171 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-12-07 18:54:01,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-12-07 18:54:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 18:54:01,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:01,174 INFO L410 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] [2019-12-07 18:54:01,175 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 151177408, now seen corresponding path program 1 times [2019-12-07 18:54:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34301427] [2019-12-07 18:54:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:54:01,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34301427] [2019-12-07 18:54:01,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:01,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:54:01,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935513193] [2019-12-07 18:54:01,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:01,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:01,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:01,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:01,226 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-12-07 18:54:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:01,912 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-12-07 18:54:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:01,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 18:54:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:01,921 INFO L225 Difference]: With dead ends: 4189 [2019-12-07 18:54:01,921 INFO L226 Difference]: Without dead ends: 2508 [2019-12-07 18:54:01,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-12-07 18:54:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-12-07 18:54:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-07 18:54:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-12-07 18:54:01,961 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 185 [2019-12-07 18:54:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:01,961 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-12-07 18:54:01,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-12-07 18:54:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 18:54:01,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:01,965 INFO L410 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] [2019-12-07 18:54:01,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:01,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1497770160, now seen corresponding path program 1 times [2019-12-07 18:54:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:01,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090576186] [2019-12-07 18:54:01,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 18:54:02,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090576186] [2019-12-07 18:54:02,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:02,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:54:02,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394904326] [2019-12-07 18:54:02,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:02,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:02,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:02,028 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-12-07 18:54:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:02,288 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-12-07 18:54:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:02,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-12-07 18:54:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:02,306 INFO L225 Difference]: With dead ends: 7497 [2019-12-07 18:54:02,306 INFO L226 Difference]: Without dead ends: 4992 [2019-12-07 18:54:02,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-12-07 18:54:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-12-07 18:54:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-07 18:54:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-12-07 18:54:02,380 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 190 [2019-12-07 18:54:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:02,380 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-12-07 18:54:02,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-12-07 18:54:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 18:54:02,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:02,386 INFO L410 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] [2019-12-07 18:54:02,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1140931236, now seen corresponding path program 1 times [2019-12-07 18:54:02,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:02,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052875773] [2019-12-07 18:54:02,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 18:54:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052875773] [2019-12-07 18:54:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760007162] [2019-12-07 18:54:02,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/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-12-07 18:54:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:02,594 INFO L264 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:54:02,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:54:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:54:02,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:54:02,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 18:54:02,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675214367] [2019-12-07 18:54:02,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:02,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:02,644 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 3 states. [2019-12-07 18:54:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:02,904 INFO L93 Difference]: Finished difference Result 14957 states and 21122 transitions. [2019-12-07 18:54:02,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:02,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-12-07 18:54:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:02,942 INFO L225 Difference]: With dead ends: 14957 [2019-12-07 18:54:02,942 INFO L226 Difference]: Without dead ends: 9970 [2019-12-07 18:54:02,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 199 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-12-07 18:54:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2019-12-07 18:54:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2019-12-07 18:54:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9968 states. [2019-12-07 18:54:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14047 transitions. [2019-12-07 18:54:03,083 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14047 transitions. Word has length 199 [2019-12-07 18:54:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:03,083 INFO L462 AbstractCegarLoop]: Abstraction has 9968 states and 14047 transitions. [2019-12-07 18:54:03,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14047 transitions. [2019-12-07 18:54:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 18:54:03,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:03,094 INFO L410 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] [2019-12-07 18:54:03,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:54:03,295 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2064135474, now seen corresponding path program 1 times [2019-12-07 18:54:03,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:03,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367353803] [2019-12-07 18:54:03,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:54:03,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367353803] [2019-12-07 18:54:03,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:03,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:54:03,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572195682] [2019-12-07 18:54:03,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:54:03,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:54:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:54:03,390 INFO L87 Difference]: Start difference. First operand 9968 states and 14047 transitions. Second operand 5 states. [2019-12-07 18:54:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:04,796 INFO L93 Difference]: Finished difference Result 22448 states and 31892 transitions. [2019-12-07 18:54:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:54:04,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-12-07 18:54:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:04,830 INFO L225 Difference]: With dead ends: 22448 [2019-12-07 18:54:04,830 INFO L226 Difference]: Without dead ends: 12482 [2019-12-07 18:54:04,838 INFO L630 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-12-07 18:54:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12482 states. [2019-12-07 18:54:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12482 to 10780. [2019-12-07 18:54:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-12-07 18:54:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 15197 transitions. [2019-12-07 18:54:04,951 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 15197 transitions. Word has length 208 [2019-12-07 18:54:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:04,951 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 15197 transitions. [2019-12-07 18:54:04,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:54:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 15197 transitions. [2019-12-07 18:54:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 18:54:04,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:04,961 INFO L410 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] [2019-12-07 18:54:04,961 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1228512291, now seen corresponding path program 1 times [2019-12-07 18:54:04,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:04,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663520663] [2019-12-07 18:54:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:54:05,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663520663] [2019-12-07 18:54:05,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:05,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748557488] [2019-12-07 18:54:05,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:05,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:05,027 INFO L87 Difference]: Start difference. First operand 10780 states and 15197 transitions. Second operand 3 states. [2019-12-07 18:54:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:05,677 INFO L93 Difference]: Finished difference Result 21582 states and 30438 transitions. [2019-12-07 18:54:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:05,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-12-07 18:54:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:05,691 INFO L225 Difference]: With dead ends: 21582 [2019-12-07 18:54:05,691 INFO L226 Difference]: Without dead ends: 10804 [2019-12-07 18:54:05,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-12-07 18:54:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10780. [2019-12-07 18:54:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10780 states. [2019-12-07 18:54:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10780 states to 10780 states and 14411 transitions. [2019-12-07 18:54:05,786 INFO L78 Accepts]: Start accepts. Automaton has 10780 states and 14411 transitions. Word has length 208 [2019-12-07 18:54:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:05,786 INFO L462 AbstractCegarLoop]: Abstraction has 10780 states and 14411 transitions. [2019-12-07 18:54:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10780 states and 14411 transitions. [2019-12-07 18:54:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 18:54:05,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:05,795 INFO L410 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] [2019-12-07 18:54:05,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 703981814, now seen corresponding path program 1 times [2019-12-07 18:54:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788236864] [2019-12-07 18:54:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 18:54:05,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788236864] [2019-12-07 18:54:05,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:05,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:05,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236799567] [2019-12-07 18:54:05,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:05,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:05,884 INFO L87 Difference]: Start difference. First operand 10780 states and 14411 transitions. Second operand 4 states. [2019-12-07 18:54:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:06,893 INFO L93 Difference]: Finished difference Result 39484 states and 52680 transitions. [2019-12-07 18:54:06,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:06,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-12-07 18:54:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:06,918 INFO L225 Difference]: With dead ends: 39484 [2019-12-07 18:54:06,919 INFO L226 Difference]: Without dead ends: 28706 [2019-12-07 18:54:06,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-12-07 18:54:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 20132. [2019-12-07 18:54:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20132 states. [2019-12-07 18:54:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 26029 transitions. [2019-12-07 18:54:07,128 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 26029 transitions. Word has length 208 [2019-12-07 18:54:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:07,128 INFO L462 AbstractCegarLoop]: Abstraction has 20132 states and 26029 transitions. [2019-12-07 18:54:07,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:07,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 26029 transitions. [2019-12-07 18:54:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 18:54:07,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:07,141 INFO L410 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] [2019-12-07 18:54:07,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1211626453, now seen corresponding path program 1 times [2019-12-07 18:54:07,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:07,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249610093] [2019-12-07 18:54:07,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 18:54:07,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249610093] [2019-12-07 18:54:07,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:07,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:07,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631940021] [2019-12-07 18:54:07,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:07,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:07,193 INFO L87 Difference]: Start difference. First operand 20132 states and 26029 transitions. Second operand 3 states. [2019-12-07 18:54:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:07,911 INFO L93 Difference]: Finished difference Result 55495 states and 71447 transitions. [2019-12-07 18:54:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:07,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-12-07 18:54:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:07,943 INFO L225 Difference]: With dead ends: 55495 [2019-12-07 18:54:07,943 INFO L226 Difference]: Without dead ends: 35365 [2019-12-07 18:54:08,006 INFO L630 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-12-07 18:54:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35365 states. [2019-12-07 18:54:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35365 to 35357. [2019-12-07 18:54:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35357 states. [2019-12-07 18:54:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35357 states to 35357 states and 41642 transitions. [2019-12-07 18:54:08,259 INFO L78 Accepts]: Start accepts. Automaton has 35357 states and 41642 transitions. Word has length 214 [2019-12-07 18:54:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:08,259 INFO L462 AbstractCegarLoop]: Abstraction has 35357 states and 41642 transitions. [2019-12-07 18:54:08,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 35357 states and 41642 transitions. [2019-12-07 18:54:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-12-07 18:54:08,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:08,276 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:08,276 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -155694673, now seen corresponding path program 1 times [2019-12-07 18:54:08,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:08,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18025155] [2019-12-07 18:54:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:54:08,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18025155] [2019-12-07 18:54:08,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:08,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:08,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450269874] [2019-12-07 18:54:08,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:08,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:08,361 INFO L87 Difference]: Start difference. First operand 35357 states and 41642 transitions. Second operand 4 states. [2019-12-07 18:54:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:09,414 INFO L93 Difference]: Finished difference Result 83915 states and 100071 transitions. [2019-12-07 18:54:09,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:09,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-12-07 18:54:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:09,451 INFO L225 Difference]: With dead ends: 83915 [2019-12-07 18:54:09,451 INFO L226 Difference]: Without dead ends: 48560 [2019-12-07 18:54:09,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48560 states. [2019-12-07 18:54:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48560 to 48552. [2019-12-07 18:54:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48552 states. [2019-12-07 18:54:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48552 states to 48552 states and 55755 transitions. [2019-12-07 18:54:09,942 INFO L78 Accepts]: Start accepts. Automaton has 48552 states and 55755 transitions. Word has length 225 [2019-12-07 18:54:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:09,943 INFO L462 AbstractCegarLoop]: Abstraction has 48552 states and 55755 transitions. [2019-12-07 18:54:09,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48552 states and 55755 transitions. [2019-12-07 18:54:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-07 18:54:09,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:09,959 INFO L410 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, 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] [2019-12-07 18:54:09,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1528433560, now seen corresponding path program 1 times [2019-12-07 18:54:09,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:09,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412669645] [2019-12-07 18:54:09,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:54:10,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412669645] [2019-12-07 18:54:10,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:10,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:54:10,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396272528] [2019-12-07 18:54:10,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:10,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:10,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:10,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:10,059 INFO L87 Difference]: Start difference. First operand 48552 states and 55755 transitions. Second operand 3 states. [2019-12-07 18:54:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:10,698 INFO L93 Difference]: Finished difference Result 96192 states and 110400 transitions. [2019-12-07 18:54:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:10,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-12-07 18:54:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:10,736 INFO L225 Difference]: With dead ends: 96192 [2019-12-07 18:54:10,736 INFO L226 Difference]: Without dead ends: 47642 [2019-12-07 18:54:10,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47642 states. [2019-12-07 18:54:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47642 to 47642. [2019-12-07 18:54:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47642 states. [2019-12-07 18:54:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47642 states to 47642 states and 54147 transitions. [2019-12-07 18:54:11,133 INFO L78 Accepts]: Start accepts. Automaton has 47642 states and 54147 transitions. Word has length 257 [2019-12-07 18:54:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:11,133 INFO L462 AbstractCegarLoop]: Abstraction has 47642 states and 54147 transitions. [2019-12-07 18:54:11,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 47642 states and 54147 transitions. [2019-12-07 18:54:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-12-07 18:54:11,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:11,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:11,145 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash 503909962, now seen corresponding path program 1 times [2019-12-07 18:54:11,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:11,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240632006] [2019-12-07 18:54:11,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 18:54:11,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240632006] [2019-12-07 18:54:11,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:11,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:11,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543462644] [2019-12-07 18:54:11,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:11,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:11,353 INFO L87 Difference]: Start difference. First operand 47642 states and 54147 transitions. Second operand 4 states. [2019-12-07 18:54:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:12,601 INFO L93 Difference]: Finished difference Result 130676 states and 148943 transitions. [2019-12-07 18:54:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:12,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-12-07 18:54:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:12,668 INFO L225 Difference]: With dead ends: 130676 [2019-12-07 18:54:12,668 INFO L226 Difference]: Without dead ends: 83036 [2019-12-07 18:54:12,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-12-07 18:54:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 60228. [2019-12-07 18:54:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60228 states. [2019-12-07 18:54:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60228 states to 60228 states and 69019 transitions. [2019-12-07 18:54:13,376 INFO L78 Accepts]: Start accepts. Automaton has 60228 states and 69019 transitions. Word has length 300 [2019-12-07 18:54:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:13,376 INFO L462 AbstractCegarLoop]: Abstraction has 60228 states and 69019 transitions. [2019-12-07 18:54:13,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60228 states and 69019 transitions. [2019-12-07 18:54:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-12-07 18:54:13,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:13,403 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:13,403 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1954295262, now seen corresponding path program 1 times [2019-12-07 18:54:13,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:13,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920351170] [2019-12-07 18:54:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 18:54:13,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920351170] [2019-12-07 18:54:13,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:13,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:54:13,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504875633] [2019-12-07 18:54:13,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:13,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:13,637 INFO L87 Difference]: Start difference. First operand 60228 states and 69019 transitions. Second operand 4 states. [2019-12-07 18:54:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:14,880 INFO L93 Difference]: Finished difference Result 122098 states and 139839 transitions. [2019-12-07 18:54:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:14,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-12-07 18:54:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:14,928 INFO L225 Difference]: With dead ends: 122098 [2019-12-07 18:54:14,928 INFO L226 Difference]: Without dead ends: 61872 [2019-12-07 18:54:14,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61872 states. [2019-12-07 18:54:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61872 to 60634. [2019-12-07 18:54:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60634 states. [2019-12-07 18:54:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60634 states to 60634 states and 69259 transitions. [2019-12-07 18:54:15,495 INFO L78 Accepts]: Start accepts. Automaton has 60634 states and 69259 transitions. Word has length 310 [2019-12-07 18:54:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:15,495 INFO L462 AbstractCegarLoop]: Abstraction has 60634 states and 69259 transitions. [2019-12-07 18:54:15,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 60634 states and 69259 transitions. [2019-12-07 18:54:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-12-07 18:54:15,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:15,515 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:15,515 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash 950105946, now seen corresponding path program 1 times [2019-12-07 18:54:15,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:15,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19268028] [2019-12-07 18:54:15,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:54:15,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19268028] [2019-12-07 18:54:15,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:15,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:54:15,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428910887] [2019-12-07 18:54:15,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:15,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:15,766 INFO L87 Difference]: Start difference. First operand 60634 states and 69259 transitions. Second operand 4 states. [2019-12-07 18:54:16,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:16,451 INFO L93 Difference]: Finished difference Result 226045 states and 258441 transitions. [2019-12-07 18:54:16,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:16,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-12-07 18:54:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:16,602 INFO L225 Difference]: With dead ends: 226045 [2019-12-07 18:54:16,603 INFO L226 Difference]: Without dead ends: 165413 [2019-12-07 18:54:16,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 18:54:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165413 states. [2019-12-07 18:54:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165413 to 111281. [2019-12-07 18:54:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111281 states. [2019-12-07 18:54:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111281 states to 111281 states and 127306 transitions. [2019-12-07 18:54:18,196 INFO L78 Accepts]: Start accepts. Automaton has 111281 states and 127306 transitions. Word has length 311 [2019-12-07 18:54:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:18,196 INFO L462 AbstractCegarLoop]: Abstraction has 111281 states and 127306 transitions. [2019-12-07 18:54:18,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 111281 states and 127306 transitions. [2019-12-07 18:54:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-12-07 18:54:18,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:18,216 INFO L410 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:18,216 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -63783409, now seen corresponding path program 1 times [2019-12-07 18:54:18,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:18,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352882106] [2019-12-07 18:54:18,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-07 18:54:18,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352882106] [2019-12-07 18:54:18,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:18,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:18,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061655566] [2019-12-07 18:54:18,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:18,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:18,317 INFO L87 Difference]: Start difference. First operand 111281 states and 127306 transitions. Second operand 4 states. [2019-12-07 18:54:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:19,626 INFO L93 Difference]: Finished difference Result 318454 states and 362660 transitions. [2019-12-07 18:54:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:19,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-12-07 18:54:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:19,845 INFO L225 Difference]: With dead ends: 318454 [2019-12-07 18:54:19,845 INFO L226 Difference]: Without dead ends: 207175 [2019-12-07 18:54:19,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207175 states. [2019-12-07 18:54:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207175 to 207165. [2019-12-07 18:54:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207165 states. [2019-12-07 18:54:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207165 states to 207165 states and 235173 transitions. [2019-12-07 18:54:22,183 INFO L78 Accepts]: Start accepts. Automaton has 207165 states and 235173 transitions. Word has length 315 [2019-12-07 18:54:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:22,183 INFO L462 AbstractCegarLoop]: Abstraction has 207165 states and 235173 transitions. [2019-12-07 18:54:22,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 207165 states and 235173 transitions. [2019-12-07 18:54:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-12-07 18:54:22,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:22,213 INFO L410 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:54:22,213 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1376081344, now seen corresponding path program 1 times [2019-12-07 18:54:22,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:22,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841739933] [2019-12-07 18:54:22,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:54:22,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841739933] [2019-12-07 18:54:22,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:22,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:22,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947801306] [2019-12-07 18:54:22,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:22,377 INFO L87 Difference]: Start difference. First operand 207165 states and 235173 transitions. Second operand 3 states. [2019-12-07 18:54:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:25,157 INFO L93 Difference]: Finished difference Result 419067 states and 474662 transitions. [2019-12-07 18:54:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:25,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-12-07 18:54:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:25,411 INFO L225 Difference]: With dead ends: 419067 [2019-12-07 18:54:25,412 INFO L226 Difference]: Without dead ends: 211904 [2019-12-07 18:54:25,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211904 states. [2019-12-07 18:54:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211904 to 211834. [2019-12-07 18:54:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211834 states. [2019-12-07 18:54:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211834 states to 211834 states and 236510 transitions. [2019-12-07 18:54:27,940 INFO L78 Accepts]: Start accepts. Automaton has 211834 states and 236510 transitions. Word has length 317 [2019-12-07 18:54:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:27,940 INFO L462 AbstractCegarLoop]: Abstraction has 211834 states and 236510 transitions. [2019-12-07 18:54:27,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 211834 states and 236510 transitions. [2019-12-07 18:54:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-12-07 18:54:27,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:27,967 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:54:27,967 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2095705146, now seen corresponding path program 1 times [2019-12-07 18:54:27,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:27,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717310498] [2019-12-07 18:54:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:54:28,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717310498] [2019-12-07 18:54:28,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:28,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:28,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317042500] [2019-12-07 18:54:28,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:28,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:28,110 INFO L87 Difference]: Start difference. First operand 211834 states and 236510 transitions. Second operand 3 states. [2019-12-07 18:54:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:29,595 INFO L93 Difference]: Finished difference Result 429410 states and 480031 transitions. [2019-12-07 18:54:29,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:29,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-12-07 18:54:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:29,838 INFO L225 Difference]: With dead ends: 429410 [2019-12-07 18:54:29,838 INFO L226 Difference]: Without dead ends: 217578 [2019-12-07 18:54:29,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:54:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217578 states. [2019-12-07 18:54:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217578 to 217572. [2019-12-07 18:54:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217572 states. [2019-12-07 18:54:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217572 states to 217572 states and 241721 transitions. [2019-12-07 18:54:32,424 INFO L78 Accepts]: Start accepts. Automaton has 217572 states and 241721 transitions. Word has length 321 [2019-12-07 18:54:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:32,425 INFO L462 AbstractCegarLoop]: Abstraction has 217572 states and 241721 transitions. [2019-12-07 18:54:32,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 217572 states and 241721 transitions. [2019-12-07 18:54:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-12-07 18:54:32,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:32,456 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:54:32,456 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1878310930, now seen corresponding path program 1 times [2019-12-07 18:54:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:32,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320588978] [2019-12-07 18:54:32,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 18:54:32,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320588978] [2019-12-07 18:54:32,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:54:32,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:54:32,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317441779] [2019-12-07 18:54:32,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:54:32,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:54:32,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:32,572 INFO L87 Difference]: Start difference. First operand 217572 states and 241721 transitions. Second operand 4 states. [2019-12-07 18:54:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:34,516 INFO L93 Difference]: Finished difference Result 456749 states and 508133 transitions. [2019-12-07 18:54:34,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:54:34,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-12-07 18:54:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:34,770 INFO L225 Difference]: With dead ends: 456749 [2019-12-07 18:54:34,770 INFO L226 Difference]: Without dead ends: 239179 [2019-12-07 18:54:34,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:54:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239179 states. [2019-12-07 18:54:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239179 to 239123. [2019-12-07 18:54:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239123 states. [2019-12-07 18:54:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239123 states to 239123 states and 265256 transitions. [2019-12-07 18:54:37,442 INFO L78 Accepts]: Start accepts. Automaton has 239123 states and 265256 transitions. Word has length 327 [2019-12-07 18:54:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:37,442 INFO L462 AbstractCegarLoop]: Abstraction has 239123 states and 265256 transitions. [2019-12-07 18:54:37,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:54:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 239123 states and 265256 transitions. [2019-12-07 18:54:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-12-07 18:54:37,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:54:37,473 INFO L410 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:54:37,473 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:54:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:54:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1148442132, now seen corresponding path program 1 times [2019-12-07 18:54:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:54:37,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267580027] [2019-12-07 18:54:37,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:54:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 18:54:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267580027] [2019-12-07 18:54:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447965104] [2019-12-07 18:54:37,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/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-12-07 18:54:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:54:37,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:54:37,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:54:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-12-07 18:54:37,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:54:37,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:54:37,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551776031] [2019-12-07 18:54:37,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:54:37,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:54:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:54:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:54:37,787 INFO L87 Difference]: Start difference. First operand 239123 states and 265256 transitions. Second operand 3 states. [2019-12-07 18:54:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:54:39,291 INFO L93 Difference]: Finished difference Result 471121 states and 522649 transitions. [2019-12-07 18:54:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:54:39,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-12-07 18:54:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:54:39,292 INFO L225 Difference]: With dead ends: 471121 [2019-12-07 18:54:39,292 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:54:39,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 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-12-07 18:54:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:54:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:54:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:54:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:54:39,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-12-07 18:54:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:54:39,396 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:54:39,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:54:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:54:39,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:54:39,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:54:39,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:54:53,025 WARN L192 SmtUtils]: Spent 13.39 s on a formula simplification. DAG size of input: 2183 DAG size of output: 1424 [2019-12-07 18:55:05,176 WARN L192 SmtUtils]: Spent 12.14 s on a formula simplification. DAG size of input: 2183 DAG size of output: 1424 [2019-12-07 18:55:27,967 WARN L192 SmtUtils]: Spent 22.78 s on a formula simplification. DAG size of input: 1321 DAG size of output: 100 [2019-12-07 18:55:47,830 WARN L192 SmtUtils]: Spent 19.86 s on a formula simplification. DAG size of input: 1321 DAG size of output: 100 [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,833 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 18:55:47,834 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,835 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,836 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,837 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,838 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,839 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,840 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:55:47,841 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:55:47,842 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,843 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1)) (.cse17 (= 1 ~a6~0)) (.cse0 (= ~a27~0 1))) (let ((.cse13 (<= ~a20~0 0)) (.cse14 (<= ~a3~0 0)) (.cse12 (<= ~a17~0 0)) (.cse18 (not .cse0)) (.cse3 (not .cse17)) (.cse10 (<= ~a27~0 0)) (.cse6 (= ~a26~0 1)) (.cse15 (not (= ~a17~0 1))) (.cse4 (= ~a16~0 1)) (.cse2 (not .cse16)) (.cse7 (<= 2 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse11 (= 1 ~a3~0)) (.cse1 (= 1 ~a5~0)) (.cse9 (<= ~a26~0 0)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse5 .cse8 .cse4) (and .cse7 .cse1 .cse2 .cse9 .cse3 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse4) (and .cse11 .cse1 .cse2 .cse12 .cse5 .cse3 .cse13 .cse10) (and .cse14 .cse1 .cse0 .cse4 .cse15) (and .cse14 .cse1 .cse0 .cse2 .cse8 .cse3) (and (<= ~a6~0 0) .cse1 .cse16 .cse6 .cse10) (and .cse1 .cse0 .cse2 .cse3 .cse15 .cse13) (and .cse0 .cse1 .cse17 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse15 .cse13) (and .cse14 .cse1 .cse6 .cse15) (and .cse7 .cse1 .cse0 .cse2 .cse3 .cse13) (and .cse11 .cse1 .cse2 .cse6 .cse13) (and .cse14 .cse1 .cse16 .cse9 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse6) (and .cse14 .cse1 .cse16 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse5 .cse9 .cse15) (and .cse7 .cse1 .cse17 .cse18 .cse5 .cse9 .cse4) (and .cse14 .cse0 .cse1 .cse15 .cse13) (and .cse7 .cse1 .cse0 .cse8 .cse3 .cse6) (and .cse14 .cse1 .cse16 .cse18 .cse5 .cse9 .cse4) (and .cse11 .cse1 .cse17 .cse16 .cse18 .cse9 .cse4) (and .cse7 .cse1 .cse0 .cse17 .cse16 .cse12 .cse4) (and .cse11 .cse1 .cse18 .cse2 .cse4 .cse6) (and .cse7 .cse1 .cse2 .cse6) (and .cse14 .cse0 .cse1 .cse17 .cse2 .cse15) (and .cse11 .cse1 .cse2 .cse12 .cse5 .cse3 .cse4 .cse10) (and .cse1 .cse18 .cse2 .cse3 .cse8 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse6 .cse4 .cse15) (and .cse7 .cse0 .cse1 .cse17 .cse2 .cse9) (and .cse1 .cse0 .cse2 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse8 .cse5) (and .cse11 .cse1 .cse17 .cse16 .cse9 .cse5)))) [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,844 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1545) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 18:55:47,845 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:55:47,846 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse16 (= ~a12~0 1)) (.cse17 (= 1 ~a6~0)) (.cse0 (= ~a27~0 1))) (let ((.cse13 (<= ~a20~0 0)) (.cse14 (<= ~a3~0 0)) (.cse12 (<= ~a17~0 0)) (.cse18 (not .cse0)) (.cse3 (not .cse17)) (.cse10 (<= ~a27~0 0)) (.cse6 (= ~a26~0 1)) (.cse15 (not (= ~a17~0 1))) (.cse4 (= ~a16~0 1)) (.cse2 (not .cse16)) (.cse7 (<= 2 ~a3~0)) (.cse8 (= ~a29~0 1)) (.cse11 (= 1 ~a3~0)) (.cse1 (= 1 ~a5~0)) (.cse9 (<= ~a26~0 0)) (.cse5 (not (= ~a11~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse5 .cse8 .cse4) (and .cse7 .cse1 .cse2 .cse9 .cse3 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse4) (and .cse11 .cse1 .cse2 .cse12 .cse5 .cse3 .cse13 .cse10) (and .cse14 .cse1 .cse0 .cse4 .cse15) (and .cse14 .cse1 .cse0 .cse2 .cse8 .cse3) (and (<= ~a6~0 0) .cse1 .cse16 .cse6 .cse10) (and .cse1 .cse0 .cse2 .cse3 .cse15 .cse13) (and .cse0 .cse1 .cse17 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse15 .cse13) (and .cse14 .cse1 .cse6 .cse15) (and .cse7 .cse1 .cse0 .cse2 .cse3 .cse13) (and .cse11 .cse1 .cse2 .cse6 .cse13) (and .cse14 .cse1 .cse16 .cse9 .cse3 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse6) (and .cse14 .cse1 .cse16 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse5 .cse9 .cse15) (and .cse7 .cse1 .cse17 .cse18 .cse5 .cse9 .cse4) (and .cse14 .cse0 .cse1 .cse15 .cse13) (and .cse7 .cse1 .cse0 .cse8 .cse3 .cse6) (and .cse14 .cse1 .cse16 .cse18 .cse5 .cse9 .cse4) (and .cse11 .cse1 .cse17 .cse16 .cse18 .cse9 .cse4) (and .cse7 .cse1 .cse0 .cse17 .cse16 .cse12 .cse4) (and .cse11 .cse1 .cse18 .cse2 .cse4 .cse6) (and .cse7 .cse1 .cse2 .cse6) (and .cse14 .cse0 .cse1 .cse17 .cse2 .cse15) (and .cse11 .cse1 .cse2 .cse12 .cse5 .cse3 .cse4 .cse10) (and .cse1 .cse18 .cse2 .cse3 .cse8 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse6 .cse4 .cse15) (and .cse7 .cse0 .cse1 .cse17 .cse2 .cse9) (and .cse1 .cse0 .cse2 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse8 .cse5) (and .cse11 .cse1 .cse17 .cse16 .cse9 .cse5)))) [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,847 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,848 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,849 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,850 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,851 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,852 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,853 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,854 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 18:55:47,855 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 18:55:47,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:55:47 BoogieIcfgContainer [2019-12-07 18:55:47,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:55:47,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:55:47,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:55:47,894 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:55:47,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:53:57" (3/4) ... [2019-12-07 18:55:47,898 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:55:47,927 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:55:47,930 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:55:48,099 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4e85511c-7992-4955-9d9e-24a529794286/bin/uautomizer/witness.graphml [2019-12-07 18:55:48,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:55:48,100 INFO L168 Benchmark]: Toolchain (without parser) took 112580.31 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 928.5 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,100 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:55:48,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -122.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.51 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,101 INFO L168 Benchmark]: Boogie Preprocessor took 87.50 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,101 INFO L168 Benchmark]: RCFGBuilder took 1160.61 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: 24.8 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,101 INFO L168 Benchmark]: TraceAbstraction took 110407.42 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,101 INFO L168 Benchmark]: Witness Printer took 205.22 ms. Allocated memory is still 5.6 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 81.8 MB). Peak memory consumption was 81.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:55:48,103 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -122.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.51 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.50 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1160.61 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: 24.8 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110407.42 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 205.22 ms. Allocated memory is still 5.6 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 81.8 MB). Peak memory consumption was 81.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1545]: 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: ((((((((((((((((((((((((((((((((((((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a16 == 1) || ((1 == a5 && !(a11 == 1)) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && !(a12 == 1)) && a26 <= 0) && !(1 == a6)) && a27 <= 0)) || ((((2 <= a3 && a27 == 1) && 1 == a5) && a26 == 1) && a16 == 1)) || (((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a17 <= 0) && !(a11 == 1)) && !(1 == a6)) && a20 <= 0) && a27 <= 0)) || ((((a3 <= 0 && 1 == a5) && a27 == 1) && a16 == 1) && !(a17 == 1))) || (((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a29 == 1) && !(1 == a6))) || ((((a6 <= 0 && 1 == a5) && a12 == 1) && a26 == 1) && a27 <= 0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && !(a17 == 1)) && a20 <= 0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && !(a17 == 1)) && a20 <= 0)) || (((a3 <= 0 && 1 == a5) && a26 == 1) && !(a17 == 1))) || (((((2 <= a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a20 <= 0)) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a26 == 1) && a20 <= 0)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && a26 <= 0) && !(1 == a6)) && !(a11 == 1)) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || (((a3 <= 0 && 1 == a5) && a12 == 1) && a26 == 1)) || ((((((2 <= a3 && a27 == 1) && 1 == a5) && !(1 == a6)) && !(a11 == 1)) && a26 <= 0) && !(a17 == 1))) || ((((((2 <= a3 && 1 == a5) && 1 == a6) && !(a27 == 1)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a17 == 1)) && a20 <= 0)) || (((((2 <= a3 && 1 == a5) && a27 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a26 <= 0) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a27 == 1) && 1 == a6) && a12 == 1) && a17 <= 0) && a16 == 1)) || (((((1 == a3 && 1 == a5) && !(a27 == 1)) && !(a12 == 1)) && a16 == 1) && a26 == 1)) || (((2 <= a3 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a17 == 1))) || (((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a17 <= 0) && !(a11 == 1)) && !(1 == a6)) && a16 == 1) && a27 <= 0)) || (((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a29 == 1) && a16 == 1) && a26 == 1) && a27 <= 0)) || ((((a27 == 1 && 1 == a5) && a26 == 1) && a16 == 1) && !(a17 == 1))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a26 <= 0)) || ((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(a11 == 1)) && a16 == 1)) || (((2 <= a3 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a26 <= 0) && a29 == 1) && !(a11 == 1))) || (((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a26 <= 0) && !(a11 == 1)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a16 == 1) || ((1 == a5 && !(a11 == 1)) && a26 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a5) && !(a11 == 1)) && a29 == 1) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && !(a12 == 1)) && a26 <= 0) && !(1 == a6)) && a27 <= 0)) || ((((2 <= a3 && a27 == 1) && 1 == a5) && a26 == 1) && a16 == 1)) || (((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a17 <= 0) && !(a11 == 1)) && !(1 == a6)) && a20 <= 0) && a27 <= 0)) || ((((a3 <= 0 && 1 == a5) && a27 == 1) && a16 == 1) && !(a17 == 1))) || (((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a29 == 1) && !(1 == a6))) || ((((a6 <= 0 && 1 == a5) && a12 == 1) && a26 == 1) && a27 <= 0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && !(a17 == 1)) && a20 <= 0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1)) || (((((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1)) && !(a17 == 1)) && a20 <= 0)) || (((a3 <= 0 && 1 == a5) && a26 == 1) && !(a17 == 1))) || (((((2 <= a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a20 <= 0)) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a26 == 1) && a20 <= 0)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && a26 <= 0) && !(1 == a6)) && !(a11 == 1)) && a27 <= 0)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || (((a3 <= 0 && 1 == a5) && a12 == 1) && a26 == 1)) || ((((((2 <= a3 && a27 == 1) && 1 == a5) && !(1 == a6)) && !(a11 == 1)) && a26 <= 0) && !(a17 == 1))) || ((((((2 <= a3 && 1 == a5) && 1 == a6) && !(a27 == 1)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((a3 <= 0 && a27 == 1) && 1 == a5) && !(a17 == 1)) && a20 <= 0)) || (((((2 <= a3 && 1 == a5) && a27 == 1) && a29 == 1) && !(1 == a6)) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && !(a11 == 1)) && a26 <= 0) && a16 == 1)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && !(a27 == 1)) && a26 <= 0) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a27 == 1) && 1 == a6) && a12 == 1) && a17 <= 0) && a16 == 1)) || (((((1 == a3 && 1 == a5) && !(a27 == 1)) && !(a12 == 1)) && a16 == 1) && a26 == 1)) || (((2 <= a3 && 1 == a5) && !(a12 == 1)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a17 == 1))) || (((((((1 == a3 && 1 == a5) && !(a12 == 1)) && a17 <= 0) && !(a11 == 1)) && !(1 == a6)) && a16 == 1) && a27 <= 0)) || (((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && !(1 == a6)) && a29 == 1) && a16 == 1) && a26 == 1) && a27 <= 0)) || ((((a27 == 1 && 1 == a5) && a26 == 1) && a16 == 1) && !(a17 == 1))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a26 <= 0)) || ((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(a11 == 1)) && a16 == 1)) || (((2 <= a3 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a26 <= 0) && a29 == 1) && !(a11 == 1))) || (((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a26 <= 0) && !(a11 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 42.0s, OverallIterations: 20, TraceHistogramMax: 5, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 68.2s, HoareTripleCheckerStatistics: 4240 SDtfs, 8115 SDslu, 2104 SDs, 0 SdLazy, 14309 SolverSat, 2555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 555 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239123occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 89312 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 2094 NumberOfFragments, 1429 HoareAnnotationTreeSize, 3 FomulaSimplifications, 103736 FormulaSimplificationTreeSizeReduction, 25.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 173366 FormulaSimplificationTreeSizeReductionInter, 42.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 5483 NumberOfCodeBlocks, 5483 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5461 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575120 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 2520/2531 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...