./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/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 84719fa7c370f946c431f46475b54ba30487ebc7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:42:19,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:42:19,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:42:19,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:42:19,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:42:19,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:42:19,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:42:19,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:42:19,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:42:19,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:42:19,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:42:19,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:42:19,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:42:19,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:42:19,697 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:42:19,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:42:19,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:42:19,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:42:19,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:42:19,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:42:19,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:42:19,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:42:19,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:42:19,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:42:19,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:42:19,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:42:19,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:42:19,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:42:19,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:42:19,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:42:19,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:42:19,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:42:19,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:42:19,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:42:19,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:42:19,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:42:19,711 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:42:19,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:42:19,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:42:19,722 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:42:19,722 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:42:19,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:42:19,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:42:19,723 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:42:19,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:42:19,723 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:42:19,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:42:19,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:42:19,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:42:19,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:42:19,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/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 -> 84719fa7c370f946c431f46475b54ba30487ebc7 [2018-11-10 10:42:19,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:42:19,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:42:19,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:42:19,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:42:19,764 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:42:19,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-10 10:42:19,810 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/data/bb61becca/7e28eee3144a435eab747f5ba1926036/FLAG6e8ecdbc8 [2018-11-10 10:42:20,175 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:42:20,176 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/sv-benchmarks/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2018-11-10 10:42:20,186 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/data/bb61becca/7e28eee3144a435eab747f5ba1926036/FLAG6e8ecdbc8 [2018-11-10 10:42:20,197 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/data/bb61becca/7e28eee3144a435eab747f5ba1926036 [2018-11-10 10:42:20,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:42:20,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:42:20,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:42:20,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:42:20,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:42:20,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf90f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20, skipping insertion in model container [2018-11-10 10:42:20,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:42:20,252 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:42:20,502 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:42:20,505 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:42:20,595 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:42:20,608 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:42:20,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20 WrapperNode [2018-11-10 10:42:20,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:42:20,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:42:20,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:42:20,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:42:20,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... [2018-11-10 10:42:20,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:42:20,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:42:20,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:42:20,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:42:20,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/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 [2018-11-10 10:42:20,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:42:20,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:42:20,790 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 10:42:20,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:42:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:42:21,853 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:42:21,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:21 BoogieIcfgContainer [2018-11-10 10:42:21,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:42:21,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:42:21,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:42:21,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:42:21,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:42:20" (1/3) ... [2018-11-10 10:42:21,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655e2831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:21, skipping insertion in model container [2018-11-10 10:42:21,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:20" (2/3) ... [2018-11-10 10:42:21,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655e2831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:21, skipping insertion in model container [2018-11-10 10:42:21,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:21" (3/3) ... [2018-11-10 10:42:21,860 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label50_true-unreach-call_false-termination.c [2018-11-10 10:42:21,868 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:42:21,875 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:42:21,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:42:21,917 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:42:21,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:42:21,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:42:21,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:42:21,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:42:21,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:42:21,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:42:21,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:42:21,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:42:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-10 10:42:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 10:42:21,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:21,945 INFO L375 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] [2018-11-10 10:42:21,947 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:21,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash -50157732, now seen corresponding path program 1 times [2018-11-10 10:42:21,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:21,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:22,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:22,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:42:22,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:42:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:42:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:42:22,189 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-10 10:42:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:22,838 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-10 10:42:22,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:42:22,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 10:42:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:22,848 INFO L225 Difference]: With dead ends: 691 [2018-11-10 10:42:22,849 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 10:42:22,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:42:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 10:42:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-10 10:42:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-10 10:42:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-10 10:42:22,899 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 44 [2018-11-10 10:42:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:22,900 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-10 10:42:22,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:42:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-10 10:42:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:42:22,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:22,904 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:22,904 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:22,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1724157031, now seen corresponding path program 1 times [2018-11-10 10:42:22,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:22,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:22,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:42:23,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:42:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:42:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:42:23,070 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-10 10:42:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:23,727 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-11-10 10:42:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:23,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-10 10:42:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:23,731 INFO L225 Difference]: With dead ends: 1062 [2018-11-10 10:42:23,731 INFO L226 Difference]: Without dead ends: 634 [2018-11-10 10:42:23,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:42:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-10 10:42:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-11-10 10:42:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-10 10:42:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-11-10 10:42:23,757 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 131 [2018-11-10 10:42:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:23,758 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-11-10 10:42:23,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:42:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-11-10 10:42:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 10:42:23,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:23,761 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:23,761 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:23,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 415093804, now seen corresponding path program 1 times [2018-11-10 10:42:23,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:23,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:23,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:23,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:23,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:23,857 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-11-10 10:42:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:25,024 INFO L93 Difference]: Finished difference Result 2352 states and 4010 transitions. [2018-11-10 10:42:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:25,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-10 10:42:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:25,031 INFO L225 Difference]: With dead ends: 2352 [2018-11-10 10:42:25,032 INFO L226 Difference]: Without dead ends: 1733 [2018-11-10 10:42:25,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-11-10 10:42:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2018-11-10 10:42:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2018-11-10 10:42:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2668 transitions. [2018-11-10 10:42:25,070 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2668 transitions. Word has length 140 [2018-11-10 10:42:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:25,071 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 2668 transitions. [2018-11-10 10:42:25,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2668 transitions. [2018-11-10 10:42:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-10 10:42:25,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:25,077 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 10:42:25,077 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:25,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -872463117, now seen corresponding path program 1 times [2018-11-10 10:42:25,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:25,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:25,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 147 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:25,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:25,626 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:25,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 10:42:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:42:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2018-11-10 10:42:25,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:42:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:42:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:42:25,885 INFO L87 Difference]: Start difference. First operand 1733 states and 2668 transitions. Second operand 15 states. [2018-11-10 10:42:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:32,576 INFO L93 Difference]: Finished difference Result 10010 states and 15901 transitions. [2018-11-10 10:42:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-10 10:42:32,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2018-11-10 10:42:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:32,614 INFO L225 Difference]: With dead ends: 10010 [2018-11-10 10:42:32,614 INFO L226 Difference]: Without dead ends: 8283 [2018-11-10 10:42:32,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 293 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 10:42:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2018-11-10 10:42:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 7595. [2018-11-10 10:42:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2018-11-10 10:42:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 10526 transitions. [2018-11-10 10:42:32,814 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 10526 transitions. Word has length 277 [2018-11-10 10:42:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:32,814 INFO L481 AbstractCegarLoop]: Abstraction has 7595 states and 10526 transitions. [2018-11-10 10:42:32,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:42:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 10526 transitions. [2018-11-10 10:42:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-11-10 10:42:32,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:32,832 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:32,833 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:32,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1746401696, now seen corresponding path program 1 times [2018-11-10 10:42:32,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 199 proven. 197 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:42:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:33,534 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:33,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:33,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 310 proven. 53 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 10:42:33,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:42:33,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2018-11-10 10:42:33,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:42:33,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:42:33,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:42:33,804 INFO L87 Difference]: Start difference. First operand 7595 states and 10526 transitions. Second operand 15 states. [2018-11-10 10:42:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:36,220 INFO L93 Difference]: Finished difference Result 16739 states and 23296 transitions. [2018-11-10 10:42:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 10:42:36,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 380 [2018-11-10 10:42:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:36,239 INFO L225 Difference]: With dead ends: 16739 [2018-11-10 10:42:36,239 INFO L226 Difference]: Without dead ends: 8956 [2018-11-10 10:42:36,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-11-10 10:42:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8956 states. [2018-11-10 10:42:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8956 to 8523. [2018-11-10 10:42:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8523 states. [2018-11-10 10:42:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 10770 transitions. [2018-11-10 10:42:36,371 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 10770 transitions. Word has length 380 [2018-11-10 10:42:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:36,371 INFO L481 AbstractCegarLoop]: Abstraction has 8523 states and 10770 transitions. [2018-11-10 10:42:36,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:42:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 10770 transitions. [2018-11-10 10:42:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-10 10:42:36,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:36,386 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:36,387 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:36,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1141201435, now seen corresponding path program 1 times [2018-11-10 10:42:36,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:36,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:36,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 342 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 10:42:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:36,957 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:36,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:37,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-10 10:42:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:42:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2018-11-10 10:42:37,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:42:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:42:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:42:37,151 INFO L87 Difference]: Start difference. First operand 8523 states and 10770 transitions. Second operand 16 states. [2018-11-10 10:42:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:40,215 INFO L93 Difference]: Finished difference Result 17723 states and 22576 transitions. [2018-11-10 10:42:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 10:42:40,215 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 405 [2018-11-10 10:42:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:40,234 INFO L225 Difference]: With dead ends: 17723 [2018-11-10 10:42:40,235 INFO L226 Difference]: Without dead ends: 9393 [2018-11-10 10:42:40,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 427 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=626, Invalid=2236, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 10:42:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states. [2018-11-10 10:42:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 8290. [2018-11-10 10:42:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8290 states. [2018-11-10 10:42:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8290 states to 8290 states and 10045 transitions. [2018-11-10 10:42:40,381 INFO L78 Accepts]: Start accepts. Automaton has 8290 states and 10045 transitions. Word has length 405 [2018-11-10 10:42:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:40,381 INFO L481 AbstractCegarLoop]: Abstraction has 8290 states and 10045 transitions. [2018-11-10 10:42:40,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 10:42:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 8290 states and 10045 transitions. [2018-11-10 10:42:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-11-10 10:42:40,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:40,413 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:40,413 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:40,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2044719248, now seen corresponding path program 1 times [2018-11-10 10:42:40,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 427 proven. 222 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 10:42:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:40,926 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:40,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:41,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 640 proven. 2 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-11-10 10:42:41,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:42:41,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-10 10:42:41,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:42:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:42:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:42:41,274 INFO L87 Difference]: Start difference. First operand 8290 states and 10045 transitions. Second operand 11 states. [2018-11-10 10:42:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:44,052 INFO L93 Difference]: Finished difference Result 21676 states and 26982 transitions. [2018-11-10 10:42:44,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 10:42:44,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 612 [2018-11-10 10:42:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:44,086 INFO L225 Difference]: With dead ends: 21676 [2018-11-10 10:42:44,087 INFO L226 Difference]: Without dead ends: 13579 [2018-11-10 10:42:44,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 626 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-11-10 10:42:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13579 states. [2018-11-10 10:42:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13579 to 12380. [2018-11-10 10:42:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12380 states. [2018-11-10 10:42:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12380 states to 12380 states and 14458 transitions. [2018-11-10 10:42:44,281 INFO L78 Accepts]: Start accepts. Automaton has 12380 states and 14458 transitions. Word has length 612 [2018-11-10 10:42:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:44,282 INFO L481 AbstractCegarLoop]: Abstraction has 12380 states and 14458 transitions. [2018-11-10 10:42:44,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:42:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12380 states and 14458 transitions. [2018-11-10 10:42:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-11-10 10:42:44,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:44,322 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:44,323 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:44,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 726525659, now seen corresponding path program 1 times [2018-11-10 10:42:44,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:44,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:44,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1766 backedges. 568 proven. 777 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2018-11-10 10:42:45,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:45,269 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:45,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1766 backedges. 1294 proven. 2 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-10 10:42:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:42:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2018-11-10 10:42:45,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:42:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:42:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:42:45,723 INFO L87 Difference]: Start difference. First operand 12380 states and 14458 transitions. Second operand 13 states. [2018-11-10 10:42:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:47,309 INFO L93 Difference]: Finished difference Result 24756 states and 29735 transitions. [2018-11-10 10:42:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:42:47,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 715 [2018-11-10 10:42:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:47,346 INFO L225 Difference]: With dead ends: 24756 [2018-11-10 10:42:47,346 INFO L226 Difference]: Without dead ends: 12425 [2018-11-10 10:42:47,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 723 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-11-10 10:42:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12425 states. [2018-11-10 10:42:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12425 to 11523. [2018-11-10 10:42:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2018-11-10 10:42:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 13178 transitions. [2018-11-10 10:42:47,579 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 13178 transitions. Word has length 715 [2018-11-10 10:42:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:47,580 INFO L481 AbstractCegarLoop]: Abstraction has 11523 states and 13178 transitions. [2018-11-10 10:42:47,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:42:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 13178 transitions. [2018-11-10 10:42:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2018-11-10 10:42:47,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:47,594 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:47,595 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:47,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -641737425, now seen corresponding path program 1 times [2018-11-10 10:42:47,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 594 proven. 855 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-11-10 10:42:48,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:48,549 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:48,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 1372 proven. 2 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2018-11-10 10:42:48,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:42:48,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-10 10:42:48,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 10:42:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:42:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:42:48,901 INFO L87 Difference]: Start difference. First operand 11523 states and 13178 transitions. Second operand 18 states. [2018-11-10 10:42:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:53,954 INFO L93 Difference]: Finished difference Result 25463 states and 30015 transitions. [2018-11-10 10:42:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 10:42:53,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 741 [2018-11-10 10:42:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:53,982 INFO L225 Difference]: With dead ends: 25463 [2018-11-10 10:42:53,982 INFO L226 Difference]: Without dead ends: 13946 [2018-11-10 10:42:54,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=590, Invalid=2272, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 10:42:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13946 states. [2018-11-10 10:42:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13946 to 13222. [2018-11-10 10:42:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13222 states. [2018-11-10 10:42:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13222 states to 13222 states and 14972 transitions. [2018-11-10 10:42:54,178 INFO L78 Accepts]: Start accepts. Automaton has 13222 states and 14972 transitions. Word has length 741 [2018-11-10 10:42:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:54,179 INFO L481 AbstractCegarLoop]: Abstraction has 13222 states and 14972 transitions. [2018-11-10 10:42:54,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 10:42:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13222 states and 14972 transitions. [2018-11-10 10:42:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-11-10 10:42:54,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:54,197 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:42:54,198 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:54,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash -664045017, now seen corresponding path program 1 times [2018-11-10 10:42:54,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:42:54,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:42:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:54,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:54,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:42:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 791 proven. 845 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-10 10:42:55,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:42:55,913 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:42:55,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:56,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1269 proven. 2 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2018-11-10 10:42:56,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:42:56,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2018-11-10 10:42:56,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 10:42:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 10:42:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:42:56,258 INFO L87 Difference]: Start difference. First operand 13222 states and 14972 transitions. Second operand 20 states. [2018-11-10 10:43:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:03,357 INFO L93 Difference]: Finished difference Result 32468 states and 37293 transitions. [2018-11-10 10:43:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-11-10 10:43:03,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 843 [2018-11-10 10:43:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:03,397 INFO L225 Difference]: With dead ends: 32468 [2018-11-10 10:43:03,397 INFO L226 Difference]: Without dead ends: 19111 [2018-11-10 10:43:03,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 914 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3839 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1484, Invalid=9436, Unknown=0, NotChecked=0, Total=10920 [2018-11-10 10:43:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19111 states. [2018-11-10 10:43:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19111 to 18171. [2018-11-10 10:43:03,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18171 states. [2018-11-10 10:43:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18171 states to 18171 states and 20369 transitions. [2018-11-10 10:43:03,623 INFO L78 Accepts]: Start accepts. Automaton has 18171 states and 20369 transitions. Word has length 843 [2018-11-10 10:43:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:03,624 INFO L481 AbstractCegarLoop]: Abstraction has 18171 states and 20369 transitions. [2018-11-10 10:43:03,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 10:43:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 18171 states and 20369 transitions. [2018-11-10 10:43:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2018-11-10 10:43:03,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:03,701 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-11-10 10:43:03,702 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:03,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1961239800, now seen corresponding path program 1 times [2018-11-10 10:43:03,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:03,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:03,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:03,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:03,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 1686 proven. 355 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2018-11-10 10:43:04,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:04,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:04,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:04,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 2471 proven. 6 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2018-11-10 10:43:05,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:05,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-10 10:43:05,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:43:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:43:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:43:05,119 INFO L87 Difference]: Start difference. First operand 18171 states and 20369 transitions. Second operand 9 states. [2018-11-10 10:43:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:07,754 INFO L93 Difference]: Finished difference Result 41829 states and 50337 transitions. [2018-11-10 10:43:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 10:43:07,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1148 [2018-11-10 10:43:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:07,817 INFO L225 Difference]: With dead ends: 41829 [2018-11-10 10:43:07,818 INFO L226 Difference]: Without dead ends: 23518 [2018-11-10 10:43:07,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 1160 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:43:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23518 states. [2018-11-10 10:43:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23518 to 22164. [2018-11-10 10:43:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22164 states. [2018-11-10 10:43:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22164 states to 22164 states and 25133 transitions. [2018-11-10 10:43:08,123 INFO L78 Accepts]: Start accepts. Automaton has 22164 states and 25133 transitions. Word has length 1148 [2018-11-10 10:43:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:08,124 INFO L481 AbstractCegarLoop]: Abstraction has 22164 states and 25133 transitions. [2018-11-10 10:43:08,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:43:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 22164 states and 25133 transitions. [2018-11-10 10:43:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1171 [2018-11-10 10:43:08,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:08,150 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:08,151 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:08,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1408853420, now seen corresponding path program 1 times [2018-11-10 10:43:08,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:08,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4237 backedges. 1052 proven. 1833 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2018-11-10 10:43:09,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:09,670 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:09,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4237 backedges. 2596 proven. 2 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2018-11-10 10:43:10,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:10,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2018-11-10 10:43:10,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:43:10,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:43:10,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-10 10:43:10,298 INFO L87 Difference]: Start difference. First operand 22164 states and 25133 transitions. Second operand 17 states. [2018-11-10 10:43:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:13,087 INFO L93 Difference]: Finished difference Result 44465 states and 52465 transitions. [2018-11-10 10:43:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 10:43:13,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1170 [2018-11-10 10:43:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:13,133 INFO L225 Difference]: With dead ends: 44465 [2018-11-10 10:43:13,133 INFO L226 Difference]: Without dead ends: 20797 [2018-11-10 10:43:13,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=670, Invalid=2636, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 10:43:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20797 states. [2018-11-10 10:43:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20797 to 20377. [2018-11-10 10:43:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20377 states. [2018-11-10 10:43:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20377 states to 20377 states and 22491 transitions. [2018-11-10 10:43:13,406 INFO L78 Accepts]: Start accepts. Automaton has 20377 states and 22491 transitions. Word has length 1170 [2018-11-10 10:43:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:13,407 INFO L481 AbstractCegarLoop]: Abstraction has 20377 states and 22491 transitions. [2018-11-10 10:43:13,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:43:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20377 states and 22491 transitions. [2018-11-10 10:43:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1235 [2018-11-10 10:43:13,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:13,424 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:13,425 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:13,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 82067708, now seen corresponding path program 1 times [2018-11-10 10:43:13,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:13,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:13,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:13,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4383 backedges. 1060 proven. 1936 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2018-11-10 10:43:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:15,491 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:15,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4383 backedges. 2618 proven. 2 refuted. 0 times theorem prover too weak. 1763 trivial. 0 not checked. [2018-11-10 10:43:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2018-11-10 10:43:16,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 10:43:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 10:43:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:43:16,372 INFO L87 Difference]: Start difference. First operand 20377 states and 22491 transitions. Second operand 18 states. [2018-11-10 10:43:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:19,458 INFO L93 Difference]: Finished difference Result 40962 states and 45289 transitions. [2018-11-10 10:43:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 10:43:19,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1234 [2018-11-10 10:43:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:19,485 INFO L225 Difference]: With dead ends: 40962 [2018-11-10 10:43:19,485 INFO L226 Difference]: Without dead ends: 20776 [2018-11-10 10:43:19,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1262 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=526, Invalid=1924, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 10:43:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20776 states. [2018-11-10 10:43:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20776 to 18846. [2018-11-10 10:43:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18846 states. [2018-11-10 10:43:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18846 states to 18846 states and 20198 transitions. [2018-11-10 10:43:19,709 INFO L78 Accepts]: Start accepts. Automaton has 18846 states and 20198 transitions. Word has length 1234 [2018-11-10 10:43:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:19,710 INFO L481 AbstractCegarLoop]: Abstraction has 18846 states and 20198 transitions. [2018-11-10 10:43:19,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 10:43:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18846 states and 20198 transitions. [2018-11-10 10:43:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-11-10 10:43:19,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:19,737 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:19,737 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:19,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 417546880, now seen corresponding path program 1 times [2018-11-10 10:43:19,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:19,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:19,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:19,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7566 backedges. 1188 proven. 3869 refuted. 0 times theorem prover too weak. 2509 trivial. 0 not checked. [2018-11-10 10:43:22,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:22,600 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:22,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:22,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7566 backedges. 4661 proven. 2 refuted. 0 times theorem prover too weak. 2903 trivial. 0 not checked. [2018-11-10 10:43:23,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:23,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2018-11-10 10:43:23,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:43:23,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:43:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:43:23,526 INFO L87 Difference]: Start difference. First operand 18846 states and 20198 transitions. Second operand 19 states. [2018-11-10 10:43:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:27,558 INFO L93 Difference]: Finished difference Result 38386 states and 42920 transitions. [2018-11-10 10:43:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 10:43:27,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1586 [2018-11-10 10:43:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:27,611 INFO L225 Difference]: With dead ends: 38386 [2018-11-10 10:43:27,611 INFO L226 Difference]: Without dead ends: 19731 [2018-11-10 10:43:27,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1692 GetRequests, 1624 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=984, Invalid=3572, Unknown=0, NotChecked=0, Total=4556 [2018-11-10 10:43:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19731 states. [2018-11-10 10:43:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19731 to 18931. [2018-11-10 10:43:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18931 states. [2018-11-10 10:43:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18931 states to 18931 states and 20248 transitions. [2018-11-10 10:43:27,860 INFO L78 Accepts]: Start accepts. Automaton has 18931 states and 20248 transitions. Word has length 1586 [2018-11-10 10:43:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:27,861 INFO L481 AbstractCegarLoop]: Abstraction has 18931 states and 20248 transitions. [2018-11-10 10:43:27,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:43:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 18931 states and 20248 transitions. [2018-11-10 10:43:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1706 [2018-11-10 10:43:27,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:27,885 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:27,885 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:27,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1662833811, now seen corresponding path program 1 times [2018-11-10 10:43:27,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:27,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:27,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8929 backedges. 1944 proven. 5334 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2018-11-10 10:43:31,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:31,628 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:31,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8929 backedges. 2885 proven. 87 refuted. 0 times theorem prover too weak. 5957 trivial. 0 not checked. [2018-11-10 10:43:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 8] total 33 [2018-11-10 10:43:32,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 10:43:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 10:43:32,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 10:43:32,846 INFO L87 Difference]: Start difference. First operand 18931 states and 20248 transitions. Second operand 33 states. [2018-11-10 10:43:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:55,833 INFO L93 Difference]: Finished difference Result 44200 states and 48873 transitions. [2018-11-10 10:43:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-11-10 10:43:55,833 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1705 [2018-11-10 10:43:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:55,884 INFO L225 Difference]: With dead ends: 44200 [2018-11-10 10:43:55,884 INFO L226 Difference]: Without dead ends: 25460 [2018-11-10 10:43:55,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1997 GetRequests, 1792 SyntacticMatches, 2 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16131 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5266, Invalid=36554, Unknown=0, NotChecked=0, Total=41820 [2018-11-10 10:43:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25460 states. [2018-11-10 10:43:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25460 to 20900. [2018-11-10 10:43:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20900 states. [2018-11-10 10:43:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20900 states to 20900 states and 22677 transitions. [2018-11-10 10:43:56,223 INFO L78 Accepts]: Start accepts. Automaton has 20900 states and 22677 transitions. Word has length 1705 [2018-11-10 10:43:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:56,224 INFO L481 AbstractCegarLoop]: Abstraction has 20900 states and 22677 transitions. [2018-11-10 10:43:56,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 10:43:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20900 states and 22677 transitions. [2018-11-10 10:43:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1884 [2018-11-10 10:43:56,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:56,252 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 10:43:56,252 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1014492255, now seen corresponding path program 1 times [2018-11-10 10:43:56,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:43:56,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:43:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:43:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10606 backedges. 2043 proven. 517 refuted. 0 times theorem prover too weak. 8046 trivial. 0 not checked. [2018-11-10 10:43:57,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:43:57,920 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:43:57,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:58,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10606 backedges. 4576 proven. 2 refuted. 0 times theorem prover too weak. 6028 trivial. 0 not checked. [2018-11-10 10:43:59,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:43:59,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-10 10:43:59,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:43:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:43:59,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:43:59,012 INFO L87 Difference]: Start difference. First operand 20900 states and 22677 transitions. Second operand 11 states. [2018-11-10 10:44:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:00,671 INFO L93 Difference]: Finished difference Result 39227 states and 42696 transitions. [2018-11-10 10:44:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 10:44:00,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1883 [2018-11-10 10:44:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:00,680 INFO L225 Difference]: With dead ends: 39227 [2018-11-10 10:44:00,680 INFO L226 Difference]: Without dead ends: 5688 [2018-11-10 10:44:00,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1926 GetRequests, 1896 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-11-10 10:44:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2018-11-10 10:44:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5196. [2018-11-10 10:44:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5196 states. [2018-11-10 10:44:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5196 states to 5196 states and 5345 transitions. [2018-11-10 10:44:00,787 INFO L78 Accepts]: Start accepts. Automaton has 5196 states and 5345 transitions. Word has length 1883 [2018-11-10 10:44:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:00,788 INFO L481 AbstractCegarLoop]: Abstraction has 5196 states and 5345 transitions. [2018-11-10 10:44:00,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:44:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 5196 states and 5345 transitions. [2018-11-10 10:44:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1960 [2018-11-10 10:44:00,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:00,803 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 10:44:00,804 INFO L424 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:00,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1603437079, now seen corresponding path program 1 times [2018-11-10 10:44:00,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:00,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:00,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12101 backedges. 1830 proven. 6816 refuted. 0 times theorem prover too weak. 3455 trivial. 0 not checked. [2018-11-10 10:44:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:04,680 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:44:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:04,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12101 backedges. 5848 proven. 12 refuted. 0 times theorem prover too weak. 6241 trivial. 0 not checked. [2018-11-10 10:44:07,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:44:07,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-10 10:44:07,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 10:44:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 10:44:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1019, Unknown=1, NotChecked=0, Total=1122 [2018-11-10 10:44:07,579 INFO L87 Difference]: Start difference. First operand 5196 states and 5345 transitions. Second operand 34 states. [2018-11-10 10:44:16,338 WARN L179 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 87 DAG size of output: 29 [2018-11-10 10:44:25,621 WARN L179 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-11-10 10:44:28,837 WARN L179 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2018-11-10 10:44:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:36,509 INFO L93 Difference]: Finished difference Result 13010 states and 13646 transitions. [2018-11-10 10:44:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-11-10 10:44:36,509 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1959 [2018-11-10 10:44:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:36,517 INFO L225 Difference]: With dead ends: 13010 [2018-11-10 10:44:36,517 INFO L226 Difference]: Without dead ends: 6874 [2018-11-10 10:44:36,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2162 GetRequests, 2012 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7439 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=2935, Invalid=19714, Unknown=1, NotChecked=0, Total=22650 [2018-11-10 10:44:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6874 states. [2018-11-10 10:44:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6874 to 4947. [2018-11-10 10:44:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2018-11-10 10:44:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 5049 transitions. [2018-11-10 10:44:36,578 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 5049 transitions. Word has length 1959 [2018-11-10 10:44:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:36,579 INFO L481 AbstractCegarLoop]: Abstraction has 4947 states and 5049 transitions. [2018-11-10 10:44:36,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 10:44:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 5049 transitions. [2018-11-10 10:44:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2013 [2018-11-10 10:44:36,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:36,594 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 10:44:36,594 INFO L424 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:36,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1684063104, now seen corresponding path program 1 times [2018-11-10 10:44:36,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:44:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:44:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:36,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:36,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:44:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12269 backedges. 6793 proven. 1411 refuted. 0 times theorem prover too weak. 4065 trivial. 0 not checked. [2018-11-10 10:44:40,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:44:40,569 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:44:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:40,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12269 backedges. 2163 proven. 2 refuted. 0 times theorem prover too weak. 10104 trivial. 0 not checked. [2018-11-10 10:44:41,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:44:41,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-10 10:44:41,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:44:41,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:44:42,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:44:42,000 INFO L87 Difference]: Start difference. First operand 4947 states and 5049 transitions. Second operand 19 states. [2018-11-10 10:44:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:44,983 INFO L93 Difference]: Finished difference Result 7171 states and 7397 transitions. [2018-11-10 10:44:44,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 10:44:44,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2012 [2018-11-10 10:44:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:44,985 INFO L225 Difference]: With dead ends: 7171 [2018-11-10 10:44:44,985 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:44:44,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2092 GetRequests, 2045 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=1819, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 10:44:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:44:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:44:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:44:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:44:44,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2012 [2018-11-10 10:44:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:44,992 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:44:44,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:44:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:44:44,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:44:44,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:44:45,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:45,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:46,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:49,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:49,354 WARN L179 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 1443 DAG size of output: 1279 [2018-11-10 10:44:49,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:49,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:50,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:52,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:44:52,549 WARN L179 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 1443 DAG size of output: 1279 [2018-11-10 10:44:54,405 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 532 DAG size of output: 127 [2018-11-10 10:45:03,577 WARN L179 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 1199 DAG size of output: 158 [2018-11-10 10:45:12,721 WARN L179 SmtUtils]: Spent 9.14 s on a formula simplification. DAG size of input: 1199 DAG size of output: 158 [2018-11-10 10:45:12,723 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-10 10:45:12,724 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,725 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 10:45:12,726 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-10 10:45:12,727 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,728 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 10:45:12,729 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse23 (= 8 ~a15~0)) (.cse20 (= 6 |old(~a21~0)|)) (.cse25 (= 10 |old(~a21~0)|)) (.cse15 (= 7 |old(~a15~0)|)) (.cse18 (= ~a21~0 |old(~a21~0)|)) (.cse26 (= |old(~a15~0)| ~a15~0)) (.cse16 (= ~a12~0 |old(~a12~0)|)) (.cse17 (= 1 ~a24~0)) (.cse24 (= 10 ~a21~0)) (.cse27 (= 9 ~a15~0))) (let ((.cse5 (and .cse16 .cse17 .cse24 .cse27)) (.cse7 (and .cse16 .cse26 .cse17 .cse24)) (.cse0 (and .cse16 .cse18 .cse17 .cse27)) (.cse1 (not (= 9 |old(~a15~0)|))) (.cse13 (not .cse15)) (.cse11 (and .cse16 (= ~a24~0 |old(~a24~0)|) .cse18 .cse26)) (.cse9 (< 0 (+ |old(~a12~0)| 49))) (.cse4 (not .cse25)) (.cse12 (= 7 |old(~a21~0)|)) (.cse8 (< 7 |old(~a15~0)|)) (.cse10 (and .cse16 .cse18 .cse26 .cse17)) (.cse19 (< |old(~a12~0)| 19)) (.cse14 (not (= 8 |old(~a21~0)|))) (.cse6 (< 11 |old(~a12~0)|)) (.cse2 (not .cse20)) (.cse3 (not (= 1 |old(~a24~0)|))) (.cse22 (not (= 8 |old(~a15~0)|))) (.cse21 (and .cse16 .cse18 .cse17 .cse23))) (and (or .cse0 .cse1 (or .cse2 (< 95442 |old(~a12~0)|) (< |old(~a12~0)| 95381)) .cse3) (or .cse1 .cse4 .cse5 (< |old(~a12~0)| 81) .cse3) (or .cse4 .cse3 .cse6 .cse7 .cse8) (or .cse2 .cse9 .cse3 .cse10 (< 8 |old(~a15~0)|)) (or .cse11 .cse12 .cse3 .cse13) (or .cse0 .cse14 .cse1 .cse3 .cse6) (or .cse10 (< 72 |old(~a12~0)|) .cse15 .cse3 .cse8 (<= |old(~a12~0)| 18)) (or .cse1 .cse4 .cse5 .cse3 .cse6) (or (and (and .cse16 .cse17) .cse18 (= ~a15~0 |old(~a15~0)|)) (and (or .cse1 .cse19 .cse14) (or .cse1 (not .cse12) .cse19)) .cse3) (or .cse19 .cse7 .cse4 .cse3 .cse8) (or .cse0 .cse1 .cse19 .cse3 (not (= |old(~a15~0)| |old(~a21~0)|))) (or (and .cse16 .cse18 (= 7 ~a15~0) .cse17) .cse3 .cse6 .cse13) (or .cse11 .cse9 .cse2 .cse15 .cse8) (or (or .cse20 (< 76 |old(~a12~0)|) .cse12) .cse21 .cse19 .cse3 .cse22) (or .cse19 .cse4 .cse3 .cse22 (and .cse16 .cse17 .cse23 .cse24)) (or .cse12 .cse3 .cse8 .cse10 .cse25) (or .cse19 .cse22 .cse21 .cse14 .cse3 (< 73282 |old(~a12~0)|)) (or .cse21 (or .cse22 .cse20 .cse3 .cse6)) (or .cse2 (forall ((v_prenex_5 Int)) (or (< v_prenex_5 |old(~a12~0)|) (< |old(~a12~0)| (+ (mod v_prenex_5 299959) 286349)) (< v_prenex_5 0))) .cse3 .cse22 .cse21)))) [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-10 10:45:12,730 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,731 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 10:45:12,732 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,733 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-10 10:45:12,734 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-10 10:45:12,735 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,736 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 10:45:12,737 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,738 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a21~0 7) (<= 7 ~a21~0) (= 1 ~a24~0) (= 8 ~a15~0) (<= (+ ~a12~0 49) 0)) [2018-11-10 10:45:12,739 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:45:12,739 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (< 0 (+ |old(~a12~0)| 49)) (not (= 8 |old(~a15~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= 1 ~a24~0) (= 8 ~a15~0)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|))) [2018-11-10 10:45:12,739 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-10 10:45:12,740 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse8 (= ~a15~0 9)) (.cse25 (= 7 ~a21~0))) (let ((.cse22 (not (= 8 |old(~a15~0)|))) (.cse17 (= 10 ~a21~0)) (.cse27 (not .cse25)) (.cse7 (not (= 6 ~a21~0))) (.cse11 (= ~a21~0 6)) (.cse15 (not (= 1 |old(~a24~0)|))) (.cse6 (<= ~a12~0 11)) (.cse0 (= 1 ~a24~0)) (.cse29 (or (and (not (= 6 |old(~a21~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 8 |old(~a21~0)|))) (<= |old(~a12~0)| 11) (< 80 |old(~a12~0)|))) (.cse28 (not .cse8)) (.cse12 (not (= ~a15~0 7)))) (let ((.cse3 (= 8 ~a21~0)) (.cse16 (and .cse28 .cse25 .cse12)) (.cse21 (= ~a15~0 |old(~a15~0)|)) (.cse20 (and .cse28 .cse0 .cse29)) (.cse19 (= ~a21~0 10)) (.cse18 (and .cse0 .cse6)) (.cse23 (and .cse11 .cse28 .cse0 .cse29 (or .cse15 (not (= |old(~a15~0)| 9))))) (.cse2 (= 9 ~a15~0)) (.cse1 (<= 19 ~a12~0)) (.cse9 (and (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse22 .cse15) (and .cse28 (not .cse17) .cse27 .cse0 .cse29 .cse7))) (.cse14 (<= ~a15~0 7)) (.cse24 (= 7 ~a15~0)) (.cse5 (= 8 ~a15~0)) (.cse13 (<= (+ ~a12~0 49) 0)) (.cse4 (<= |old(~a12~0)| ~a12~0)) (.cse26 (and .cse28 .cse27 .cse0 .cse12 .cse29 .cse6)) (.cse10 (= |old(~a15~0)| ~a15~0))) (or (and .cse0 (and (= ~a15~0 ~a21~0) .cse1) .cse2) (< 0 (+ |old(~a12~0)| 49)) (and (or .cse3 (< 0 (+ ~a12~0 43))) .cse4 .cse0 (and .cse5 (and .cse6 .cse7))) (and (and (and .cse3 .cse0) .cse8) .cse1) (and (and (and (<= ~a12~0 73282) .cse9) (= ~a21~0 8)) .cse10 .cse1) (and (and (<= ~a12~0 76) .cse9) .cse10 .cse1) (and (and .cse11 .cse12 .cse13) .cse14) .cse15 (and .cse3 (= ~a24~0 |old(~a24~0)|) .cse8 .cse6) (and .cse16 .cse0 .cse14 (< 18 ~a12~0) (<= ~a12~0 72)) (and .cse0 (<= 81 ~a12~0) .cse17 .cse2) (and (and .cse18 .cse19) .cse2) (and (and .cse20 .cse21) .cse19 .cse1) .cse22 (and (and (and .cse0 .cse16) .cse6) .cse4 .cse10) (and .cse23 (exists ((v_prenex_5 Int)) (and (<= 0 v_prenex_5) (<= 95381 v_prenex_5) (<= (+ (mod v_prenex_5 299959) 286349) ~a12~0))) .cse21) (and (and (<= 95381 ~a12~0) (and .cse11 .cse0) (<= ~a12~0 95442)) .cse2) (and (and .cse14 (and .cse20 .cse19)) .cse1) (and .cse24 .cse18) (and .cse23 .cse14) (and (and .cse0 (and .cse25 .cse2)) .cse1) (< 7 |old(~a21~0)|) (and .cse14 .cse26) (and .cse9 .cse14) (< |old(~a21~0)| 7) (and .cse24 (and .cse27 .cse0)) (and .cse5 (and .cse11 .cse0 .cse13)) (and .cse4 (and .cse26 .cse17) .cse10))))) [2018-11-10 10:45:12,740 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-10 10:45:12,740 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-10 10:45:12,740 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-10 10:45:12,740 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse8 (= ~a15~0 9)) (.cse25 (= 7 ~a21~0))) (let ((.cse22 (not (= 8 |old(~a15~0)|))) (.cse17 (= 10 ~a21~0)) (.cse27 (not .cse25)) (.cse7 (not (= 6 ~a21~0))) (.cse11 (= ~a21~0 6)) (.cse15 (not (= 1 |old(~a24~0)|))) (.cse6 (<= ~a12~0 11)) (.cse0 (= 1 ~a24~0)) (.cse29 (or (and (not (= 6 |old(~a21~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 8 |old(~a21~0)|))) (<= |old(~a12~0)| 11) (< 80 |old(~a12~0)|))) (.cse28 (not .cse8)) (.cse12 (not (= ~a15~0 7)))) (let ((.cse3 (= 8 ~a21~0)) (.cse16 (and .cse28 .cse25 .cse12)) (.cse21 (= ~a15~0 |old(~a15~0)|)) (.cse20 (and .cse28 .cse0 .cse29)) (.cse19 (= ~a21~0 10)) (.cse18 (and .cse0 .cse6)) (.cse23 (and .cse11 .cse28 .cse0 .cse29 (or .cse15 (not (= |old(~a15~0)| 9))))) (.cse2 (= 9 ~a15~0)) (.cse1 (<= 19 ~a12~0)) (.cse9 (and (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse22 .cse15) (and .cse28 (not .cse17) .cse27 .cse0 .cse29 .cse7))) (.cse14 (<= ~a15~0 7)) (.cse24 (= 7 ~a15~0)) (.cse5 (= 8 ~a15~0)) (.cse13 (<= (+ ~a12~0 49) 0)) (.cse4 (<= |old(~a12~0)| ~a12~0)) (.cse26 (and .cse28 .cse27 .cse0 .cse12 .cse29 .cse6)) (.cse10 (= |old(~a15~0)| ~a15~0))) (or (and .cse0 (and (= ~a15~0 ~a21~0) .cse1) .cse2) (< 0 (+ |old(~a12~0)| 49)) (and (or .cse3 (< 0 (+ ~a12~0 43))) .cse4 .cse0 (and .cse5 (and .cse6 .cse7))) (and (and (and .cse3 .cse0) .cse8) .cse1) (and (and (and (<= ~a12~0 73282) .cse9) (= ~a21~0 8)) .cse10 .cse1) (and (and (<= ~a12~0 76) .cse9) .cse10 .cse1) (and (and .cse11 .cse12 .cse13) .cse14) .cse15 (and .cse3 (= ~a24~0 |old(~a24~0)|) .cse8 .cse6) (and .cse16 .cse0 .cse14 (< 18 ~a12~0) (<= ~a12~0 72)) (and .cse0 (<= 81 ~a12~0) .cse17 .cse2) (and (and .cse18 .cse19) .cse2) (and (and .cse20 .cse21) .cse19 .cse1) .cse22 (and (and (and .cse0 .cse16) .cse6) .cse4 .cse10) (and .cse23 (exists ((v_prenex_5 Int)) (and (<= 0 v_prenex_5) (<= 95381 v_prenex_5) (<= (+ (mod v_prenex_5 299959) 286349) ~a12~0))) .cse21) (and (and (<= 95381 ~a12~0) (and .cse11 .cse0) (<= ~a12~0 95442)) .cse2) (and (and .cse14 (and .cse20 .cse19)) .cse1) (and .cse24 .cse18) (and .cse23 .cse14) (and (and .cse0 (and .cse25 .cse2)) .cse1) (< 7 |old(~a21~0)|) (and .cse14 .cse26) (and .cse9 .cse14) (< |old(~a21~0)| 7) (and .cse24 (and .cse27 .cse0)) (and .cse5 (and .cse11 .cse0 .cse13)) (and .cse4 (and .cse26 .cse17) .cse10))))) [2018-11-10 10:45:12,741 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-10 10:45:12,748 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,749 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,760 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:45:12 BoogieIcfgContainer [2018-11-10 10:45:12,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:45:12,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:45:12,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:45:12,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:45:12,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:21" (3/4) ... [2018-11-10 10:45:12,770 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:45:12,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:45:12,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 10:45:12,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:45:12,800 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:45:12,801 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 10:45:12,825 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((1 == a24 && a15 == a21 && 19 <= a12) && 9 == a15) || 0 < \old(a12) + 49) || ((((8 == a21 || 0 < a12 + 43) && \old(a12) <= a12) && 1 == a24) && 8 == a15 && a12 <= 11 && !(6 == a21))) || (((8 == a21 && 1 == a24) && a15 == 9) && 19 <= a12)) || ((((a12 <= 73282 && (((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && a21 == 8) && \old(a15) == a15) && 19 <= a12)) || (((a12 <= 76 && (((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && \old(a15) == a15) && 19 <= a12)) || (((a21 == 6 && !(a15 == 7)) && a12 + 49 <= 0) && a15 <= 7)) || !(1 == \old(a24))) || (((8 == a21 && a24 == \old(a24)) && a15 == 9) && a12 <= 11)) || ((((((!(a15 == 9) && 7 == a21) && !(a15 == 7)) && 1 == a24) && a15 <= 7) && 18 < a12) && a12 <= 72)) || (((1 == a24 && 81 <= a12) && 10 == a21) && 9 == a15)) || (((1 == a24 && a12 <= 11) && a21 == 10) && 9 == a15)) || (((((!(a15 == 9) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a15 == \old(a15)) && a21 == 10) && 19 <= a12)) || !(8 == \old(a15))) || ((((1 == a24 && (!(a15 == 9) && 7 == a21) && !(a15 == 7)) && a12 <= 11) && \old(a12) <= a12) && \old(a15) == a15)) || ((((((a21 == 6 && !(a15 == 9)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && (!(1 == \old(a24)) || !(\old(a15) == 9))) && (\exists v_prenex_5 : int :: (0 <= v_prenex_5 && 95381 <= v_prenex_5) && v_prenex_5 % 299959 + 286349 <= a12)) && a15 == \old(a15))) || (((95381 <= a12 && a21 == 6 && 1 == a24) && a12 <= 95442) && 9 == a15)) || ((a15 <= 7 && ((!(a15 == 9) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a21 == 10) && 19 <= a12)) || (7 == a15 && 1 == a24 && a12 <= 11)) || (((((a21 == 6 && !(a15 == 9)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && (!(1 == \old(a24)) || !(\old(a15) == 9))) && a15 <= 7)) || ((1 == a24 && 7 == a21 && 9 == a15) && 19 <= a12)) || 7 < \old(a21)) || (a15 <= 7 && ((((!(a15 == 9) && !(7 == a21)) && 1 == a24) && !(a15 == 7)) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a12 <= 11)) || (((((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && a15 <= 7)) || \old(a21) < 7) || (7 == a15 && !(7 == a21) && 1 == a24)) || (8 == a15 && (a21 == 6 && 1 == a24) && a12 + 49 <= 0)) || ((\old(a12) <= a12 && (((((!(a15 == 9) && !(7 == a21)) && 1 == a24) && !(a15 == 7)) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a12 <= 11) && 10 == a21) && \old(a15) == a15) [2018-11-10 10:45:12,909 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0dc8d005-21b0-41a3-b6aa-26d7bc247e20/bin-2019/uautomizer/witness.graphml [2018-11-10 10:45:12,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:45:12,910 INFO L168 Benchmark]: Toolchain (without parser) took 172709.81 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 954.3 MB in the beginning and 789.5 MB in the end (delta: 164.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,911 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:45:12,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.43 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 916.7 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,911 INFO L168 Benchmark]: Boogie Preprocessor took 139.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 916.7 MB in the beginning and 1.1 GB in the end (delta: -226.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,911 INFO L168 Benchmark]: RCFGBuilder took 1104.78 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: 132.6 MB). Peak memory consumption was 132.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,912 INFO L168 Benchmark]: TraceAbstraction took 170910.37 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 828.7 MB in the end (delta: 181.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,912 INFO L168 Benchmark]: Witness Printer took 144.64 ms. Allocated memory is still 4.8 GB. Free memory was 828.7 MB in the beginning and 789.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:45:12,913 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.43 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 916.7 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 916.7 MB in the beginning and 1.1 GB in the end (delta: -226.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1104.78 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: 132.6 MB). Peak memory consumption was 132.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 170910.37 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 828.7 MB in the end (delta: 181.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 144.64 ms. Allocated memory is still 4.8 GB. Free memory was 828.7 MB in the beginning and 789.5 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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: 880]: Loop Invariant [2018-11-10 10:45:12,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-10 10:45:12,920 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((1 == a24 && a15 == a21 && 19 <= a12) && 9 == a15) || 0 < \old(a12) + 49) || ((((8 == a21 || 0 < a12 + 43) && \old(a12) <= a12) && 1 == a24) && 8 == a15 && a12 <= 11 && !(6 == a21))) || (((8 == a21 && 1 == a24) && a15 == 9) && 19 <= a12)) || ((((a12 <= 73282 && (((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && a21 == 8) && \old(a15) == a15) && 19 <= a12)) || (((a12 <= 76 && (((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && \old(a15) == a15) && 19 <= a12)) || (((a21 == 6 && !(a15 == 7)) && a12 + 49 <= 0) && a15 <= 7)) || !(1 == \old(a24))) || (((8 == a21 && a24 == \old(a24)) && a15 == 9) && a12 <= 11)) || ((((((!(a15 == 9) && 7 == a21) && !(a15 == 7)) && 1 == a24) && a15 <= 7) && 18 < a12) && a12 <= 72)) || (((1 == a24 && 81 <= a12) && 10 == a21) && 9 == a15)) || (((1 == a24 && a12 <= 11) && a21 == 10) && 9 == a15)) || (((((!(a15 == 9) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a15 == \old(a15)) && a21 == 10) && 19 <= a12)) || !(8 == \old(a15))) || ((((1 == a24 && (!(a15 == 9) && 7 == a21) && !(a15 == 7)) && a12 <= 11) && \old(a12) <= a12) && \old(a15) == a15)) || ((((((a21 == 6 && !(a15 == 9)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && (!(1 == \old(a24)) || !(\old(a15) == 9))) && (\exists v_prenex_5 : int :: (0 <= v_prenex_5 && 95381 <= v_prenex_5) && v_prenex_5 % 299959 + 286349 <= a12)) && a15 == \old(a15))) || (((95381 <= a12 && a21 == 6 && 1 == a24) && a12 <= 95442) && 9 == a15)) || ((a15 <= 7 && ((!(a15 == 9) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a21 == 10) && 19 <= a12)) || (7 == a15 && 1 == a24 && a12 <= 11)) || (((((a21 == 6 && !(a15 == 9)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && (!(1 == \old(a24)) || !(\old(a15) == 9))) && a15 <= 7)) || ((1 == a24 && 7 == a21 && 9 == a15) && 19 <= a12)) || 7 < \old(a21)) || (a15 <= 7 && ((((!(a15 == 9) && !(7 == a21)) && 1 == a24) && !(a15 == 7)) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a12 <= 11)) || (((((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))) || !(1 == \old(a24))) && ((((!(a15 == 9) && !(10 == a21)) && !(7 == a21)) && 1 == a24) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && !(6 == a21)) && a15 <= 7)) || \old(a21) < 7) || (7 == a15 && !(7 == a21) && 1 == a24)) || (8 == a15 && (a21 == 6 && 1 == a24) && a12 + 49 <= 0)) || ((\old(a12) <= a12 && (((((!(a15 == 9) && !(7 == a21)) && 1 == a24) && !(a15 == 7)) && ((((!(6 == \old(a21)) && !(7 == \old(a21))) && !(8 == \old(a21))) || \old(a12) <= 11) || 80 < \old(a12))) && a12 <= 11) && 10 == a21) && \old(a15) == a15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 170.8s OverallTime, 18 OverallIterations, 16 TraceHistogramMax, 101.1s AutomataDifference, 0.0s DeadEndRemovalTime, 27.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2246 SDtfs, 97010 SDslu, 8858 SDs, 0 SdLazy, 135594 SolverSat, 14275 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 57.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18134 GetRequests, 17137 SyntacticMatches, 25 SemanticMatches, 972 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34257 ImplicationChecksByTransitivity, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22164occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 17481 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 847 PreInvPairs, 1135 NumberOfFragments, 2164 HoareAnnotationTreeSize, 847 FomulaSimplifications, 9429417 FormulaSimplificationTreeSizeReduction, 7.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4262660 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 33655 NumberOfCodeBlocks, 33655 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 33622 ConstructedInterpolants, 7 QuantifiedInterpolants, 186228378 SizeOfPredicates, 25 NumberOfNonLiveVariables, 23098 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 119015/144200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...