./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/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 bbc1feb3ff32d0c91c18b795ac9c4037252af2bf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 06:51:42,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:51:42,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:51:42,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:51:42,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:51:42,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:51:42,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:51:42,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:51:42,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:51:42,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:51:42,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:51:42,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:51:42,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:51:42,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:51:42,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:51:42,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:51:42,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:51:42,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:51:42,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:51:42,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:51:42,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:51:42,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:51:42,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:51:42,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:51:42,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:51:42,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:51:42,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:51:42,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:51:42,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:51:42,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:51:42,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:51:42,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:51:42,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:51:42,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:51:42,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:51:42,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:51:42,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:51:42,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:51:42,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:51:42,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:51:42,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:51:42,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:51:42,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:51:42,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:51:42,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:51:42,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:51:42,798 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:51:42,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:51:42,798 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:51:42,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:51:42,800 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:51:42,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:51:42,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:51:42,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:51:42,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:51:42,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:51:42,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:51:42,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:51:42,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:51:42,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:51:42,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:51:42,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:51:42,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:51:42,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:51:42,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:51:42,802 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_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/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 -> bbc1feb3ff32d0c91c18b795ac9c4037252af2bf [2019-11-20 06:51:42,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:51:42,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:51:42,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:51:42,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:51:42,999 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:51:43,000 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-11-20 06:51:43,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/data/8fc59c376/b26bb1dd54d847b59a8d90904d073ceb/FLAG4ee658833 [2019-11-20 06:51:43,618 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:51:43,619 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/sv-benchmarks/c/eca-rers2012/Problem03_label10.c [2019-11-20 06:51:43,637 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/data/8fc59c376/b26bb1dd54d847b59a8d90904d073ceb/FLAG4ee658833 [2019-11-20 06:51:44,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/data/8fc59c376/b26bb1dd54d847b59a8d90904d073ceb [2019-11-20 06:51:44,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:51:44,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:51:44,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:51:44,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:51:44,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:51:44,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:51:44" (1/1) ... [2019-11-20 06:51:44,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1d3fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:44, skipping insertion in model container [2019-11-20 06:51:44,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:51:44" (1/1) ... [2019-11-20 06:51:44,092 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:51:44,171 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:51:44,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:51:44,828 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:51:45,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:51:45,065 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:51:45,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45 WrapperNode [2019-11-20 06:51:45,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:51:45,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:51:45,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:51:45,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:51:45,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:51:45,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:51:45,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:51:45,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:51:45,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... [2019-11-20 06:51:45,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:51:45,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:51:45,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:51:45,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:51:45,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:51:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:51:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:51:47,298 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:51:47,299 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 06:51:47,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:51:47 BoogieIcfgContainer [2019-11-20 06:51:47,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:51:47,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:51:47,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:51:47,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:51:47,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:51:44" (1/3) ... [2019-11-20 06:51:47,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:51:47, skipping insertion in model container [2019-11-20 06:51:47,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:45" (2/3) ... [2019-11-20 06:51:47,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e6afc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:51:47, skipping insertion in model container [2019-11-20 06:51:47,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:51:47" (3/3) ... [2019-11-20 06:51:47,309 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2019-11-20 06:51:47,319 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:51:47,327 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:51:47,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:51:47,373 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:51:47,373 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:51:47,374 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:51:47,374 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:51:47,374 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:51:47,374 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:51:47,375 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:51:47,377 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:51:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-20 06:51:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 06:51:47,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:47,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:47,412 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash 991324555, now seen corresponding path program 1 times [2019-11-20 06:51:47,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:47,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354749267] [2019-11-20 06:51:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:51:48,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354749267] [2019-11-20 06:51:48,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:48,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:51:48,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504887502] [2019-11-20 06:51:48,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:51:48,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:51:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:51:48,086 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-20 06:51:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:50,073 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-20 06:51:50,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:51:50,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 06:51:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:50,103 INFO L225 Difference]: With dead ends: 1075 [2019-11-20 06:51:50,103 INFO L226 Difference]: Without dead ends: 677 [2019-11-20 06:51:50,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:51:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-20 06:51:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-20 06:51:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-20 06:51:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-20 06:51:50,213 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 181 [2019-11-20 06:51:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:50,216 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-20 06:51:50,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:51:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-20 06:51:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 06:51:50,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:50,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:50,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1803921076, now seen corresponding path program 1 times [2019-11-20 06:51:50,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:50,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729453586] [2019-11-20 06:51:50,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:51:50,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729453586] [2019-11-20 06:51:50,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:50,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:51:50,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110654945] [2019-11-20 06:51:50,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:50,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:50,358 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-20 06:51:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:51,340 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-20 06:51:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:51,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-20 06:51:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:51,346 INFO L225 Difference]: With dead ends: 1323 [2019-11-20 06:51:51,347 INFO L226 Difference]: Without dead ends: 874 [2019-11-20 06:51:51,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-20 06:51:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-20 06:51:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-20 06:51:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-20 06:51:51,394 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 189 [2019-11-20 06:51:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:51,394 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-20 06:51:51,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-20 06:51:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 06:51:51,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:51,399 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:51,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -716075313, now seen corresponding path program 1 times [2019-11-20 06:51:51,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:51,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795337553] [2019-11-20 06:51:51,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:51:51,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795337553] [2019-11-20 06:51:51,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:51,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:51:51,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7921316] [2019-11-20 06:51:51,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:51,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:51,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:51,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:51,524 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-20 06:51:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:52,042 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-20 06:51:52,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:52,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-20 06:51:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:52,047 INFO L225 Difference]: With dead ends: 1695 [2019-11-20 06:51:52,048 INFO L226 Difference]: Without dead ends: 838 [2019-11-20 06:51:52,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-20 06:51:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-20 06:51:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-20 06:51:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-20 06:51:52,073 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 194 [2019-11-20 06:51:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:52,074 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-20 06:51:52,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-20 06:51:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 06:51:52,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:52,085 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:52,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1122639935, now seen corresponding path program 1 times [2019-11-20 06:51:52,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:52,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272431054] [2019-11-20 06:51:52,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 06:51:52,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272431054] [2019-11-20 06:51:52,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:52,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:51:52,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418006973] [2019-11-20 06:51:52,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:51:52,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:52,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:51:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:51:52,174 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-20 06:51:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:53,682 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-20 06:51:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:51:53,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-20 06:51:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:53,696 INFO L225 Difference]: With dead ends: 3313 [2019-11-20 06:51:53,696 INFO L226 Difference]: Without dead ends: 2477 [2019-11-20 06:51:53,698 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-11-20 06:51:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-20 06:51:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-20 06:51:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-20 06:51:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-20 06:51:53,740 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 195 [2019-11-20 06:51:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:53,740 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-20 06:51:53,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:51:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-20 06:51:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 06:51:53,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:53,745 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:53,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -331316582, now seen corresponding path program 1 times [2019-11-20 06:51:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:53,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361025651] [2019-11-20 06:51:53,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 06:51:53,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361025651] [2019-11-20 06:51:53,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:53,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:51:53,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463024772] [2019-11-20 06:51:53,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:53,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:53,820 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-20 06:51:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:54,635 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-20 06:51:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:54,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-20 06:51:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:54,649 INFO L225 Difference]: With dead ends: 4133 [2019-11-20 06:51:54,649 INFO L226 Difference]: Without dead ends: 2480 [2019-11-20 06:51:54,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-20 06:51:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-20 06:51:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-20 06:51:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-20 06:51:54,710 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 198 [2019-11-20 06:51:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:54,710 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-20 06:51:54,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-20 06:51:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 06:51:54,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:54,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:54,718 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1798503547, now seen corresponding path program 1 times [2019-11-20 06:51:54,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:54,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221127235] [2019-11-20 06:51:54,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 06:51:54,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221127235] [2019-11-20 06:51:54,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:54,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:51:54,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043812967] [2019-11-20 06:51:54,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:54,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:54,876 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-20 06:51:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:55,233 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-20 06:51:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:55,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-20 06:51:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:55,258 INFO L225 Difference]: With dead ends: 7424 [2019-11-20 06:51:55,259 INFO L226 Difference]: Without dead ends: 4947 [2019-11-20 06:51:55,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-20 06:51:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-20 06:51:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-20 06:51:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-20 06:51:55,364 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 201 [2019-11-20 06:51:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:55,364 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-20 06:51:55,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-20 06:51:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-20 06:51:55,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:55,372 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:55,372 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:55,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1112433142, now seen corresponding path program 1 times [2019-11-20 06:51:55,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:55,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007728515] [2019-11-20 06:51:55,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:51:55,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007728515] [2019-11-20 06:51:55,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:55,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:51:55,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681516174] [2019-11-20 06:51:55,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:55,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:55,469 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-20 06:51:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:56,411 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-20 06:51:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:56,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-20 06:51:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:56,459 INFO L225 Difference]: With dead ends: 14560 [2019-11-20 06:51:56,459 INFO L226 Difference]: Without dead ends: 9617 [2019-11-20 06:51:56,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-20 06:51:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-20 06:51:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-20 06:51:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-11-20 06:51:56,647 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 203 [2019-11-20 06:51:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-11-20 06:51:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-11-20 06:51:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 06:51:56,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:56,659 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:56,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 579998981, now seen corresponding path program 2 times [2019-11-20 06:51:56,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:56,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287919315] [2019-11-20 06:51:56,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:51:56,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287919315] [2019-11-20 06:51:56,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:56,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:51:56,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259547833] [2019-11-20 06:51:56,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:51:56,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:51:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:56,832 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-11-20 06:51:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:51:57,750 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-11-20 06:51:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:51:57,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-20 06:51:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:51:57,820 INFO L225 Difference]: With dead ends: 26540 [2019-11-20 06:51:57,821 INFO L226 Difference]: Without dead ends: 16927 [2019-11-20 06:51:57,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:51:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-20 06:51:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-20 06:51:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-20 06:51:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20100 transitions. [2019-11-20 06:51:58,081 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20100 transitions. Word has length 205 [2019-11-20 06:51:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:51:58,082 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20100 transitions. [2019-11-20 06:51:58,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:51:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20100 transitions. [2019-11-20 06:51:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-20 06:51:58,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:51:58,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:51:58,101 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:51:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:51:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash -942107321, now seen corresponding path program 1 times [2019-11-20 06:51:58,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:51:58,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230623454] [2019-11-20 06:51:58,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:51:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:51:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:51:58,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230623454] [2019-11-20 06:51:58,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:51:58,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:51:58,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154971716] [2019-11-20 06:51:58,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:51:58,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:51:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:51:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:51:58,284 INFO L87 Difference]: Start difference. First operand 16923 states and 20100 transitions. Second operand 5 states. [2019-11-20 06:52:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:00,045 INFO L93 Difference]: Finished difference Result 35285 states and 41994 transitions. [2019-11-20 06:52:00,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:52:00,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-11-20 06:52:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:00,075 INFO L225 Difference]: With dead ends: 35285 [2019-11-20 06:52:00,075 INFO L226 Difference]: Without dead ends: 18364 [2019-11-20 06:52:00,089 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-11-20 06:52:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18364 states. [2019-11-20 06:52:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18364 to 17532. [2019-11-20 06:52:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-20 06:52:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20720 transitions. [2019-11-20 06:52:00,297 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20720 transitions. Word has length 219 [2019-11-20 06:52:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:00,297 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20720 transitions. [2019-11-20 06:52:00,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:52:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20720 transitions. [2019-11-20 06:52:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 06:52:00,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:00,317 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:00,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -765401032, now seen corresponding path program 1 times [2019-11-20 06:52:00,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:00,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224091474] [2019-11-20 06:52:00,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 06:52:00,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224091474] [2019-11-20 06:52:00,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:00,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:52:00,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413891598] [2019-11-20 06:52:00,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:52:00,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:00,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:52:00,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:52:00,424 INFO L87 Difference]: Start difference. First operand 17532 states and 20720 transitions. Second operand 4 states. [2019-11-20 06:52:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:01,498 INFO L93 Difference]: Finished difference Result 35064 states and 41442 transitions. [2019-11-20 06:52:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:52:01,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-20 06:52:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:01,521 INFO L225 Difference]: With dead ends: 35064 [2019-11-20 06:52:01,521 INFO L226 Difference]: Without dead ends: 17534 [2019-11-20 06:52:01,538 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-11-20 06:52:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-20 06:52:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-20 06:52:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-20 06:52:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20181 transitions. [2019-11-20 06:52:01,738 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20181 transitions. Word has length 223 [2019-11-20 06:52:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:01,738 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20181 transitions. [2019-11-20 06:52:01,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:52:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20181 transitions. [2019-11-20 06:52:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-20 06:52:01,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:01,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:01,756 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1099774521, now seen corresponding path program 1 times [2019-11-20 06:52:01,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:01,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732852554] [2019-11-20 06:52:01,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:52:02,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732852554] [2019-11-20 06:52:02,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126819243] [2019-11-20 06:52:02,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:02,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 06:52:02,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:52:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:52:02,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-20 06:52:02,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135503499] [2019-11-20 06:52:02,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:52:02,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:52:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:52:02,369 INFO L87 Difference]: Start difference. First operand 17532 states and 20181 transitions. Second operand 3 states. [2019-11-20 06:52:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:03,247 INFO L93 Difference]: Finished difference Result 34660 states and 39922 transitions. [2019-11-20 06:52:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:52:03,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-20 06:52:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:03,266 INFO L225 Difference]: With dead ends: 34660 [2019-11-20 06:52:03,266 INFO L226 Difference]: Without dead ends: 17130 [2019-11-20 06:52:03,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:52:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-11-20 06:52:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-11-20 06:52:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-11-20 06:52:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18381 transitions. [2019-11-20 06:52:03,462 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18381 transitions. Word has length 229 [2019-11-20 06:52:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:03,463 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18381 transitions. [2019-11-20 06:52:03,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:52:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18381 transitions. [2019-11-20 06:52:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-20 06:52:03,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:03,483 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:03,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:03,688 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:03,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1221063350, now seen corresponding path program 1 times [2019-11-20 06:52:03,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:03,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783220808] [2019-11-20 06:52:03,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 06:52:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783220808] [2019-11-20 06:52:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317175222] [2019-11-20 06:52:03,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:04,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 06:52:04,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:52:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 06:52:04,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:52:04,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-20 06:52:04,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324012267] [2019-11-20 06:52:04,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:52:04,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:52:04,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:52:04,146 INFO L87 Difference]: Start difference. First operand 16314 states and 18381 transitions. Second operand 3 states. [2019-11-20 06:52:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:04,817 INFO L93 Difference]: Finished difference Result 47676 states and 53681 transitions. [2019-11-20 06:52:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:52:04,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-20 06:52:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:04,849 INFO L225 Difference]: With dead ends: 47676 [2019-11-20 06:52:04,849 INFO L226 Difference]: Without dead ends: 31364 [2019-11-20 06:52:04,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:52:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-11-20 06:52:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-11-20 06:52:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-11-20 06:52:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35287 transitions. [2019-11-20 06:52:05,198 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35287 transitions. Word has length 258 [2019-11-20 06:52:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35287 transitions. [2019-11-20 06:52:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:52:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35287 transitions. [2019-11-20 06:52:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-20 06:52:05,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:05,228 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:52:05,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:52:05,440 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1710674889, now seen corresponding path program 1 times [2019-11-20 06:52:05,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:05,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15255266] [2019-11-20 06:52:05,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:52:05,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15255266] [2019-11-20 06:52:05,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:05,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:52:05,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343222728] [2019-11-20 06:52:05,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:52:05,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:52:05,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:52:05,664 INFO L87 Difference]: Start difference. First operand 31362 states and 35287 transitions. Second operand 4 states. [2019-11-20 06:52:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:06,839 INFO L93 Difference]: Finished difference Result 88385 states and 99396 transitions. [2019-11-20 06:52:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:52:06,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-20 06:52:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:06,905 INFO L225 Difference]: With dead ends: 88385 [2019-11-20 06:52:06,905 INFO L226 Difference]: Without dead ends: 57025 [2019-11-20 06:52:06,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:52:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57025 states. [2019-11-20 06:52:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57025 to 57023. [2019-11-20 06:52:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57023 states. [2019-11-20 06:52:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57023 states to 57023 states and 64060 transitions. [2019-11-20 06:52:07,800 INFO L78 Accepts]: Start accepts. Automaton has 57023 states and 64060 transitions. Word has length 281 [2019-11-20 06:52:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:07,800 INFO L462 AbstractCegarLoop]: Abstraction has 57023 states and 64060 transitions. [2019-11-20 06:52:07,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:52:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 57023 states and 64060 transitions. [2019-11-20 06:52:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-20 06:52:07,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:07,830 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:52:07,830 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash -625354885, now seen corresponding path program 1 times [2019-11-20 06:52:07,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:07,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716641479] [2019-11-20 06:52:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 06:52:08,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716641479] [2019-11-20 06:52:08,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:08,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 06:52:08,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884525593] [2019-11-20 06:52:08,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:52:08,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:52:08,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:52:08,084 INFO L87 Difference]: Start difference. First operand 57023 states and 64060 transitions. Second operand 3 states. [2019-11-20 06:52:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:08,802 INFO L93 Difference]: Finished difference Result 150649 states and 168878 transitions. [2019-11-20 06:52:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:52:08,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-20 06:52:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:08,902 INFO L225 Difference]: With dead ends: 150649 [2019-11-20 06:52:08,902 INFO L226 Difference]: Without dead ends: 93628 [2019-11-20 06:52:08,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:52:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93628 states. [2019-11-20 06:52:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93628 to 93626. [2019-11-20 06:52:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93626 states. [2019-11-20 06:52:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93626 states to 93626 states and 104802 transitions. [2019-11-20 06:52:10,393 INFO L78 Accepts]: Start accepts. Automaton has 93626 states and 104802 transitions. Word has length 332 [2019-11-20 06:52:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:10,393 INFO L462 AbstractCegarLoop]: Abstraction has 93626 states and 104802 transitions. [2019-11-20 06:52:10,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:52:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 93626 states and 104802 transitions. [2019-11-20 06:52:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-20 06:52:10,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:10,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 06:52:10,434 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2069549447, now seen corresponding path program 1 times [2019-11-20 06:52:10,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:10,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673927908] [2019-11-20 06:52:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 06:52:10,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673927908] [2019-11-20 06:52:10,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:10,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:52:10,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804217681] [2019-11-20 06:52:10,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:52:10,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:10,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:52:10,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:52:10,630 INFO L87 Difference]: Start difference. First operand 93626 states and 104802 transitions. Second operand 4 states. [2019-11-20 06:52:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:11,995 INFO L93 Difference]: Finished difference Result 206331 states and 232381 transitions. [2019-11-20 06:52:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:52:11,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-20 06:52:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:12,090 INFO L225 Difference]: With dead ends: 206331 [2019-11-20 06:52:12,090 INFO L226 Difference]: Without dead ends: 112707 [2019-11-20 06:52:12,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:52:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112707 states. [2019-11-20 06:52:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112707 to 112691. [2019-11-20 06:52:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112691 states. [2019-11-20 06:52:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112691 states to 112691 states and 123941 transitions. [2019-11-20 06:52:13,686 INFO L78 Accepts]: Start accepts. Automaton has 112691 states and 123941 transitions. Word has length 344 [2019-11-20 06:52:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:13,686 INFO L462 AbstractCegarLoop]: Abstraction has 112691 states and 123941 transitions. [2019-11-20 06:52:13,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:52:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 112691 states and 123941 transitions. [2019-11-20 06:52:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-20 06:52:13,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:52:13,726 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:52:13,726 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:52:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:52:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1140434467, now seen corresponding path program 1 times [2019-11-20 06:52:13,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:52:13,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663652548] [2019-11-20 06:52:13,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:52:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:52:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-20 06:52:14,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663652548] [2019-11-20 06:52:14,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:52:14,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:52:14,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420878189] [2019-11-20 06:52:14,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:52:14,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:52:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:52:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:52:14,110 INFO L87 Difference]: Start difference. First operand 112691 states and 123941 transitions. Second operand 3 states. [2019-11-20 06:52:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:52:15,522 INFO L93 Difference]: Finished difference Result 244323 states and 269032 transitions. [2019-11-20 06:52:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:52:15,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-11-20 06:52:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:52:15,523 INFO L225 Difference]: With dead ends: 244323 [2019-11-20 06:52:15,523 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:52:15,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:52:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:52:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:52:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:52:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:52:15,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2019-11-20 06:52:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:52:15,589 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:52:15,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:52:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:52:15,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:52:15,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:52:18,042 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-20 06:52:19,061 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-20 06:52:22,251 WARN L191 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-20 06:52:23,716 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-20 06:52:23,718 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,719 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-20 06:52:23,720 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-20 06:52:23,721 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-20 06:52:23,722 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-20 06:52:23,723 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,724 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-20 06:52:23,725 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,726 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-20 06:52:23,727 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,728 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,729 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-20 06:52:23,730 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-20 06:52:23,731 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,732 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,733 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,733 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse0 (not (= ~a12~0 1))) (.cse20 (not .cse1)) (.cse9 (= ~a27~0 1))) (let ((.cse2 (= ~a5~0 1)) (.cse17 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse19 (and .cse0 .cse20)) (.cse10 (= ~a16~0 1))) (let ((.cse15 (= 1 ~a3~0)) (.cse18 (and .cse17 .cse3 .cse19 .cse10)) (.cse14 (<= ~a27~0 0)) (.cse16 (and .cse9 .cse20)) (.cse11 (<= ~a3~0 0)) (.cse5 (and .cse0 .cse9 .cse20)) (.cse7 (not (= ~a7~0 1))) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse13 (and .cse20 .cse2)) (.cse8 (<= ~a11~0 0)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6) (and .cse7 .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse8 .cse2 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse7 .cse9 .cse1 .cse8 .cse2) (and .cse8 .cse4 .cse13 .cse12) (and .cse7 .cse8 .cse2 .cse4 .cse12) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse8 .cse13) (and .cse3 .cse4 .cse13 .cse12) (and .cse15 .cse8 .cse6 .cse13) (and .cse7 .cse15 .cse5 .cse2 .cse3 .cse10) (and .cse0 .cse9 .cse15 .cse8 .cse2 .cse4) (and .cse11 .cse7 .cse16 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse15 .cse8 .cse2 .cse6 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse6) (and .cse7 .cse15 .cse1 .cse2 .cse3 .cse10 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse8 .cse4 .cse13) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse10 .cse14) (and .cse3 .cse4 .cse6 .cse10 .cse13 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse12) (and (and .cse11 .cse17 .cse3 .cse10 .cse13) .cse4) (and .cse18 .cse2 .cse6) (and .cse8 .cse4 .cse6 .cse13) (and .cse11 .cse9 .cse8 .cse2 .cse4 .cse10) (and .cse7 .cse2 .cse3 .cse19 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse6 .cse10 .cse12 .cse14) (and .cse11 .cse16 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse7 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse12) (and .cse7 .cse18 .cse2) (and .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse11 .cse7 .cse8 .cse2 .cse6 .cse10 .cse14) (and .cse16 .cse8 .cse2 .cse6) (and .cse7 .cse9 .cse8 .cse2 .cse6) (and .cse9 .cse1 .cse8 .cse2 .cse12) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse4) (and .cse7 .cse3 .cse4 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse12)))))) [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:52:23,734 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1578) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-20 06:52:23,735 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-20 06:52:23,736 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse0 (not (= ~a12~0 1))) (.cse20 (not .cse1)) (.cse9 (= ~a27~0 1))) (let ((.cse2 (= ~a5~0 1)) (.cse17 (not .cse9)) (.cse3 (= ~a11~0 1)) (.cse19 (and .cse0 .cse20)) (.cse10 (= ~a16~0 1))) (let ((.cse15 (= 1 ~a3~0)) (.cse18 (and .cse17 .cse3 .cse19 .cse10)) (.cse14 (<= ~a27~0 0)) (.cse16 (and .cse9 .cse20)) (.cse11 (<= ~a3~0 0)) (.cse5 (and .cse0 .cse9 .cse20)) (.cse7 (not (= ~a7~0 1))) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse13 (and .cse20 .cse2)) (.cse8 (<= ~a11~0 0)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6) (and .cse7 .cse8 .cse2 .cse4 .cse6) (and .cse9 .cse8 .cse2 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse7 .cse9 .cse1 .cse8 .cse2) (and .cse8 .cse4 .cse13 .cse12) (and .cse7 .cse8 .cse2 .cse4 .cse12) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse14) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse8 .cse13) (and .cse3 .cse4 .cse13 .cse12) (and .cse15 .cse8 .cse6 .cse13) (and .cse7 .cse15 .cse5 .cse2 .cse3 .cse10) (and .cse0 .cse9 .cse15 .cse8 .cse2 .cse4) (and .cse11 .cse7 .cse16 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse15 .cse8 .cse2 .cse6 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse6) (and .cse7 .cse15 .cse1 .cse2 .cse3 .cse10 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse4 .cse10) (and .cse7 .cse8 .cse4 .cse13) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse10 .cse14) (and .cse3 .cse4 .cse6 .cse10 .cse13 .cse14) (and .cse11 .cse5 .cse2 .cse3 .cse12) (and (and .cse11 .cse17 .cse3 .cse10 .cse13) .cse4) (and .cse18 .cse2 .cse6) (and .cse8 .cse4 .cse6 .cse13) (and .cse11 .cse9 .cse8 .cse2 .cse4 .cse10) (and .cse7 .cse2 .cse3 .cse19 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse6 .cse10 .cse12 .cse14) (and .cse11 .cse16 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse7 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse2 .cse4 .cse6 .cse10 .cse12) (and .cse7 .cse18 .cse2) (and .cse7 .cse5 .cse2 .cse3 .cse4) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse11 .cse7 .cse8 .cse2 .cse6 .cse10 .cse14) (and .cse16 .cse8 .cse2 .cse6) (and .cse7 .cse9 .cse8 .cse2 .cse6) (and .cse9 .cse1 .cse8 .cse2 .cse12) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse2 .cse4) (and .cse0 .cse7 .cse8 .cse2 .cse4) (and .cse7 .cse3 .cse4 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse12)))))) [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,737 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,738 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,739 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,740 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 06:52:23,741 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,742 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,743 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,744 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-20 06:52:23,745 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,746 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,747 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-20 06:52:23,748 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-20 06:52:23,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:52:23 BoogieIcfgContainer [2019-11-20 06:52:23,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:52:23,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:52:23,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:52:23,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:52:23,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:51:47" (3/4) ... [2019-11-20 06:52:23,801 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:52:23,836 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 06:52:23,839 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:52:24,081 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8584e6b3-3afb-4cff-820e-2b17f95ea9d8/bin/uautomizer/witness.graphml [2019-11-20 06:52:24,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:52:24,084 INFO L168 Benchmark]: Toolchain (without parser) took 40007.03 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 944.7 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 737.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,084 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:52:24,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 987.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,085 INFO L168 Benchmark]: Boogie Preprocessor took 81.89 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-11-20 06:52:24,086 INFO L168 Benchmark]: RCFGBuilder took 2057.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,086 INFO L168 Benchmark]: TraceAbstraction took 36496.26 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,087 INFO L168 Benchmark]: Witness Printer took 285.23 ms. Allocated memory is still 4.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-11-20 06:52:24,088 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 987.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.89 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. * RCFGBuilder took 2057.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36496.26 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 285.23 ms. Allocated memory is still 4.0 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1578]: 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: ((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || ((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((!(a12 == 1) && !(a7 == 1)) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((!(a7 == 1) && 1 == a3) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a12 == 1) && a27 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((!(a7 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((!(a7 == 1) && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a11 == 1 && a26 == 1) && 1 == a0) && a16 == 1) && !(1 == a6) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a27 == 1)) && a11 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a26 == 1)) || (((((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a7 == 1) && a5 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && 1 == a0)) || (((((((!(a7 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((((a3 <= 0 && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && !(a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((!(a7 == 1) && ((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((((!(a7 == 1) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a7 == 1)) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((a27 == 1 && !(1 == a6)) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a7 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(a7 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a7 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a0)) || ((((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((!(a12 == 1) && !(a7 == 1)) && a27 == 1) && 1 == a6) && a11 <= 0) && a5 == 1)) || (((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || ((((!(a7 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && 1 == a4)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((!(a7 == 1) && 1 == a3) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a12 == 1) && a27 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((!(a7 == 1) && 1 == a3) && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((((!(a7 == 1) && 1 == a3) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || (((!(a7 == 1) && a11 <= 0) && a26 == 1) && !(1 == a6) && a5 == 1)) || ((((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((a11 == 1 && a26 == 1) && 1 == a0) && a16 == 1) && !(1 == a6) && a5 == 1) && a27 <= 0)) || ((((a3 <= 0 && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && !(a27 == 1)) && a11 == 1) && a16 == 1) && !(1 == a6) && a5 == 1) && a26 == 1)) || (((((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((a3 <= 0 && a27 == 1) && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || ((((!(a7 == 1) && a5 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && 1 == a0)) || (((((((!(a7 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((((a3 <= 0 && a27 == 1 && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && !(a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((!(a7 == 1) && ((!(a27 == 1) && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a16 == 1) && a5 == 1)) || ((((!(a7 == 1) && (!(a12 == 1) && a27 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((!(a7 == 1) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((((a3 <= 0 && !(a7 == 1)) && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((a27 == 1 && !(1 == a6)) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a7 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || (((((a3 <= 0 && !(a12 == 1)) && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1)) || (((((!(a12 == 1) && a27 == 1) && !(1 == a6)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a12 == 1) && !(a7 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((!(a7 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 36.3s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.1s, HoareTripleCheckerStatistics: 2855 SDtfs, 5400 SDslu, 1187 SDs, 0 SdLazy, 9799 SolverSat, 2103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 502 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112691occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 2744 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1202 NumberOfFragments, 2015 HoareAnnotationTreeSize, 3 FomulaSimplifications, 42886 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7846 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4347 NumberOfCodeBlocks, 4347 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 1360/1367 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...