./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29_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_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:07:31,812 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:07:31,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:07:31,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:07:31,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:07:31,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:07:31,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:07:31,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:07:31,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:07:31,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:07:31,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:07:31,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:07:31,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:07:31,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:07:31,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:07:31,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:07:31,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:07:31,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:07:31,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:07:31,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:07:31,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:07:31,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:07:31,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:07:31,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:07:31,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:07:31,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:07:31,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:07:31,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:07:31,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:07:31,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:07:31,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:07:31,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:07:31,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:07:31,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:07:31,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:07:31,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:07:31,842 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:07:31,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:07:31,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:07:31,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:07:31,849 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:07:31,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:07:31,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:07:31,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:07:31,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:07:31,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:07:31,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:07:31,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:07:31,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:07:31,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:07:31,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:07:31,852 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_cd51f914-dc89-439e-927e-d2df7377359f/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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2018-11-10 10:07:31,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:07:31,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:07:31,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:07:31,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:07:31,890 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:07:31,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-10 10:07:31,936 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/data/60f4fe0d9/0094bde3d9434ce48ad219ff153bda2e/FLAGec38a6535 [2018-11-10 10:07:32,370 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:07:32,371 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/sv-benchmarks/c/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-10 10:07:32,380 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/data/60f4fe0d9/0094bde3d9434ce48ad219ff153bda2e/FLAGec38a6535 [2018-11-10 10:07:32,391 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/data/60f4fe0d9/0094bde3d9434ce48ad219ff153bda2e [2018-11-10 10:07:32,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:07:32,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:07:32,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:07:32,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:07:32,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:07:32,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32, skipping insertion in model container [2018-11-10 10:07:32,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:07:32,440 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:07:32,664 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:07:32,667 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:07:32,731 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:07:32,744 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:07:32,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32 WrapperNode [2018-11-10 10:07:32,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:07:32,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:07:32,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:07:32,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:07:32,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... [2018-11-10 10:07:32,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:07:32,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:07:32,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:07:32,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:07:32,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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:07:32,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:07:32,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:07:32,909 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 10:07:32,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:07:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:07:33,675 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:07:33,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:07:33 BoogieIcfgContainer [2018-11-10 10:07:33,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:07:33,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:07:33,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:07:33,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:07:33,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:07:32" (1/3) ... [2018-11-10 10:07:33,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218673f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:07:33, skipping insertion in model container [2018-11-10 10:07:33,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:07:32" (2/3) ... [2018-11-10 10:07:33,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218673f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:07:33, skipping insertion in model container [2018-11-10 10:07:33,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:07:33" (3/3) ... [2018-11-10 10:07:33,682 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-11-10 10:07:33,688 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:07:33,694 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:07:33,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:07:33,724 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:07:33,724 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:07:33,724 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:07:33,724 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:07:33,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:07:33,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:07:33,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:07:33,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:07:33,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:07:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-10 10:07:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 10:07:33,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:33,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:33,750 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:33,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-11-10 10:07:33,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:33,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:33,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:34,033 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:07:34,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:34,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:07:34,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:07:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:07:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:07:34,048 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-10 10:07:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:34,703 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-10 10:07:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:07:34,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 10:07:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:34,714 INFO L225 Difference]: With dead ends: 550 [2018-11-10 10:07:34,715 INFO L226 Difference]: Without dead ends: 340 [2018-11-10 10:07:34,719 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:07:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-10 10:07:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-10 10:07:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-10 10:07:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-10 10:07:34,767 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-11-10 10:07:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:34,768 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-10 10:07:34,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:07:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-10 10:07:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:07:34,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:34,770 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:34,771 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:34,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-11-10 10:07:34,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:34,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:34,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:34,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:34,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:07:34,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:07:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:07:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:07:34,882 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-10 10:07:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:35,546 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-10 10:07:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:07:35,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-10 10:07:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:35,551 INFO L225 Difference]: With dead ends: 888 [2018-11-10 10:07:35,551 INFO L226 Difference]: Without dead ends: 554 [2018-11-10 10:07:35,553 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:07:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-10 10:07:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-10 10:07:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-10 10:07:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-10 10:07:35,577 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-11-10 10:07:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:35,578 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-10 10:07:35,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:07:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-10 10:07:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:07:35,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:35,580 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:35,580 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:35,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-11-10 10:07:35,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:35,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:35,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:35,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:07:35,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:07:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:07:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:07:35,768 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-10 10:07:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:36,225 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-10 10:07:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:07:36,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-10 10:07:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:36,229 INFO L225 Difference]: With dead ends: 1210 [2018-11-10 10:07:36,229 INFO L226 Difference]: Without dead ends: 536 [2018-11-10 10:07:36,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:07:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-10 10:07:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-10 10:07:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-10 10:07:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-10 10:07:36,246 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-11-10 10:07:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:36,247 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-10 10:07:36,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:07:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-10 10:07:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:07:36,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:36,249 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:36,249 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:36,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-11-10 10:07:36,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:36,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:36,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:07:36,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:07:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:07:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:07:36,459 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-10 10:07:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:36,925 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-10 10:07:36,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:07:36,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-10 10:07:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:36,929 INFO L225 Difference]: With dead ends: 1204 [2018-11-10 10:07:36,929 INFO L226 Difference]: Without dead ends: 535 [2018-11-10 10:07:36,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:07:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-10 10:07:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-10 10:07:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-10 10:07:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-10 10:07:36,944 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-11-10 10:07:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:36,944 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-10 10:07:36,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:07:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-10 10:07:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:07:36,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:36,946 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:36,946 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:36,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-11-10 10:07:36,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:36,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:36,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:36,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:37,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:37,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:07:37,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:07:37,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:07:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:07:37,035 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-10 10:07:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:37,436 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-11-10 10:07:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:07:37,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-10 10:07:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:37,442 INFO L225 Difference]: With dead ends: 1522 [2018-11-10 10:07:37,442 INFO L226 Difference]: Without dead ends: 993 [2018-11-10 10:07:37,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 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:07:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-10 10:07:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-11-10 10:07:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-11-10 10:07:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-11-10 10:07:37,466 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-11-10 10:07:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:37,466 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-11-10 10:07:37,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:07:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-11-10 10:07:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 10:07:37,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:37,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,469 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:37,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-11-10 10:07:37,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:37,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:07:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:07:37,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:07:37,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:07:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:07:37,542 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-11-10 10:07:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:38,273 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-11-10 10:07:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:07:38,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-10 10:07:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:38,282 INFO L225 Difference]: With dead ends: 2917 [2018-11-10 10:07:38,282 INFO L226 Difference]: Without dead ends: 1930 [2018-11-10 10:07:38,286 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:07:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-10 10:07:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-11-10 10:07:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-10 10:07:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-11-10 10:07:38,333 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-11-10 10:07:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:38,333 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-11-10 10:07:38,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:07:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-11-10 10:07:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 10:07:38,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:38,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,338 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:38,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-11-10 10:07:38,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:38,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:38,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:38,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:38,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:38,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:07:38,443 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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:07:38,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:38,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:07:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:07:38,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-10 10:07:38,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:07:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:07:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:07:38,568 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 8 states. [2018-11-10 10:07:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:40,441 INFO L93 Difference]: Finished difference Result 9609 states and 15018 transitions. [2018-11-10 10:07:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 10:07:40,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-11-10 10:07:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:40,489 INFO L225 Difference]: With dead ends: 9609 [2018-11-10 10:07:40,489 INFO L226 Difference]: Without dead ends: 7740 [2018-11-10 10:07:40,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:07:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7740 states. [2018-11-10 10:07:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7740 to 7562. [2018-11-10 10:07:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7562 states. [2018-11-10 10:07:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7562 states to 7562 states and 10545 transitions. [2018-11-10 10:07:40,727 INFO L78 Accepts]: Start accepts. Automaton has 7562 states and 10545 transitions. Word has length 142 [2018-11-10 10:07:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:40,728 INFO L481 AbstractCegarLoop]: Abstraction has 7562 states and 10545 transitions. [2018-11-10 10:07:40,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:07:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7562 states and 10545 transitions. [2018-11-10 10:07:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 10:07:40,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:40,740 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:40,740 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-11-10 10:07:40,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:40,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:40,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:07:40,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:07:40,819 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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:07:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:40,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:07:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 10:07:40,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:07:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-10 10:07:40,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:07:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:07:40,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:07:40,938 INFO L87 Difference]: Start difference. First operand 7562 states and 10545 transitions. Second operand 8 states. [2018-11-10 10:07:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:42,031 INFO L93 Difference]: Finished difference Result 17970 states and 25204 transitions. [2018-11-10 10:07:42,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:07:42,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2018-11-10 10:07:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:42,055 INFO L225 Difference]: With dead ends: 17970 [2018-11-10 10:07:42,055 INFO L226 Difference]: Without dead ends: 10414 [2018-11-10 10:07:42,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-10 10:07:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10414 states. [2018-11-10 10:07:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10414 to 10296. [2018-11-10 10:07:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10296 states. [2018-11-10 10:07:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10296 states to 10296 states and 13121 transitions. [2018-11-10 10:07:42,224 INFO L78 Accepts]: Start accepts. Automaton has 10296 states and 13121 transitions. Word has length 144 [2018-11-10 10:07:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:42,224 INFO L481 AbstractCegarLoop]: Abstraction has 10296 states and 13121 transitions. [2018-11-10 10:07:42,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:07:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 10296 states and 13121 transitions. [2018-11-10 10:07:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 10:07:42,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:42,234 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:07:42,234 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:42,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 61551953, now seen corresponding path program 1 times [2018-11-10 10:07:42,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:42,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 10:07:42,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:07:42,315 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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:07:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:42,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:07:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 10:07:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:07:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-10 10:07:42,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:07:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:07:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:07:42,439 INFO L87 Difference]: Start difference. First operand 10296 states and 13121 transitions. Second operand 8 states. [2018-11-10 10:07:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:43,521 INFO L93 Difference]: Finished difference Result 22989 states and 29544 transitions. [2018-11-10 10:07:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 10:07:43,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2018-11-10 10:07:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:43,551 INFO L225 Difference]: With dead ends: 22989 [2018-11-10 10:07:43,551 INFO L226 Difference]: Without dead ends: 12699 [2018-11-10 10:07:43,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-11-10 10:07:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12699 states. [2018-11-10 10:07:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12699 to 12253. [2018-11-10 10:07:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12253 states. [2018-11-10 10:07:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12253 states to 12253 states and 14807 transitions. [2018-11-10 10:07:43,709 INFO L78 Accepts]: Start accepts. Automaton has 12253 states and 14807 transitions. Word has length 176 [2018-11-10 10:07:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:43,710 INFO L481 AbstractCegarLoop]: Abstraction has 12253 states and 14807 transitions. [2018-11-10 10:07:43,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:07:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 12253 states and 14807 transitions. [2018-11-10 10:07:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:07:43,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:07:43,720 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,720 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:07:43,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:07:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1063175998, now seen corresponding path program 1 times [2018-11-10 10:07:43,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:07:43,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:07:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:07:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 110 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 10:07:43,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:07:43,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/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:07:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:07:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:07:43,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:07:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 154 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 10:07:43,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:07:43,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-10 10:07:43,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:07:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:07:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:07:43,934 INFO L87 Difference]: Start difference. First operand 12253 states and 14807 transitions. Second operand 9 states. [2018-11-10 10:07:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:07:45,252 INFO L93 Difference]: Finished difference Result 19083 states and 23586 transitions. [2018-11-10 10:07:45,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:07:45,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2018-11-10 10:07:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:07:45,253 INFO L225 Difference]: With dead ends: 19083 [2018-11-10 10:07:45,253 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:07:45,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:07:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:07:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:07:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:07:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:07:45,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-11-10 10:07:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:07:45,288 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:07:45,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:07:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:07:45,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:07:45,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:07:45,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:45,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,080 WARN L179 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 237 [2018-11-10 10:07:46,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:07:46,425 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 237 [2018-11-10 10:07:47,055 WARN L179 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 69 [2018-11-10 10:07:47,701 WARN L179 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 57 [2018-11-10 10:07:48,317 WARN L179 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 57 [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:07:48,319 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a21~0)| ~a21~0) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|)) [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,319 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,320 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-10 10:07:48,321 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-10 10:07:48,322 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-10 10:07:48,323 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-10 10:07:48,324 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-10 10:07:48,325 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-10 10:07:48,326 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-10 10:07:48,327 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse20 (= 1 |old(~a7~0)|)) (.cse15 (= |old(~a16~0)| ~a16~0)) (.cse0 (= 13 |old(~a8~0)|)) (.cse19 (= 4 |old(~a16~0)|))) (let ((.cse3 (< 0 |old(~a7~0)|)) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse10 (not .cse19)) (.cse13 (= 1 ~a20~0)) (.cse14 (= 13 ~a8~0)) (.cse16 (= 1 ~a21~0)) (.cse17 (= 1 ~a17~0)) (.cse18 (not .cse0)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse12 (not (= 1 |old(~a20~0)|))) (.cse8 (< 0 |old(~a21~0)|)) (.cse1 (and (= |old(~a21~0)| ~a21~0) .cse15 (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 |old(~a20~0)|))) (.cse7 (= 6 |old(~a16~0)|)) (.cse2 (not (= 8 ~a12~0))) (.cse6 (not .cse20)) (.cse4 (< 0 |old(~a17~0)|)) (.cse5 (< |old(~a21~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 (or .cse7 .cse2 .cse8 .cse9)) (or .cse10 .cse2 .cse1 .cse3 .cse4 .cse5) (or .cse11 .cse12 .cse10 (and (= 1 ~a7~0) .cse13 .cse14 .cse15 .cse16 .cse17) .cse2 .cse6 .cse18 .cse9) (or .cse0 .cse2 .cse3 .cse1 .cse5 .cse9) (or .cse19 .cse12 .cse2 .cse3 .cse5 .cse1 .cse9) (or .cse11 .cse20 .cse12 .cse10 .cse2 (and (not (= ~a7~0 1)) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse9) (or .cse12 .cse1 .cse2 .cse6 .cse4 .cse8) (or .cse1 .cse7 .cse0 .cse2 .cse6 .cse4 .cse5)))) [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,328 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,329 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-10 10:07:48,330 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-10 10:07:48,331 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 1 ~a21~0) (= 1 ~a20~0) (not (= ~a16~0 6)) (= ~a12~0 8) (<= ~a7~0 0) (not (= ~a8~0 13)) (not (= ~a16~0 4)) (= 1 ~a17~0)) [2018-11-10 10:07:48,332 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (and (= |old(~a21~0)| ~a21~0) (= |old(~a16~0)| ~a16~0) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 |old(~a20~0)|)) (= 4 |old(~a16~0)|) (not (= 1 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (< 0 |old(~a7~0)|) (< |old(~a21~0)| 1) (not (= 1 |old(~a17~0)|))) [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse4 (not (= ~a8~0 13))) (.cse7 (= 4 ~a16~0)) (.cse1 (<= 1 ~a21~0)) (.cse5 (<= ~a7~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse8 (= 1 ~a17~0)) (.cse0 (= 1 ~a7~0)) (.cse9 (<= ~a21~0 0)) (.cse6 (= 1 ~a20~0)) (.cse3 (<= ~a17~0 0))) (or (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse4 .cse5) (and .cse6 (= 13 ~a8~0) .cse7 (= 1 ~a21~0) .cse8) (and .cse1 .cse4 .cse5 .cse8) (< 0 |old(~a7~0)|) (= 13 |old(~a8~0)|) (= 4 |old(~a16~0)|) (not (= 8 ~a12~0)) (and .cse1 .cse7 .cse3 .cse5) (and .cse1 .cse6 .cse5 (not (= ~a16~0 4)) .cse8) (and .cse0 .cse9 .cse2 .cse8) (and .cse0 .cse9 .cse6 .cse3) (= 6 |old(~a16~0)|) (< |old(~a21~0)| 1) (not (= 1 |old(~a17~0)|)))) [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-10 10:07:48,332 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-10 10:07:48,333 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-10 10:07:48,333 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse4 (not (= ~a8~0 13))) (.cse7 (= 4 ~a16~0)) (.cse1 (<= 1 ~a21~0)) (.cse5 (<= ~a7~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse8 (= 1 ~a17~0)) (.cse0 (= 1 ~a7~0)) (.cse9 (<= ~a21~0 0)) (.cse6 (= 1 ~a20~0)) (.cse3 (<= ~a17~0 0))) (or (not (= 1 |old(~a20~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse4 .cse5) (and .cse6 (= 13 ~a8~0) .cse7 (= 1 ~a21~0) .cse8) (and .cse1 .cse4 .cse5 .cse8) (< 0 |old(~a7~0)|) (= 13 |old(~a8~0)|) (= 4 |old(~a16~0)|) (not (= 8 ~a12~0)) (and .cse1 .cse7 .cse3 .cse5) (and .cse1 .cse6 .cse5 (not (= ~a16~0 4)) .cse8) (and .cse0 .cse9 .cse2 .cse8) (and .cse0 .cse9 .cse6 .cse3) (= 6 |old(~a16~0)|) (< |old(~a21~0)| 1) (not (= 1 |old(~a17~0)|)))) [2018-11-10 10:07:48,333 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-10 10:07:48,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:07:48 BoogieIcfgContainer [2018-11-10 10:07:48,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:07:48,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:07:48,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:07:48,353 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:07:48,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:07:33" (3/4) ... [2018-11-10 10:07:48,363 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:07:48,369 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:07:48,369 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 10:07:48,369 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:07:48,378 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:07:48,379 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 10:07:48,404 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(1 == \old(a20)) || ((((1 == a7 && 1 <= a21) && !(a16 == 6)) && a17 <= 0) && !(a8 == 13))) || (((1 <= a21 && a17 <= 0) && !(a8 == 13)) && a7 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((1 <= a21 && !(a8 == 13)) && a7 <= 0) && 1 == a17)) || 0 < \old(a7)) || 13 == \old(a8)) || 4 == \old(a16)) || !(8 == a12)) || (((1 <= a21 && 4 == a16) && a17 <= 0) && a7 <= 0)) || ((((1 <= a21 && 1 == a20) && a7 <= 0) && !(a16 == 4)) && 1 == a17)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && 1 == a17)) || (((1 == a7 && a21 <= 0) && 1 == a20) && a17 <= 0)) || 6 == \old(a16)) || \old(a21) < 1) || !(1 == \old(a17)) [2018-11-10 10:07:48,478 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cd51f914-dc89-439e-927e-d2df7377359f/bin-2019/uautomizer/witness.graphml [2018-11-10 10:07:48,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:07:48,478 INFO L168 Benchmark]: Toolchain (without parser) took 16084.20 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 740.8 MB). Free memory was 951.2 MB in the beginning and 1.1 GB in the end (delta: -113.8 MB). Peak memory consumption was 627.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,479 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:07:48,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,479 INFO L168 Benchmark]: Boogie Preprocessor took 117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,480 INFO L168 Benchmark]: RCFGBuilder took 812.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,480 INFO L168 Benchmark]: TraceAbstraction took 14676.49 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 575.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.8 MB). Peak memory consumption was 695.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,480 INFO L168 Benchmark]: Witness Printer took 124.84 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:07:48,482 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.6 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 921.6 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 812.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14676.49 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 575.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.8 MB). Peak memory consumption was 695.6 MB. Max. memory is 11.5 GB. * Witness Printer took 124.84 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((!(1 == \old(a20)) || ((((1 == a7 && 1 <= a21) && !(a16 == 6)) && a17 <= 0) && !(a8 == 13))) || (((1 <= a21 && a17 <= 0) && !(a8 == 13)) && a7 <= 0)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((1 <= a21 && !(a8 == 13)) && a7 <= 0) && 1 == a17)) || 0 < \old(a7)) || 13 == \old(a8)) || 4 == \old(a16)) || !(8 == a12)) || (((1 <= a21 && 4 == a16) && a17 <= 0) && a7 <= 0)) || ((((1 <= a21 && 1 == a20) && a7 <= 0) && !(a16 == 4)) && 1 == a17)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && 1 == a17)) || (((1 == a7 && a21 <= 0) && 1 == a20) && a17 <= 0)) || 6 == \old(a16)) || \old(a21) < 1) || !(1 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 14.6s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 957 SDtfs, 7867 SDslu, 1343 SDs, 0 SdLazy, 11401 SolverSat, 2150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 832 GetRequests, 723 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12253occurred in iteration=9, 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: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 812 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 416 PreInvPairs, 660 NumberOfFragments, 775 HoareAnnotationTreeSize, 416 FomulaSimplifications, 34436 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 46798 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2064 NumberOfCodeBlocks, 2064 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2050 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168170 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1905 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 706/833 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...