./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label00_true-unreach-call.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_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label00_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0db867b83f4df60c5aafa7e1ef5bcec7ce49962a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:25:39,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:25:39,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:25:39,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:25:39,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:25:39,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:25:39,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:25:39,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:25:39,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:25:39,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:25:39,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:25:39,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:25:39,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:25:39,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:25:39,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:25:39,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:25:39,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:25:39,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:25:39,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:25:39,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:25:39,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:25:39,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:25:39,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:25:39,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:25:39,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:25:39,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:25:39,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:25:39,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:25:39,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:25:39,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:25:39,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:25:39,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:25:39,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:25:39,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:25:39,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:25:39,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:25:39,555 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:25:39,563 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:25:39,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:25:39,563 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:25:39,564 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:25:39,564 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:25:39,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:25:39,565 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:25:39,565 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:25:39,565 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:25:39,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:25:39,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:25:39,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:25:39,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:25:39,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:25:39,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:25:39,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:25:39,568 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan 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 -> Taipan 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 -> 0db867b83f4df60c5aafa7e1ef5bcec7ce49962a [2018-11-10 05:25:39,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:25:39,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:25:39,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:25:39,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:25:39,600 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:25:39,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-11-10 05:25:39,645 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/data/75df5eb75/13f7c0e299034bffa37bce926e8f24ac/FLAGdaeda20f3 [2018-11-10 05:25:40,095 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:25:40,096 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/sv-benchmarks/c/eca-rers2012/Problem10_label00_true-unreach-call.c [2018-11-10 05:25:40,106 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/data/75df5eb75/13f7c0e299034bffa37bce926e8f24ac/FLAGdaeda20f3 [2018-11-10 05:25:40,117 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/data/75df5eb75/13f7c0e299034bffa37bce926e8f24ac [2018-11-10 05:25:40,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:25:40,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:25:40,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:25:40,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:25:40,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:25:40,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305850f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40, skipping insertion in model container [2018-11-10 05:25:40,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:25:40,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:25:40,380 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:25:40,382 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:25:40,448 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:25:40,460 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:25:40,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40 WrapperNode [2018-11-10 05:25:40,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:25:40,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:25:40,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:25:40,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:25:40,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:25:40,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:25:40,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:25:40,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:25:40,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... [2018-11-10 05:25:40,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:25:40,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:25:40,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:25:40,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:25:40,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/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 05:25:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:25:40,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:25:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 05:25:40,682 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 05:25:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:25:40,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:25:40,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:25:40,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:25:41,492 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:25:41,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:41 BoogieIcfgContainer [2018-11-10 05:25:41,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:25:41,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:25:41,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:25:41,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:25:41,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:25:40" (1/3) ... [2018-11-10 05:25:41,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205e9fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:41, skipping insertion in model container [2018-11-10 05:25:41,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:25:40" (2/3) ... [2018-11-10 05:25:41,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205e9fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:41, skipping insertion in model container [2018-11-10 05:25:41,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:41" (3/3) ... [2018-11-10 05:25:41,498 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label00_true-unreach-call.c [2018-11-10 05:25:41,503 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:25:41,509 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:25:41,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:25:41,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:25:41,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:25:41,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:25:41,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:25:41,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:25:41,541 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:25:41,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:25:41,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:25:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 05:25:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 05:25:41,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:41,564 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] [2018-11-10 05:25:41,565 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:41,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1416877404, now seen corresponding path program 1 times [2018-11-10 05:25:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:25:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:41,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:41,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:41,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:25:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:41,789 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 05:25:41,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:41,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:41,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:25:41,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:41,805 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 05:25:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:42,461 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 05:25:42,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:42,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-10 05:25:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:42,473 INFO L225 Difference]: With dead ends: 574 [2018-11-10 05:25:42,473 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 05:25:42,477 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 05:25:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 05:25:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 05:25:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 05:25:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-10 05:25:42,529 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 54 [2018-11-10 05:25:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:42,529 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-10 05:25:42,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-10 05:25:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:25:42,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:42,536 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 05:25:42,536 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:42,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1936663800, now seen corresponding path program 1 times [2018-11-10 05:25:42,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:25:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:42,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:25:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:42,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:42,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:25:42,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:25:42,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:25:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:25:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:42,698 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 4 states. [2018-11-10 05:25:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:43,433 INFO L93 Difference]: Finished difference Result 1282 states and 2328 transitions. [2018-11-10 05:25:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:25:43,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-10 05:25:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:43,442 INFO L225 Difference]: With dead ends: 1282 [2018-11-10 05:25:43,442 INFO L226 Difference]: Without dead ends: 932 [2018-11-10 05:25:43,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-11-10 05:25:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2018-11-10 05:25:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-10 05:25:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1469 transitions. [2018-11-10 05:25:43,479 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1469 transitions. Word has length 174 [2018-11-10 05:25:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:43,480 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 1469 transitions. [2018-11-10 05:25:43,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:25:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1469 transitions. [2018-11-10 05:25:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 05:25:43,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:43,486 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 05:25:43,486 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:43,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:43,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1693717853, now seen corresponding path program 1 times [2018-11-10 05:25:43,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:25:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:43,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:43,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:25:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:43,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:43,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:25:43,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:25:43,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:25:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:25:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:25:43,670 INFO L87 Difference]: Start difference. First operand 932 states and 1469 transitions. Second operand 6 states. [2018-11-10 05:25:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:45,391 INFO L93 Difference]: Finished difference Result 2162 states and 3509 transitions. [2018-11-10 05:25:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:25:45,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2018-11-10 05:25:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:45,400 INFO L225 Difference]: With dead ends: 2162 [2018-11-10 05:25:45,400 INFO L226 Difference]: Without dead ends: 1236 [2018-11-10 05:25:45,406 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 05:25:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-10 05:25:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1216. [2018-11-10 05:25:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-10 05:25:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1766 transitions. [2018-11-10 05:25:45,446 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1766 transitions. Word has length 181 [2018-11-10 05:25:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:45,447 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1766 transitions. [2018-11-10 05:25:45,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:25:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1766 transitions. [2018-11-10 05:25:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-10 05:25:45,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:45,453 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:45,453 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -200482757, now seen corresponding path program 1 times [2018-11-10 05:25:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:25:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:25:45,454 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:25:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 94 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:25:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:25:45,628 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:25:45,629 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-11-10 05:25:45,631 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:25:45,679 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:25:45,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:25:48,481 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:25:48,482 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 05:25:48,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:48,491 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:25:51,060 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 73.66% of their original sizes. [2018-11-10 05:25:51,060 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:25:54,928 INFO L415 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2018-11-10 05:25:54,928 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:25:54,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:25:54,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-10 05:25:54,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:25:54,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:25:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:25:54,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:25:54,930 INFO L87 Difference]: Start difference. First operand 1216 states and 1766 transitions. Second operand 11 states. [2018-11-10 05:26:02,757 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:26:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:24,165 INFO L93 Difference]: Finished difference Result 2575 states and 3779 transitions. [2018-11-10 05:26:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:26:24,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 251 [2018-11-10 05:26:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:24,170 INFO L225 Difference]: With dead ends: 2575 [2018-11-10 05:26:24,170 INFO L226 Difference]: Without dead ends: 1365 [2018-11-10 05:26:24,174 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 255 GetRequests, 196 SyntacticMatches, 45 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:26:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2018-11-10 05:26:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1360. [2018-11-10 05:26:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-11-10 05:26:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1918 transitions. [2018-11-10 05:26:24,238 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1918 transitions. Word has length 251 [2018-11-10 05:26:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:24,238 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1918 transitions. [2018-11-10 05:26:24,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:26:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1918 transitions. [2018-11-10 05:26:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 05:26:24,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:24,244 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:26:24,244 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:24,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 509477615, now seen corresponding path program 1 times [2018-11-10 05:26:24,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:26:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:26:24,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:26:24,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:26:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:24,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:26:24,433 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:26:24,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-11-10 05:26:24,434 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:26:24,438 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:26:24,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:26:25,473 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:26:40,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:26:40,206 INFO L272 AbstractInterpreter]: Visited 135 different actions 780 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 05:26:40,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:40,212 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:26:42,559 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 74.64% of their original sizes. [2018-11-10 05:26:42,560 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:27:01,993 INFO L415 sIntCurrentIteration]: We unified 260 AI predicates to 260 [2018-11-10 05:27:01,993 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:27:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:27:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-10 05:27:01,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:27:01,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 05:27:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 05:27:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:27:01,994 INFO L87 Difference]: Start difference. First operand 1360 states and 1918 transitions. Second operand 20 states. [2018-11-10 05:28:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:45,181 INFO L93 Difference]: Finished difference Result 3697 states and 5378 transitions. [2018-11-10 05:28:45,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 05:28:45,181 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 261 [2018-11-10 05:28:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:45,189 INFO L225 Difference]: With dead ends: 3697 [2018-11-10 05:28:45,189 INFO L226 Difference]: Without dead ends: 2487 [2018-11-10 05:28:45,195 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 214 SyntacticMatches, 28 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-11-10 05:28:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2018-11-10 05:28:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2430. [2018-11-10 05:28:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2018-11-10 05:28:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3081 transitions. [2018-11-10 05:28:45,322 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3081 transitions. Word has length 261 [2018-11-10 05:28:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:45,323 INFO L481 AbstractCegarLoop]: Abstraction has 2430 states and 3081 transitions. [2018-11-10 05:28:45,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 05:28:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3081 transitions. [2018-11-10 05:28:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 05:28:45,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:45,330 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:45,330 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:45,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -42020489, now seen corresponding path program 1 times [2018-11-10 05:28:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:28:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:28:45,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:28:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 95 proven. 46 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:28:45,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:28:45,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:28:45,547 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-11-10 05:28:45,547 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:28:45,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:28:45,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:28:47,390 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:28:53,911 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:28:53,911 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 05:28:53,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:53,913 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:28:55,706 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 75.67% of their original sizes. [2018-11-10 05:28:55,706 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:29:03,478 INFO L415 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2018-11-10 05:29:03,478 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:29:03,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:29:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-10 05:29:03,479 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:29:03,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 05:29:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 05:29:03,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:29:03,479 INFO L87 Difference]: Start difference. First operand 2430 states and 3081 transitions. Second operand 23 states. [2018-11-10 05:33:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:19,543 INFO L93 Difference]: Finished difference Result 4593 states and 6191 transitions. [2018-11-10 05:33:19,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 05:33:19,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 297 [2018-11-10 05:33:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:19,550 INFO L225 Difference]: With dead ends: 4593 [2018-11-10 05:33:19,551 INFO L226 Difference]: Without dead ends: 2890 [2018-11-10 05:33:19,555 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 316 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 05:33:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-10 05:33:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2584. [2018-11-10 05:33:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2584 states. [2018-11-10 05:33:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3259 transitions. [2018-11-10 05:33:19,747 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3259 transitions. Word has length 297 [2018-11-10 05:33:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:19,748 INFO L481 AbstractCegarLoop]: Abstraction has 2584 states and 3259 transitions. [2018-11-10 05:33:19,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 05:33:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3259 transitions. [2018-11-10 05:33:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-11-10 05:33:19,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:19,757 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 05:33:19,757 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:19,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1857582932, now seen corresponding path program 1 times [2018-11-10 05:33:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:19,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:19,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 214 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:33:19,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:19,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:19,926 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 323 with the following transitions: [2018-11-10 05:33:19,926 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:33:19,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:19,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:20,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:29,710 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:29,711 INFO L272 AbstractInterpreter]: Visited 136 different actions 526 times. Merged at 5 different actions 15 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 05:33:29,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:29,712 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:31,338 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 75.34% of their original sizes. [2018-11-10 05:33:31,338 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:41,973 INFO L415 sIntCurrentIteration]: We unified 321 AI predicates to 321 [2018-11-10 05:33:41,974 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:41,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:41,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-10 05:33:41,974 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:41,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 05:33:41,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 05:33:41,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:33:41,975 INFO L87 Difference]: Start difference. First operand 2584 states and 3259 transitions. Second operand 20 states. [2018-11-10 05:34:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:50,917 INFO L93 Difference]: Finished difference Result 4745 states and 6203 transitions. [2018-11-10 05:34:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 05:34:50,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 322 [2018-11-10 05:34:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:50,925 INFO L225 Difference]: With dead ends: 4745 [2018-11-10 05:34:50,925 INFO L226 Difference]: Without dead ends: 2890 [2018-11-10 05:34:50,929 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 332 GetRequests, 285 SyntacticMatches, 18 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-11-10 05:34:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-11-10 05:34:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2736. [2018-11-10 05:34:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-11-10 05:34:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3423 transitions. [2018-11-10 05:34:51,149 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3423 transitions. Word has length 322 [2018-11-10 05:34:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:51,149 INFO L481 AbstractCegarLoop]: Abstraction has 2736 states and 3423 transitions. [2018-11-10 05:34:51,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 05:34:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3423 transitions. [2018-11-10 05:34:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-11-10 05:34:51,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:34:51,158 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:34:51,158 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:34:51,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2004825060, now seen corresponding path program 1 times [2018-11-10 05:34:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:34:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:51,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:51,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:34:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 05:34:51,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:51,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:34:51,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-11-10 05:34:51,332 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:34:51,334 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:34:51,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:34:52,329 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:35:08,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:35:08,230 INFO L272 AbstractInterpreter]: Visited 137 different actions 810 times. Merged at 8 different actions 48 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-10 05:35:08,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:08,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:35:08,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:08,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/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 05:35:08,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:08,242 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:35:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:08,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 05:35:08,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:35:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 331 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 05:35:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:35:08,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 05:35:08,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:35:08,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:35:08,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:35:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:35:08,594 INFO L87 Difference]: Start difference. First operand 2736 states and 3423 transitions. Second operand 6 states. [2018-11-10 05:35:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:13,340 INFO L93 Difference]: Finished difference Result 7183 states and 9949 transitions. [2018-11-10 05:35:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:35:13,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 370 [2018-11-10 05:35:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:35:13,357 INFO L225 Difference]: With dead ends: 7183 [2018-11-10 05:35:13,357 INFO L226 Difference]: Without dead ends: 4985 [2018-11-10 05:35:13,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 741 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:35:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2018-11-10 05:35:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4870. [2018-11-10 05:35:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2018-11-10 05:35:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 6243 transitions. [2018-11-10 05:35:13,649 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 6243 transitions. Word has length 370 [2018-11-10 05:35:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:35:13,650 INFO L481 AbstractCegarLoop]: Abstraction has 4870 states and 6243 transitions. [2018-11-10 05:35:13,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:35:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 6243 transitions. [2018-11-10 05:35:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-10 05:35:13,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:35:13,666 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:35:13,666 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:35:13,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1469628719, now seen corresponding path program 1 times [2018-11-10 05:35:13,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:35:13,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:13,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:35:13,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:35:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 344 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 05:35:13,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:13,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:35:13,878 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 384 with the following transitions: [2018-11-10 05:35:13,879 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 05:35:13,881 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:35:13,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:35:15,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:35:32,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:35:32,155 INFO L272 AbstractInterpreter]: Visited 137 different actions 805 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 05:35:32,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:35:32,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:35:32,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:35:32,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/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 05:35:32,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:35:32,165 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:35:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:35:32,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:35:32,457 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 18 [2018-11-10 05:35:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 05:35:32,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:35:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 05:35:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:35:32,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-10 05:35:32,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:35:32,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:35:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:35:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:35:32,757 INFO L87 Difference]: Start difference. First operand 4870 states and 6243 transitions. Second operand 3 states. [2018-11-10 05:35:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:35:44,476 INFO L93 Difference]: Finished difference Result 10387 states and 13942 transitions. [2018-11-10 05:35:44,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:35:44,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 383 [2018-11-10 05:35:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:35:44,478 INFO L225 Difference]: With dead ends: 10387 [2018-11-10 05:35:44,478 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:35:44,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 764 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:35:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:35:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:35:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:35:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:35:44,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 383 [2018-11-10 05:35:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:35:44,498 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:35:44,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:35:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:35:44,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:35:44,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:35:44,651 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 355 [2018-11-10 05:35:45,744 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1176 [2018-11-10 05:35:48,008 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 1439 [2018-11-10 05:35:48,872 WARN L179 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 1385 DAG size of output: 1385 [2018-11-10 05:35:50,673 WARN L179 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 1748 DAG size of output: 1748 [2018-11-10 05:35:51,616 WARN L179 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 1387 DAG size of output: 1387 [2018-11-10 05:35:56,675 WARN L179 SmtUtils]: Spent 5.06 s on a formula simplification. DAG size of input: 2012 DAG size of output: 2012 [2018-11-10 05:36:02,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:36:05,788 WARN L179 SmtUtils]: Spent 9.07 s on a formula simplification. DAG size of input: 2626 DAG size of output: 2363 [2018-11-10 05:36:26,288 WARN L179 SmtUtils]: Spent 20.49 s on a formula simplification. DAG size of input: 2626 DAG size of output: 2580 [2018-11-10 05:36:26,928 WARN L179 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 355 DAG size of output: 44 [2018-11-10 05:36:37,777 WARN L179 SmtUtils]: Spent 10.84 s on a formula simplification. DAG size of input: 908 DAG size of output: 73 [2018-11-10 05:37:10,896 WARN L179 SmtUtils]: Spent 33.07 s on a formula simplification. DAG size of input: 2060 DAG size of output: 225 [2018-11-10 05:37:33,932 WARN L179 SmtUtils]: Spent 23.02 s on a formula simplification. DAG size of input: 1846 DAG size of output: 87 [2018-11-10 05:38:04,495 WARN L179 SmtUtils]: Spent 30.55 s on a formula simplification. DAG size of input: 2008 DAG size of output: 87 [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 05:38:04,497 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 05:38:04,498 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 05:38:04,499 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 05:38:04,500 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 05:38:04,501 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 05:38:04,502 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 05:38:04,503 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 05:38:04,504 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse18 (= |old(~a10~0)| ~a10~0)) (.cse19 (= ~a1~0 |old(~a1~0)|)) (.cse12 (+ ~a4~0 |old(~a10~0)|)) (.cse2 (+ |old(~a19~0)| |old(~a10~0)|))) (let ((.cse4 (< (+ ~a12~0 ~inputB~0) 2)) (.cse7 (< (+ ~a4~0 ~inputD~0) 18)) (.cse9 (< 5 (+ ~inputB~0 ~inputC~0))) (.cse0 (< |old(~a1~0)| 219)) (.cse1 (< 9 .cse2)) (.cse6 (< 28 (* 2 ~a4~0))) (.cse13 (not (= 9 |old(~a19~0)|))) (.cse3 (< 15 .cse12)) (.cse14 (< 9 (+ |old(~a19~0)| ~a12~0))) (.cse5 (+ |old(~a1~0)| ~a12~0)) (.cse17 (= ~a19~0 9)) (.cse20 (and .cse18 .cse19)) (.cse22 (= 1 |old(~a10~0)|)) (.cse21 (= 0 |old(~a10~0)|)) (.cse8 (< ~a4~0 (+ |calculate_output_#in~input| 8))) (.cse11 (< (+ |calculate_output_#in~input| ~a12~0) 2)) (.cse15 (< (+ ~a4~0 ~a12~0) 14)) (.cse10 (< (* 2 |old(~a10~0)|) 0)) (.cse16 (< 23 (+ |old(~a19~0)| ~a4~0)))) (and (or .cse0 (and (<= (+ ~a19~0 |old(~a10~0)|) 9) (<= (+ ~inputD~0 4) ~a19~0)) (or .cse1 (< .cse2 9) (< 10 (* 2 ~inputE~0)) (< (+ ~inputE~0 ~inputB~0) 7) (< 10 (+ ~inputD~0 ~inputF~0)) (< ~inputF~0 (+ ~a12~0 6)) (< ~inputC~0 (+ ~inputB~0 1)) .cse3 .cse4 (< (+ |calculate_output_#in~input| 6) |old(~a19~0)|) (< 441469 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10)) (or (< (+ |old(~a19~0)| ~inputE~0) 14) (and (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) .cse4 (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) .cse7 .cse8 .cse11 (< 14 .cse12) .cse9 (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) .cse10) (or (or (< (+ |old(~a10~0)| 505235) |old(~a1~0)|) .cse13 .cse3 .cse14 .cse8 .cse11 .cse15 .cse10 .cse16) .cse0 .cse17) (or (and (not (= ~a19~0 6)) .cse18 .cse19) (= 6 |old(~a19~0)|)) (or .cse20 .cse21 .cse22) (or (or .cse1 (< 218 .cse5) (< |old(~a19~0)| (+ ~a12~0 8)) (< (+ |old(~a19~0)| |old(~a1~0)|) 32) .cse6 .cse15 .cse10) .cse21 (and (<= (+ ~a19~0 ~a10~0) 9) (<= 16 (* 2 ~a19~0)))) (or (or .cse21 (< |old(~a1~0)| (+ |old(~a10~0)| 23)) .cse13 .cse3 .cse14 .cse8 .cse15 (< |calculate_output_#in~input| (+ |old(~a10~0)| 1)) .cse10 (< 505272 .cse5)) .cse17) (or .cse20 (forall ((v_~a1~0_364 Int)) (or (< (div (+ v_~a1~0_364 (- 283353)) 5) (+ |old(~a1~0)| 495232)) (not (= (mod (+ v_~a1~0_364 2) 5) 0)) (< 38 v_~a1~0_364))) .cse22) (or (or .cse21 (< 23 (+ |old(~a1~0)| |old(~a10~0)|)) (< |old(~a19~0)| (+ |old(~a10~0)| 7)) (< 2 (+ ~a12~0 |old(~a10~0)|)) .cse8 .cse11 .cse15 (not (= 0 (mod |old(~a10~0)| 2))) (< (+ ~a4~0 |old(~a1~0)| 56389) 0) .cse10 .cse16) (and (<= (+ ~a10~0 7) ~a19~0) (<= (+ ~a4~0 ~a19~0) 23)))))) [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 05:38:04,505 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,506 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 05:38:04,507 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 05:38:04,508 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a10~0 14) ~a4~0) (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~inputB~0 2) ~inputD~0) (<= (+ ~a19~0 ~inputD~0) 13) (<= (+ ~inputF~0 17) ~a1~0) (<= 5 (+ ~a12~0 ~inputE~0)) (<= 2 (+ ~a10~0 ~inputB~0)) (<= (+ ~a12~0 5) ~inputE~0) (<= ~a4~0 (+ ~inputF~0 8)) (<= (+ ~a1~0 ~inputE~0) 28) (<= 6 (+ ~a10~0 ~inputF~0)) (<= (+ ~a10~0 3) ~inputC~0)) [2018-11-10 05:38:04,509 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (<= (+ ~a12~0 ~a10~0) 0) (<= 9 (+ ~a19~0 ~a10~0)) (= ~a1~0 23) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-11-10 05:38:04,509 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 05:38:04,509 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (and (exists ((v_~a1~0_364 Int)) (and (<= v_~a1~0_364 38) (<= (+ ~a1~0 495232) (div (+ v_~a1~0_364 (- 283353)) 5)) (= (mod (+ v_~a1~0_364 2) 5) 0))) .cse0) (not (= ~a19~0 6)) (and (not (= 0 ~a10~0)) .cse0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-11-10 05:38:04,510 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 05:38:04,510 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 05:38:04,510 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 05:38:04,510 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (and (exists ((v_~a1~0_364 Int)) (and (<= v_~a1~0_364 38) (<= (+ ~a1~0 495232) (div (+ v_~a1~0_364 (- 283353)) 5)) (= (mod (+ v_~a1~0_364 2) 5) 0))) .cse0) (not (= ~a19~0 6)) (and (not (= 0 ~a10~0)) .cse0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0))) [2018-11-10 05:38:04,510 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 05:38:04,514 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,515 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,519 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,519 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,520 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:38:04 BoogieIcfgContainer [2018-11-10 05:38:04,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:38:04,522 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:38:04,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:38:04,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:38:04,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:41" (3/4) ... [2018-11-10 05:38:04,526 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:38:04,531 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:38:04,531 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 05:38:04,532 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:38:04,540 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 05:38:04,540 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 05:38:04,563 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\exists v_~a1~0_364 : int :: (v_~a1~0_364 <= 38 && a1 + 495232 <= (v_~a1~0_364 + -283353) / 5) && (v_~a1~0_364 + 2) % 5 == 0) && !(a10 == 1)) || !(a19 == 6)) || (!(0 == a10) && !(a10 == 1))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 [2018-11-10 05:38:04,636 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9c948fc1-776e-4897-a329-faffc8df2cec/bin-2019/utaipan/witness.graphml [2018-11-10 05:38:04,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:38:04,637 INFO L168 Benchmark]: Toolchain (without parser) took 744517.10 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.7 GB). Free memory was 957.6 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,637 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:38:04,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 928.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 928.1 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,638 INFO L168 Benchmark]: Boogie Preprocessor took 49.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,638 INFO L168 Benchmark]: RCFGBuilder took 862.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,639 INFO L168 Benchmark]: TraceAbstraction took 743029.08 ms. Allocated memory was 1.2 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,639 INFO L168 Benchmark]: Witness Printer took 113.86 ms. Allocated memory is still 5.7 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2018-11-10 05:38:04,640 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 928.1 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 928.1 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 862.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 743029.08 ms. Allocated memory was 1.2 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 113.86 ms. Allocated memory is still 5.7 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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: 582]: Loop Invariant [2018-11-10 05:38:04,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,644 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] [2018-11-10 05:38:04,645 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_364,QUANTIFIED] Derived loop invariant: ((((((((((((((((\exists v_~a1~0_364 : int :: (v_~a1~0_364 <= 38 && a1 + 495232 <= (v_~a1~0_364 + -283353) / 5) && (v_~a1~0_364 + 2) % 5 == 0) && !(a10 == 1)) || !(a19 == 6)) || (!(0 == a10) && !(a10 == 1))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || 2 * \old(a10) < 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 742.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 477.1s AutomataDifference, 0.0s DeadEndRemovalTime, 139.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1776 SDtfs, 8867 SDslu, 1516 SDs, 0 SdLazy, 13147 SolverSat, 1835 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 268.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2716 GetRequests, 2482 SyntacticMatches, 97 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 51.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4870occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 71.9s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9957386546300937 AbsIntWeakeningRatio, 0.09760425909494233 AbsIntAvgWeakeningVarsNumRemoved, 455.5288376220053 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 657 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 111 PreInvPairs, 169 NumberOfFragments, 939 HoareAnnotationTreeSize, 111 FomulaSimplifications, 199619 FormulaSimplificationTreeSizeReduction, 41.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 167054 FormulaSimplificationTreeSizeReductionInter, 98.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3046 NumberOfCodeBlocks, 3046 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3786 ConstructedInterpolants, 50 QuantifiedInterpolants, 3059567 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1179 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 3300/3490 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...