./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2ee6781c62be40fa372129eaacaba9832af3ce9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:29:55,363 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:29:55,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:29:55,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:29:55,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:29:55,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:29:55,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:29:55,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:29:55,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:29:55,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:29:55,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:29:55,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:29:55,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:29:55,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:29:55,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:29:55,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:29:55,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:29:55,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:29:55,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:29:55,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:29:55,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:29:55,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:29:55,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:29:55,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:29:55,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:29:55,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:29:55,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:29:55,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:29:55,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:29:55,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:29:55,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:29:55,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:29:55,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:29:55,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:29:55,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:29:55,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:29:55,392 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 12:29:55,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:29:55,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:29:55,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:29:55,402 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 12:29:55,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:29:55,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:29:55,403 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:29:55,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:29:55,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:29:55,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:29:55,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:29:55,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:29:55,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:29:55,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:29:55,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:29:55,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:29:55,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:29:55,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:29:55,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:29:55,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2018-11-18 12:29:55,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:29:55,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:29:55,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:29:55,440 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:29:55,440 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:29:55,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-18 12:29:55,477 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/data/2f4c9a894/f264f50352894d36a34bfafe02f2373f/FLAGb351f3ea9 [2018-11-18 12:29:55,932 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:29:55,933 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-11-18 12:29:55,942 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/data/2f4c9a894/f264f50352894d36a34bfafe02f2373f/FLAGb351f3ea9 [2018-11-18 12:29:55,954 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/data/2f4c9a894/f264f50352894d36a34bfafe02f2373f [2018-11-18 12:29:55,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:29:55,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 12:29:55,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:29:55,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:29:55,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:29:55,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:29:55" (1/1) ... [2018-11-18 12:29:55,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e32060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:55, skipping insertion in model container [2018-11-18 12:29:55,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:29:55" (1/1) ... [2018-11-18 12:29:55,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:29:56,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:29:56,216 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:29:56,219 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:29:56,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:29:56,299 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:29:56,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56 WrapperNode [2018-11-18 12:29:56,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:29:56,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:29:56,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:29:56,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:29:56,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... [2018-11-18 12:29:56,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:29:56,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:29:56,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:29:56,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:29:56,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:29:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:29:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:29:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 12:29:56,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:29:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:29:57,318 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:29:57,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:57 BoogieIcfgContainer [2018-11-18 12:29:57,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:29:57,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:29:57,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:29:57,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:29:57,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:29:55" (1/3) ... [2018-11-18 12:29:57,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae35545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:29:57, skipping insertion in model container [2018-11-18 12:29:57,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:29:56" (2/3) ... [2018-11-18 12:29:57,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae35545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:29:57, skipping insertion in model container [2018-11-18 12:29:57,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:57" (3/3) ... [2018-11-18 12:29:57,327 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-11-18 12:29:57,335 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:29:57,341 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:29:57,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:29:57,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:29:57,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:29:57,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:29:57,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:29:57,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:29:57,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:29:57,383 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:29:57,383 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:29:57,383 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:29:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-18 12:29:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 12:29:57,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:29:57,409 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] [2018-11-18 12:29:57,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:29:57,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash -654369111, now seen corresponding path program 1 times [2018-11-18 12:29:57,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:57,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:57,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:57,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:57,608 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-18 12:29:57,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:29:57,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:29:57,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:29:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:29:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:29:57,628 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-18 12:29:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:29:58,228 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-18 12:29:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:29:58,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 12:29:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:29:58,239 INFO L225 Difference]: With dead ends: 574 [2018-11-18 12:29:58,239 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 12:29:58,242 INFO L604 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-18 12:29:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 12:29:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-18 12:29:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 12:29:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-18 12:29:58,281 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 29 [2018-11-18 12:29:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:29:58,281 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-18 12:29:58,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:29:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-18 12:29:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 12:29:58,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:29:58,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:29:58,284 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:29:58,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 350526568, now seen corresponding path program 1 times [2018-11-18 12:29:58,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:58,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:58,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:29:58,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:29:58,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:29:58,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:29:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:29:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:29:58,428 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 6 states. [2018-11-18 12:29:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:29:59,017 INFO L93 Difference]: Finished difference Result 867 states and 1507 transitions. [2018-11-18 12:29:59,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:29:59,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-11-18 12:29:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:29:59,021 INFO L225 Difference]: With dead ends: 867 [2018-11-18 12:29:59,021 INFO L226 Difference]: Without dead ends: 517 [2018-11-18 12:29:59,023 INFO L604 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-18 12:29:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-18 12:29:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 508. [2018-11-18 12:29:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-18 12:29:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2018-11-18 12:29:59,044 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 103 [2018-11-18 12:29:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:29:59,044 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2018-11-18 12:29:59,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:29:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2018-11-18 12:29:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 12:29:59,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:29:59,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:29:59,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:29:59,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -781565036, now seen corresponding path program 1 times [2018-11-18 12:29:59,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:59,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:59,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:29:59,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:29:59,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:29:59,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:29:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:29:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:29:59,142 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand 4 states. [2018-11-18 12:29:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:29:59,749 INFO L93 Difference]: Finished difference Result 1742 states and 2991 transitions. [2018-11-18 12:29:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:29:59,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-18 12:29:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:29:59,756 INFO L225 Difference]: With dead ends: 1742 [2018-11-18 12:29:59,756 INFO L226 Difference]: Without dead ends: 1240 [2018-11-18 12:29:59,759 INFO L604 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-18 12:29:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2018-11-18 12:29:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2018-11-18 12:29:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-11-18 12:29:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1869 transitions. [2018-11-18 12:29:59,795 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1869 transitions. Word has length 109 [2018-11-18 12:29:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:29:59,795 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1869 transitions. [2018-11-18 12:29:59,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:29:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1869 transitions. [2018-11-18 12:29:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-18 12:29:59,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:29:59,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:29:59,800 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:29:59,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:29:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -883752961, now seen corresponding path program 1 times [2018-11-18 12:29:59,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:29:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:29:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:59,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:29:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:29:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:29:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:29:59,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:29:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:29:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:29:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:29:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:29:59,998 INFO L87 Difference]: Start difference. First operand 1240 states and 1869 transitions. Second operand 6 states. [2018-11-18 12:30:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:00,789 INFO L93 Difference]: Finished difference Result 2759 states and 4120 transitions. [2018-11-18 12:30:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:30:00,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-11-18 12:30:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:00,797 INFO L225 Difference]: With dead ends: 2759 [2018-11-18 12:30:00,797 INFO L226 Difference]: Without dead ends: 1525 [2018-11-18 12:30:00,803 INFO L604 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-18 12:30:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-11-18 12:30:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1485. [2018-11-18 12:30:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-11-18 12:30:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2034 transitions. [2018-11-18 12:30:00,838 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2034 transitions. Word has length 166 [2018-11-18 12:30:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:00,838 INFO L480 AbstractCegarLoop]: Abstraction has 1485 states and 2034 transitions. [2018-11-18 12:30:00,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:30:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2034 transitions. [2018-11-18 12:30:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 12:30:00,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:00,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:30:00,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:00,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash 752941163, now seen corresponding path program 1 times [2018-11-18 12:30:00,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:00,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:00,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:00,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:30:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:30:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:30:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:30:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:30:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:30:00,992 INFO L87 Difference]: Start difference. First operand 1485 states and 2034 transitions. Second operand 6 states. [2018-11-18 12:30:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:01,553 INFO L93 Difference]: Finished difference Result 3547 states and 5008 transitions. [2018-11-18 12:30:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:30:01,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-11-18 12:30:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:01,563 INFO L225 Difference]: With dead ends: 3547 [2018-11-18 12:30:01,563 INFO L226 Difference]: Without dead ends: 2068 [2018-11-18 12:30:01,569 INFO L604 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-18 12:30:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2018-11-18 12:30:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2051. [2018-11-18 12:30:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2018-11-18 12:30:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2018-11-18 12:30:01,620 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 172 [2018-11-18 12:30:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:01,621 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2018-11-18 12:30:01,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:30:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2018-11-18 12:30:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-18 12:30:01,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:01,629 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 12:30:01,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:01,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1320084340, now seen corresponding path program 1 times [2018-11-18 12:30:01,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:01,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-18 12:30:01,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:01,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:01,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 122 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:30:02,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:30:02,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-18 12:30:02,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 12:30:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:30:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:30:02,054 INFO L87 Difference]: Start difference. First operand 2051 states and 2708 transitions. Second operand 11 states. [2018-11-18 12:30:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:04,200 INFO L93 Difference]: Finished difference Result 5282 states and 7182 transitions. [2018-11-18 12:30:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 12:30:04,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 246 [2018-11-18 12:30:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:04,207 INFO L225 Difference]: With dead ends: 5282 [2018-11-18 12:30:04,208 INFO L226 Difference]: Without dead ends: 1645 [2018-11-18 12:30:04,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 253 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-18 12:30:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2018-11-18 12:30:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1200. [2018-11-18 12:30:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-18 12:30:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1360 transitions. [2018-11-18 12:30:04,254 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1360 transitions. Word has length 246 [2018-11-18 12:30:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:04,255 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1360 transitions. [2018-11-18 12:30:04,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 12:30:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1360 transitions. [2018-11-18 12:30:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 12:30:04,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:04,259 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 12:30:04,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:04,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1377879184, now seen corresponding path program 1 times [2018-11-18 12:30:04,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:04,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 118 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:30:04,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:04,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:04,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 12:30:05,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:30:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 16 [2018-11-18 12:30:05,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:30:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:30:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:30:05,203 INFO L87 Difference]: Start difference. First operand 1200 states and 1360 transitions. Second operand 16 states. [2018-11-18 12:30:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:08,502 INFO L93 Difference]: Finished difference Result 4224 states and 5030 transitions. [2018-11-18 12:30:08,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 12:30:08,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2018-11-18 12:30:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:08,509 INFO L225 Difference]: With dead ends: 4224 [2018-11-18 12:30:08,509 INFO L226 Difference]: Without dead ends: 2640 [2018-11-18 12:30:08,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=674, Invalid=1876, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 12:30:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-11-18 12:30:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2229. [2018-11-18 12:30:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2229 states. [2018-11-18 12:30:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 2503 transitions. [2018-11-18 12:30:08,548 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 2503 transitions. Word has length 260 [2018-11-18 12:30:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:08,548 INFO L480 AbstractCegarLoop]: Abstraction has 2229 states and 2503 transitions. [2018-11-18 12:30:08,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:30:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2503 transitions. [2018-11-18 12:30:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-18 12:30:08,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:08,552 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:30:08,553 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:08,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash -827909397, now seen corresponding path program 1 times [2018-11-18 12:30:08,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:08,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 144 proven. 140 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:30:08,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:08,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:08,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 12:30:09,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:30:09,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-18 12:30:09,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:30:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:30:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:30:09,050 INFO L87 Difference]: Start difference. First operand 2229 states and 2503 transitions. Second operand 16 states. [2018-11-18 12:30:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:13,117 INFO L93 Difference]: Finished difference Result 5753 states and 7247 transitions. [2018-11-18 12:30:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-18 12:30:13,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 292 [2018-11-18 12:30:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:13,133 INFO L225 Difference]: With dead ends: 5753 [2018-11-18 12:30:13,133 INFO L226 Difference]: Without dead ends: 3674 [2018-11-18 12:30:13,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=775, Invalid=3781, Unknown=0, NotChecked=0, Total=4556 [2018-11-18 12:30:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-11-18 12:30:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3256. [2018-11-18 12:30:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2018-11-18 12:30:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 3793 transitions. [2018-11-18 12:30:13,252 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 3793 transitions. Word has length 292 [2018-11-18 12:30:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:13,253 INFO L480 AbstractCegarLoop]: Abstraction has 3256 states and 3793 transitions. [2018-11-18 12:30:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:30:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 3793 transitions. [2018-11-18 12:30:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-18 12:30:13,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:13,262 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 12:30:13,263 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:13,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1909871111, now seen corresponding path program 1 times [2018-11-18 12:30:13,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:13,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:13,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:13,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:13,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 44 proven. 124 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 12:30:13,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:13,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:13,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:13,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 12:30:13,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:30:13,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-18 12:30:13,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:30:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:30:13,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:30:13,618 INFO L87 Difference]: Start difference. First operand 3256 states and 3793 transitions. Second operand 6 states. [2018-11-18 12:30:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:14,252 INFO L93 Difference]: Finished difference Result 6292 states and 7320 transitions. [2018-11-18 12:30:14,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:30:14,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2018-11-18 12:30:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:14,262 INFO L225 Difference]: With dead ends: 6292 [2018-11-18 12:30:14,262 INFO L226 Difference]: Without dead ends: 3330 [2018-11-18 12:30:14,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:30:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2018-11-18 12:30:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3189. [2018-11-18 12:30:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-11-18 12:30:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 3687 transitions. [2018-11-18 12:30:14,353 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 3687 transitions. Word has length 295 [2018-11-18 12:30:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:14,353 INFO L480 AbstractCegarLoop]: Abstraction has 3189 states and 3687 transitions. [2018-11-18 12:30:14,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:30:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3687 transitions. [2018-11-18 12:30:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-18 12:30:14,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:14,362 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-18 12:30:14,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:14,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1643407787, now seen corresponding path program 1 times [2018-11-18 12:30:14,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:14,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:14,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 44 proven. 126 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 12:30:14,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:14,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:14,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 12:30:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:30:14,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-18 12:30:14,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:30:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:30:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:30:14,689 INFO L87 Difference]: Start difference. First operand 3189 states and 3687 transitions. Second operand 9 states. [2018-11-18 12:30:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:15,325 INFO L93 Difference]: Finished difference Result 5568 states and 6333 transitions. [2018-11-18 12:30:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:30:15,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2018-11-18 12:30:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:15,330 INFO L225 Difference]: With dead ends: 5568 [2018-11-18 12:30:15,330 INFO L226 Difference]: Without dead ends: 2981 [2018-11-18 12:30:15,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:30:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2018-11-18 12:30:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2827. [2018-11-18 12:30:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2018-11-18 12:30:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3116 transitions. [2018-11-18 12:30:15,370 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3116 transitions. Word has length 297 [2018-11-18 12:30:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:15,370 INFO L480 AbstractCegarLoop]: Abstraction has 2827 states and 3116 transitions. [2018-11-18 12:30:15,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:30:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3116 transitions. [2018-11-18 12:30:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-18 12:30:15,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:30:15,374 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 12:30:15,375 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:30:15,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:30:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1133583438, now seen corresponding path program 1 times [2018-11-18 12:30:15,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:30:15,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:30:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:15,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:15,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:30:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 219 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 12:30:15,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:30:15,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:30:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:30:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:30:15,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:30:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-11-18 12:30:15,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:30:15,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2018-11-18 12:30:15,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 12:30:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 12:30:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:30:15,944 INFO L87 Difference]: Start difference. First operand 2827 states and 3116 transitions. Second operand 13 states. [2018-11-18 12:30:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:30:27,746 INFO L93 Difference]: Finished difference Result 6844 states and 7661 transitions. [2018-11-18 12:30:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 12:30:27,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-11-18 12:30:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:30:27,746 INFO L225 Difference]: With dead ends: 6844 [2018-11-18 12:30:27,746 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:30:27,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=1911, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 12:30:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:30:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:30:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:30:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:30:27,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2018-11-18 12:30:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:30:27,754 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:30:27,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 12:30:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:30:27,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:30:27,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:30:27,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:27,992 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 201 [2018-11-18 12:30:27,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 12:30:28,120 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 201 [2018-11-18 12:30:28,841 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 78 [2018-11-18 12:30:30,155 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 209 DAG size of output: 89 [2018-11-18 12:30:31,279 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 209 DAG size of output: 89 [2018-11-18 12:30:31,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:30:31,280 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-18 12:30:31,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-18 12:30:31,281 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-18 12:30:31,282 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-18 12:30:31,283 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-18 12:30:31,284 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-18 12:30:31,285 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-18 12:30:31,286 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,287 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,288 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-18 12:30:31,289 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-18 12:30:31,290 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse12 (= ~a19~0 |old(~a19~0)|)) (.cse13 (= |old(~a10~0)| ~a10~0)) (.cse9 (= 4 |old(~a10~0)|)) (.cse10 (= 10 |old(~a19~0)|)) (.cse8 (= 8 |old(~a19~0)|)) (.cse11 (= 1 |old(~a10~0)|))) (let ((.cse0 (or .cse9 .cse10 .cse8 .cse11)) (.cse7 (and (= |old(~a19~0)| ~a19~0) .cse13)) (.cse6 (< 8 |old(~a19~0)|)) (.cse3 (<= |old(~a1~0)| 218)) (.cse5 (= 3 |old(~a10~0)|)) (.cse4 (and (= ~a1~0 |old(~a1~0)|) .cse12 .cse13)) (.cse1 (not (= 14 ~a4~0))) (.cse2 (not (= 0 ~a12~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3) .cse4) (or .cse5 .cse4 .cse0 .cse1 .cse2) (or .cse6 .cse7 .cse8) (or .cse6 (= 2 |old(~a10~0)|) .cse7) (or (<= 592098 ~a1~0) .cse9 (< |old(~a1~0)| 592098) .cse10 .cse1 .cse2 .cse11) (or .cse1 .cse2 (not (= 9 |old(~a19~0)|)) .cse4) (or .cse9 .cse6 .cse1 .cse2 .cse11 .cse3 (and (< 218 ~a1~0) .cse12 .cse13)) (or .cse5 .cse9 .cse4 .cse10 (forall ((v_prenex_4 Int)) (let ((.cse15 (* 9 v_prenex_4))) (let ((.cse14 (div .cse15 10))) (or (< .cse14 0) (< (+ (mod .cse14 25) 12) |old(~a1~0)|) (< .cse15 0))))) .cse1 .cse2 (= 0 |old(~a10~0)|) .cse11) (or (not .cse11) .cse4 .cse1 .cse2 .cse8) (or .cse4 .cse1 .cse2 .cse8 (< 0 |old(~a10~0)|))))) [2018-11-18 12:30:31,290 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-18 12:30:31,290 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-18 12:30:31,290 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,295 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,296 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,297 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-18 12:30:31,298 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 23 ~a1~0) (<= ~a1~0 23) (not (= ~a19~0 10)) (not (= ~a19~0 8)) (= ~a12~0 0) (<= ~a10~0 0) (= ~a4~0 14)) [2018-11-18 12:30:31,299 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (< |old(~a1~0)| 23) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (= 8 |old(~a19~0)|) (< 23 |old(~a1~0)|) (< 0 |old(~a10~0)|) (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0))) [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse4 (not (= ~a10~0 1)))) (let ((.cse2 (= |old(~a19~0)| ~a19~0)) (.cse6 (not (= 2 ~a10~0))) (.cse9 (and (= 8 ~a19~0) (= |old(~a19~0)| 9) .cse4)) (.cse12 (< 218 ~a1~0)) (.cse7 (not (= ~a19~0 10))) (.cse5 (not (= ~a10~0 4))) (.cse1 (or (<= 219 |old(~a1~0)|) (= 0 |old(~a10~0)|) (<= (+ |old(~a1~0)| 13) 0))) (.cse3 (<= ~a19~0 8)) (.cse8 (not (= ~a19~0 8))) (.cse0 (= 9 |old(~a19~0)|))) (or (and .cse0 .cse1 (<= ~a10~0 0)) (< |old(~a1~0)| 23) (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (= 0 ~a12~0)) (and .cse1 (and .cse2 .cse0)) (< 23 |old(~a1~0)|) (and .cse3 .cse0 .cse6) (and (not (= ~a10~0 3)) (and .cse7 .cse8 .cse0 .cse5) .cse1) (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (and .cse9 (exists ((v_prenex_4 Int)) (let ((.cse11 (* 9 v_prenex_4))) (let ((.cse10 (div .cse11 10))) (and (<= ~a1~0 (+ (mod .cse10 25) 12)) (<= 0 .cse10) (<= 0 .cse11))))) .cse1) (and (= 1 ~a10~0) .cse0 .cse1) (and .cse12 .cse9) (and (and .cse12 .cse7 .cse0 .cse5) .cse1) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (< 0 |old(~a10~0)|) (and .cse3 .cse8 .cse0)))) [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-18 12:30:31,299 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-18 12:30:31,300 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse4 (not (= ~a10~0 1)))) (let ((.cse2 (= |old(~a19~0)| ~a19~0)) (.cse6 (not (= 2 ~a10~0))) (.cse9 (and (= 8 ~a19~0) (= |old(~a19~0)| 9) .cse4)) (.cse12 (< 218 ~a1~0)) (.cse7 (not (= ~a19~0 10))) (.cse5 (not (= ~a10~0 4))) (.cse1 (or (<= 219 |old(~a1~0)|) (= 0 |old(~a10~0)|) (<= (+ |old(~a1~0)| 13) 0))) (.cse3 (<= ~a19~0 8)) (.cse8 (not (= ~a19~0 8))) (.cse0 (= 9 |old(~a19~0)|))) (or (and .cse0 .cse1 (<= ~a10~0 0)) (< |old(~a1~0)| 23) (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (= 0 ~a12~0)) (and .cse1 (and .cse2 .cse0)) (< 23 |old(~a1~0)|) (and .cse3 .cse0 .cse6) (and (not (= ~a10~0 3)) (and .cse7 .cse8 .cse0 .cse5) .cse1) (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (and .cse9 (exists ((v_prenex_4 Int)) (let ((.cse11 (* 9 v_prenex_4))) (let ((.cse10 (div .cse11 10))) (and (<= ~a1~0 (+ (mod .cse10 25) 12)) (<= 0 .cse10) (<= 0 .cse11))))) .cse1) (and (= 1 ~a10~0) .cse0 .cse1) (and .cse12 .cse9) (and (and .cse12 .cse7 .cse0 .cse5) .cse1) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (< 0 |old(~a10~0)|) (and .cse3 .cse8 .cse0)))) [2018-11-18 12:30:31,300 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-18 12:30:31,309 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:30:31 BoogieIcfgContainer [2018-11-18 12:30:31,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:30:31,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:30:31,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:30:31,321 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:30:31,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:29:57" (3/4) ... [2018-11-18 12:30:31,324 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 12:30:31,330 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 12:30:31,330 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-18 12:30:31,331 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 12:30:31,343 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 12:30:31,344 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 12:30:31,365 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((9 == \old(a19) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0)) && a10 <= 0) || \old(a1) < 23) || ((((\old(a19) == a19 && a19 <= 8) && !(a10 == 1)) && !(a10 == 4)) && !(2 == a10))) || !(0 == a12)) || (((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0) && \old(a19) == a19 && 9 == \old(a19))) || 23 < \old(a1)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || ((!(a10 == 3) && ((!(a19 == 10) && !(a19 == 8)) && 9 == \old(a19)) && !(a10 == 4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || ((a1 == \old(a1) && a19 == \old(a19)) && \old(a10) == a10)) || ((((8 == a19 && \old(a19) == 9) && !(a10 == 1)) && (\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || ((1 == a10 && 9 == \old(a19)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || (218 < a1 && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || ((((218 < a1 && !(a19 == 10)) && 9 == \old(a19)) && !(a10 == 4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || 0 < \old(a10)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19)) [2018-11-18 12:30:31,434 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_47115797-260e-4192-85e6-936f34b68b53/bin-2019/uautomizer/witness.graphml [2018-11-18 12:30:31,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:30:31,435 INFO L168 Benchmark]: Toolchain (without parser) took 35478.74 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 800.1 MB). Free memory was 952.3 MB in the beginning and 1.5 GB in the end (delta: -585.5 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,436 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:30:31,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 920.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,436 INFO L168 Benchmark]: Boogie Preprocessor took 112.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 920.0 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,436 INFO L168 Benchmark]: RCFGBuilder took 905.98 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: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,436 INFO L168 Benchmark]: TraceAbstraction took 33999.61 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 658.5 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -537.4 MB). Peak memory consumption was 814.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,437 INFO L168 Benchmark]: Witness Printer took 113.82 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:30:31,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 920.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 920.0 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 905.98 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: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33999.61 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 658.5 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -537.4 MB). Peak memory consumption was 814.6 MB. Max. memory is 11.5 GB. * Witness Printer took 113.82 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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-18 12:30:31,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-11-18 12:30:31,445 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: ((((((((((((((((((9 == \old(a19) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0)) && a10 <= 0) || \old(a1) < 23) || ((((\old(a19) == a19 && a19 <= 8) && !(a10 == 1)) && !(a10 == 4)) && !(2 == a10))) || !(0 == a12)) || (((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0) && \old(a19) == a19 && 9 == \old(a19))) || 23 < \old(a1)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || ((!(a10 == 3) && ((!(a19 == 10) && !(a19 == 8)) && 9 == \old(a19)) && !(a10 == 4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || ((a1 == \old(a1) && a19 == \old(a19)) && \old(a10) == a10)) || ((((8 == a19 && \old(a19) == 9) && !(a10 == 1)) && (\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || ((1 == a10 && 9 == \old(a19)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || (218 < a1 && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || ((((218 < a1 && !(a19 == 10)) && 9 == \old(a19)) && !(a10 == 4)) && ((219 <= \old(a1) || 0 == \old(a10)) || \old(a1) + 13 <= 0))) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || 0 < \old(a10)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 25.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 899 SDtfs, 13805 SDslu, 1946 SDs, 0 SdLazy, 26311 SolverSat, 4228 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1795 SyntacticMatches, 16 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3256occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1635 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 222 PreInvPairs, 334 NumberOfFragments, 892 HoareAnnotationTreeSize, 222 FomulaSimplifications, 25077 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13435 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3969 NumberOfCodeBlocks, 3969 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3952 ConstructedInterpolants, 25 QuantifiedInterpolants, 5255972 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2817 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 1932/2468 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...