./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-635dfa2 [2018-12-09 00:11:12,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:11:12,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:11:12,361 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:11:12,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:11:12,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:11:12,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:11:12,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:11:12,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:11:12,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:11:12,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:11:12,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:11:12,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:11:12,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:11:12,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:11:12,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:11:12,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:11:12,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:11:12,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:11:12,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:11:12,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:11:12,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:11:12,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:11:12,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:11:12,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:11:12,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:11:12,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:11:12,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:11:12,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:11:12,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:11:12,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:11:12,379 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:11:12,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:11:12,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:11:12,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:11:12,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:11:12,381 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:11:12,391 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:11:12,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:11:12,391 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:11:12,391 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:11:12,392 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:11:12,392 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:11:12,392 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:11:12,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:11:12,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:11:12,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:11:12,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:11:12,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:11:12,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:11:12,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:11:12,395 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_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:12,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:11:12,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:11:12,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:11:12,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:11:12,426 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:11:12,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-12-09 00:11:12,458 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/data/04531763c/d1f09800cdc74b4ab6f19d3b02686c9c/FLAGeab12fb21 [2018-12-09 00:11:12,860 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:11:12,861 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/sv-benchmarks/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2018-12-09 00:11:12,868 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/data/04531763c/d1f09800cdc74b4ab6f19d3b02686c9c/FLAGeab12fb21 [2018-12-09 00:11:12,877 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/data/04531763c/d1f09800cdc74b4ab6f19d3b02686c9c [2018-12-09 00:11:12,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:11:12,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:11:12,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:11:12,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:11:12,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:11:12,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:11:12" (1/1) ... [2018-12-09 00:11:12,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d3ace8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:12, skipping insertion in model container [2018-12-09 00:11:12,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:11:12" (1/1) ... [2018-12-09 00:11:12,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:11:12,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:11:13,091 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:11:13,093 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:11:13,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:11:13,204 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:11:13,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13 WrapperNode [2018-12-09 00:11:13,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:11:13,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:11:13,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:11:13,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:11:13,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:11:13,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:11:13,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:11:13,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:11:13,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... [2018-12-09 00:11:13,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:11:13,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:11:13,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:11:13,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:11:13,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:13,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:11:13,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:11:13,300 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 00:11:13,301 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 00:11:13,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:11:13,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:11:13,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:11:13,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:11:13,904 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:11:13,904 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:11:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:13 BoogieIcfgContainer [2018-12-09 00:11:13,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:11:13,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:11:13,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:11:13,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:11:13,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:11:12" (1/3) ... [2018-12-09 00:11:13,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c3395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:11:13, skipping insertion in model container [2018-12-09 00:11:13,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:13" (2/3) ... [2018-12-09 00:11:13,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c3395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:11:13, skipping insertion in model container [2018-12-09 00:11:13,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:13" (3/3) ... [2018-12-09 00:11:13,910 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2018-12-09 00:11:13,916 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:11:13,921 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:11:13,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:11:13,950 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:11:13,951 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:11:13,951 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:11:13,951 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:11:13,951 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:11:13,951 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:11:13,951 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:11:13,951 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:11:13,952 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:11:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-12-09 00:11:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:11:13,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:13,969 INFO L402 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] [2018-12-09 00:11:13,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:13,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1605828193, now seen corresponding path program 1 times [2018-12-09 00:11:13,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:14,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:14,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:14,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:14,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:11:14,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:11:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:11:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:11:14,129 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-12-09 00:11:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:14,654 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2018-12-09 00:11:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:11:14,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:11:14,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:14,664 INFO L225 Difference]: With dead ends: 571 [2018-12-09 00:11:14,664 INFO L226 Difference]: Without dead ends: 294 [2018-12-09 00:11:14,667 INFO L631 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-12-09 00:11:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-09 00:11:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-09 00:11:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-09 00:11:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2018-12-09 00:11:14,711 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 28 [2018-12-09 00:11:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:14,711 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2018-12-09 00:11:14,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:11:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2018-12-09 00:11:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 00:11:14,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:14,713 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:14,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:14,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -351220503, now seen corresponding path program 1 times [2018-12-09 00:11:14,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:14,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:14,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:11:14,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:11:14,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:11:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:11:14,832 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 6 states. [2018-12-09 00:11:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:15,262 INFO L93 Difference]: Finished difference Result 741 states and 1136 transitions. [2018-12-09 00:11:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:11:15,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-09 00:11:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:15,264 INFO L225 Difference]: With dead ends: 741 [2018-12-09 00:11:15,264 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 00:11:15,265 INFO L631 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-12-09 00:11:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 00:11:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2018-12-09 00:11:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-09 00:11:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 626 transitions. [2018-12-09 00:11:15,281 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 626 transitions. Word has length 101 [2018-12-09 00:11:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:15,281 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 626 transitions. [2018-12-09 00:11:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:11:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 626 transitions. [2018-12-09 00:11:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 00:11:15,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:15,283 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:15,283 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:15,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 788107453, now seen corresponding path program 1 times [2018-12-09 00:11:15,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:15,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:15,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:11:15,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:11:15,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:11:15,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:11:15,338 INFO L87 Difference]: Start difference. First operand 445 states and 626 transitions. Second operand 4 states. [2018-12-09 00:11:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:15,830 INFO L93 Difference]: Finished difference Result 1611 states and 2315 transitions. [2018-12-09 00:11:15,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:11:15,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 00:11:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:15,834 INFO L225 Difference]: With dead ends: 1611 [2018-12-09 00:11:15,834 INFO L226 Difference]: Without dead ends: 1172 [2018-12-09 00:11:15,835 INFO L631 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-12-09 00:11:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-12-09 00:11:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2018-12-09 00:11:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2018-12-09 00:11:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1554 transitions. [2018-12-09 00:11:15,860 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1554 transitions. Word has length 107 [2018-12-09 00:11:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:15,861 INFO L480 AbstractCegarLoop]: Abstraction has 1172 states and 1554 transitions. [2018-12-09 00:11:15,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:11:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1554 transitions. [2018-12-09 00:11:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 00:11:15,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:15,864 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:15,864 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:15,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:15,864 INFO L82 PathProgramCache]: Analyzing trace with hash 58557854, now seen corresponding path program 1 times [2018-12-09 00:11:15,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:15,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:15,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:15,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:15,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:15,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:15,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:11:15,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:11:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:11:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:11:15,973 INFO L87 Difference]: Start difference. First operand 1172 states and 1554 transitions. Second operand 6 states. [2018-12-09 00:11:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:16,419 INFO L93 Difference]: Finished difference Result 2372 states and 3192 transitions. [2018-12-09 00:11:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:11:16,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-12-09 00:11:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:16,425 INFO L225 Difference]: With dead ends: 2372 [2018-12-09 00:11:16,425 INFO L226 Difference]: Without dead ends: 1206 [2018-12-09 00:11:16,427 INFO L631 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-12-09 00:11:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-12-09 00:11:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1051. [2018-12-09 00:11:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-12-09 00:11:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1334 transitions. [2018-12-09 00:11:16,454 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1334 transitions. Word has length 164 [2018-12-09 00:11:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:16,455 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 1334 transitions. [2018-12-09 00:11:16,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:11:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1334 transitions. [2018-12-09 00:11:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 00:11:16,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:16,457 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:16,458 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:16,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1560592178, now seen corresponding path program 1 times [2018-12-09 00:11:16,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:16,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:16,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:16,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:16,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:11:16,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:11:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:11:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:11:16,627 INFO L87 Difference]: Start difference. First operand 1051 states and 1334 transitions. Second operand 6 states. [2018-12-09 00:11:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:17,055 INFO L93 Difference]: Finished difference Result 2400 states and 3096 transitions. [2018-12-09 00:11:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:11:17,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-12-09 00:11:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:17,060 INFO L225 Difference]: With dead ends: 2400 [2018-12-09 00:11:17,060 INFO L226 Difference]: Without dead ends: 1355 [2018-12-09 00:11:17,063 INFO L631 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-12-09 00:11:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-12-09 00:11:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1200. [2018-12-09 00:11:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-12-09 00:11:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1479 transitions. [2018-12-09 00:11:17,094 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1479 transitions. Word has length 170 [2018-12-09 00:11:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:17,095 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1479 transitions. [2018-12-09 00:11:17,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:11:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1479 transitions. [2018-12-09 00:11:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-09 00:11:17,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:17,099 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:17,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:17,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash -226216260, now seen corresponding path program 1 times [2018-12-09 00:11:17,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:17,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:17,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:17,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-09 00:11:17,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:17,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:17,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:17,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:17,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-09 00:11:17,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:11:17,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:11:17,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:11:17,410 INFO L87 Difference]: Start difference. First operand 1200 states and 1479 transitions. Second operand 11 states. [2018-12-09 00:11:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:18,863 INFO L93 Difference]: Finished difference Result 3856 states and 4798 transitions. [2018-12-09 00:11:18,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:11:18,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2018-12-09 00:11:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:18,867 INFO L225 Difference]: With dead ends: 3856 [2018-12-09 00:11:18,867 INFO L226 Difference]: Without dead ends: 1629 [2018-12-09 00:11:18,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:11:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-12-09 00:11:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1190. [2018-12-09 00:11:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2018-12-09 00:11:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1345 transitions. [2018-12-09 00:11:18,891 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1345 transitions. Word has length 243 [2018-12-09 00:11:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:18,891 INFO L480 AbstractCegarLoop]: Abstraction has 1190 states and 1345 transitions. [2018-12-09 00:11:18,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:11:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1345 transitions. [2018-12-09 00:11:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 00:11:18,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:18,895 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:18,895 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:18,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1054824384, now seen corresponding path program 1 times [2018-12-09 00:11:18,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 120 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:19,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:19,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:19,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:19,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 00:11:19,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:19,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 17 [2018-12-09 00:11:19,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:11:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:11:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:11:19,564 INFO L87 Difference]: Start difference. First operand 1190 states and 1345 transitions. Second operand 17 states. [2018-12-09 00:11:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:20,995 INFO L93 Difference]: Finished difference Result 2286 states and 2658 transitions. [2018-12-09 00:11:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 00:11:20,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 257 [2018-12-09 00:11:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:20,998 INFO L225 Difference]: With dead ends: 2286 [2018-12-09 00:11:20,998 INFO L226 Difference]: Without dead ends: 1234 [2018-12-09 00:11:21,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 257 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:11:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2018-12-09 00:11:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1192. [2018-12-09 00:11:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-12-09 00:11:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1332 transitions. [2018-12-09 00:11:21,019 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1332 transitions. Word has length 257 [2018-12-09 00:11:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:21,019 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1332 transitions. [2018-12-09 00:11:21,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:11:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1332 transitions. [2018-12-09 00:11:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-09 00:11:21,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:21,022 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-12-09 00:11:21,022 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:21,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:21,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2088165964, now seen corresponding path program 1 times [2018-12-09 00:11:21,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:21,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:21,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 00:11:21,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:21,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:21,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:21,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-09 00:11:21,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:21,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-12-09 00:11:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:11:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:11:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:11:21,299 INFO L87 Difference]: Start difference. First operand 1192 states and 1332 transitions. Second operand 10 states. [2018-12-09 00:11:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:23,715 INFO L93 Difference]: Finished difference Result 5350 states and 6236 transitions. [2018-12-09 00:11:23,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 00:11:23,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 279 [2018-12-09 00:11:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:23,728 INFO L225 Difference]: With dead ends: 5350 [2018-12-09 00:11:23,728 INFO L226 Difference]: Without dead ends: 4162 [2018-12-09 00:11:23,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:11:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2018-12-09 00:11:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2966. [2018-12-09 00:11:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-12-09 00:11:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 3266 transitions. [2018-12-09 00:11:23,799 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 3266 transitions. Word has length 279 [2018-12-09 00:11:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:23,799 INFO L480 AbstractCegarLoop]: Abstraction has 2966 states and 3266 transitions. [2018-12-09 00:11:23,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:11:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 3266 transitions. [2018-12-09 00:11:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-09 00:11:23,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:23,803 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:23,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:23,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1534802932, now seen corresponding path program 1 times [2018-12-09 00:11:23,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:23,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:23,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:23,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:23,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 140 proven. 138 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:11:24,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:24,008 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:24,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 209 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-09 00:11:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:24,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-12-09 00:11:24,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 00:11:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:11:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:11:24,194 INFO L87 Difference]: Start difference. First operand 2966 states and 3266 transitions. Second operand 16 states. [2018-12-09 00:11:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:27,573 INFO L93 Difference]: Finished difference Result 7355 states and 8989 transitions. [2018-12-09 00:11:27,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-09 00:11:27,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 288 [2018-12-09 00:11:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:27,584 INFO L225 Difference]: With dead ends: 7355 [2018-12-09 00:11:27,584 INFO L226 Difference]: Without dead ends: 4395 [2018-12-09 00:11:27,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=722, Invalid=3568, Unknown=0, NotChecked=0, Total=4290 [2018-12-09 00:11:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2018-12-09 00:11:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4011. [2018-12-09 00:11:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4011 states. [2018-12-09 00:11:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 4423 transitions. [2018-12-09 00:11:27,667 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 4423 transitions. Word has length 288 [2018-12-09 00:11:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:27,667 INFO L480 AbstractCegarLoop]: Abstraction has 4011 states and 4423 transitions. [2018-12-09 00:11:27,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 00:11:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 4423 transitions. [2018-12-09 00:11:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-09 00:11:27,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:27,673 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:11:27,673 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:11:27,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -420751923, now seen corresponding path program 1 times [2018-12-09 00:11:27,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:27,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 215 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:11:27,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:27,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/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-12-09 00:11:27,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:27,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:28,136 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2018-12-09 00:11:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-09 00:11:28,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:28,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2018-12-09 00:11:28,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:11:28,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:11:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:11:28,206 INFO L87 Difference]: Start difference. First operand 4011 states and 4423 transitions. Second operand 13 states. [2018-12-09 00:11:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:33,411 INFO L93 Difference]: Finished difference Result 8484 states and 9716 transitions. [2018-12-09 00:11:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 00:11:33,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 301 [2018-12-09 00:11:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:33,412 INFO L225 Difference]: With dead ends: 8484 [2018-12-09 00:11:33,412 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:11:33,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=1775, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 00:11:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:11:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:11:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:11:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:11:33,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 301 [2018-12-09 00:11:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:33,421 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:11:33,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:11:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:11:33,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:11:33,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:11:33,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,959 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 439 DAG size of output: 346 [2018-12-09 00:11:33,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:33,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:11:34,309 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 439 DAG size of output: 346 [2018-12-09 00:11:35,632 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 259 DAG size of output: 85 [2018-12-09 00:11:41,852 WARN L180 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 351 DAG size of output: 84 [2018-12-09 00:11:47,656 WARN L180 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 351 DAG size of output: 84 [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L444 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-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-12-09 00:11:47,658 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-09 00:11:47,659 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-12-09 00:11:47,660 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,661 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,662 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,663 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-12-09 00:11:47,664 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse12 (= ~a1~0 |old(~a1~0)|)) (.cse2 (= ~a19~0 |old(~a19~0)|)) (.cse6 (= 4 |old(~a10~0)|)) (.cse13 (= 10 |old(~a19~0)|)) (.cse0 (= 8 |old(~a19~0)|)) (.cse3 (= |old(~a10~0)| ~a10~0))) (let ((.cse11 (= 1 |old(~a10~0)|)) (.cse9 (= 0 |old(~a10~0)|)) (.cse7 (< 8 |old(~a19~0)|)) (.cse14 (and (= |old(~a19~0)| ~a19~0) .cse3)) (.cse15 (or .cse6 .cse13 .cse0)) (.cse8 (forall ((v_prenex_4 Int)) (let ((.cse17 (* 9 v_prenex_4))) (let ((.cse16 (div .cse17 10))) (or (< .cse16 0) (< (+ (mod .cse16 25) 12) |old(~a1~0)|) (< .cse17 0)))))) (.cse1 (not (= 14 ~a4~0))) (.cse4 (not (= 0 ~a12~0))) (.cse5 (= 2 |old(~a10~0)|)) (.cse10 (and .cse12 .cse2 .cse3))) (and (or (not .cse0) (< |old(~a1~0)| 592098) .cse1 (and (<= 592098 ~a1~0) .cse2 .cse3) .cse4 (not .cse5)) (or .cse6 .cse7 .cse8 .cse1 .cse4 .cse9 .cse10 .cse11) (or .cse6 .cse12 (< 0 (+ |old(~a1~0)| 437977)) .cse13 .cse1 .cse4 .cse11) (or (and .cse2 .cse3 .cse12) (or (not .cse11) .cse1 .cse4 .cse0)) (or (or .cse6 .cse13 .cse1 .cse4 .cse5 .cse0) .cse10 .cse9) (or .cse10 .cse1 .cse4 (not (= 9 |old(~a19~0)|)) .cse5) (or .cse7 .cse14 .cse0) (or .cse5 .cse7 .cse14) (or .cse15 .cse8 .cse1 .cse4 .cse10) (or (or .cse15 .cse1 .cse4 (<= |old(~a1~0)| 218)) (and (and .cse2 .cse3) .cse12)) (or .cse6 .cse8 .cse1 .cse4 .cse5 .cse0 .cse10)))) [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-09 00:11:47,665 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-09 00:11:47,666 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-12-09 00:11:47,667 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:11:47,668 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 23 ~a1~0) (not (= ~a19~0 10)) (not (= ~a19~0 8)) (= ~a12~0 0) (exists ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (and (<= ~a1~0 (+ (mod .cse0 25) 12)) (<= 0 .cse0) (<= 0 .cse1))))) (not (= ~a10~0 1)) (= ~a4~0 14) (not (= ~a10~0 4)) (not (= 2 ~a10~0))) [2018-12-09 00:11:47,668 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:11:47,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:11:47,668 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (= 4 |old(~a10~0)|) (and (= ~a1~0 |old(~a1~0)|) (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0)) (< |old(~a1~0)| 23) (= 10 |old(~a19~0)|) (forall ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (or (< .cse0 0) (< (+ (mod .cse0 25) 12) |old(~a1~0)|) (< .cse1 0))))) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (= 2 |old(~a10~0)|) (= 8 |old(~a19~0)|) (= 1 |old(~a10~0)|)) [2018-12-09 00:11:47,668 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-12-09 00:11:47,668 INFO L444 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse5 (= |old(~a19~0)| 9)) (.cse9 (not (= ~a19~0 8))) (.cse7 (= 9 |old(~a19~0)|)) (.cse10 (not (= ~a10~0 4)))) (let ((.cse4 (and (not (= ~a19~0 10)) .cse9 (= ~a12~0 0) .cse7 .cse10)) (.cse2 (and (= 8 ~a19~0) .cse5 (not (= ~a10~0 1)))) (.cse6 (<= ~a19~0 8)) (.cse3 (exists ((v_prenex_4 Int)) (let ((.cse12 (* 9 v_prenex_4))) (let ((.cse11 (div .cse12 10))) (and (<= ~a1~0 (+ (mod .cse11 25) 12)) (<= 0 .cse11) (<= 0 .cse12)))))) (.cse8 (not (= 2 ~a10~0)))) (or (< |old(~a1~0)| 23) (forall ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (or (< .cse0 0) (< (+ (mod .cse0 25) 12) |old(~a1~0)|) (< .cse1 0))))) (and (<= 592098 ~a1~0) .cse2) (not (= 0 ~a12~0)) (and .cse3 .cse4) (and (< 218 ~a1~0) .cse4) (and (= 1 ~a10~0) .cse5) (= 4 |old(~a10~0)|) (and .cse6 .cse7 .cse8) (and .cse3 .cse2) (or (and (= |old(~a19~0)| ~a19~0) .cse7 .cse8) (and (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a1~0 |old(~a1~0)|))) (= 2 |old(~a10~0)|) (= 1 |old(~a10~0)|) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (and .cse6 .cse9 .cse7) (and .cse3 .cse7 .cse10 .cse8)))) [2018-12-09 00:11:47,668 INFO L448 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-12-09 00:11:47,668 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-12-09 00:11:47,669 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse5 (= |old(~a19~0)| 9)) (.cse9 (not (= ~a19~0 8))) (.cse7 (= 9 |old(~a19~0)|)) (.cse10 (not (= ~a10~0 4)))) (let ((.cse4 (and (not (= ~a19~0 10)) .cse9 (= ~a12~0 0) .cse7 .cse10)) (.cse2 (and (= 8 ~a19~0) .cse5 (not (= ~a10~0 1)))) (.cse6 (<= ~a19~0 8)) (.cse3 (exists ((v_prenex_4 Int)) (let ((.cse12 (* 9 v_prenex_4))) (let ((.cse11 (div .cse12 10))) (and (<= ~a1~0 (+ (mod .cse11 25) 12)) (<= 0 .cse11) (<= 0 .cse12)))))) (.cse8 (not (= 2 ~a10~0)))) (or (< |old(~a1~0)| 23) (forall ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (or (< .cse0 0) (< (+ (mod .cse0 25) 12) |old(~a1~0)|) (< .cse1 0))))) (and (<= 592098 ~a1~0) .cse2) (not (= 0 ~a12~0)) (and .cse3 .cse4) (and (< 218 ~a1~0) .cse4) (and (= 1 ~a10~0) .cse5) (= 4 |old(~a10~0)|) (and .cse6 .cse7 .cse8) (and .cse3 .cse2) (or (and (= |old(~a19~0)| ~a19~0) .cse7 .cse8) (and (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a1~0 |old(~a1~0)|))) (= 2 |old(~a10~0)|) (= 1 |old(~a10~0)|) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|) (and .cse6 .cse9 .cse7) (and .cse3 .cse7 .cse10 .cse8)))) [2018-12-09 00:11:47,669 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 576 592) no Hoare annotation was computed. [2018-12-09 00:11:47,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,677 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,687 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:11:47 BoogieIcfgContainer [2018-12-09 00:11:47,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:11:47,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:11:47,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:11:47,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:11:47,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:13" (3/4) ... [2018-12-09 00:11:47,694 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:11:47,701 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:11:47,701 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-09 00:11:47,701 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:11:47,710 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 00:11:47,711 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 00:11:47,736 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\old(a1) < 23 || (forall v_prenex_4 : int :: (9 * v_prenex_4 / 10 < 0 || 9 * v_prenex_4 / 10 % 25 + 12 < \old(a1)) || 9 * v_prenex_4 < 0)) || (592098 <= a1 && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || !(0 == a12)) || ((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && (((!(a19 == 10) && !(a19 == 8)) && a12 == 0) && 9 == \old(a19)) && !(a10 == 4))) || (218 < a1 && (((!(a19 == 10) && !(a19 == 8)) && a12 == 0) && 9 == \old(a19)) && !(a10 == 4))) || (1 == a10 && \old(a19) == 9)) || 4 == \old(a10)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || ((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || ((\old(a19) == a19 && 9 == \old(a19)) && !(2 == a10)) || ((a10 == \old(a10) && a19 == \old(a19)) && a1 == \old(a1))) || 2 == \old(a10)) || 1 == \old(a10)) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19))) || ((((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && 9 == \old(a19)) && !(a10 == 4)) && !(2 == a10)) [2018-12-09 00:11:47,786 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_940795cc-ec49-4a2b-bb93-e42ac0151a03/bin-2019/uautomizer/witness.graphml [2018-12-09 00:11:47,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:11:47,786 INFO L168 Benchmark]: Toolchain (without parser) took 34907.57 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 698.4 MB). Free memory was 951.7 MB in the beginning and 1.5 GB in the end (delta: -507.2 MB). Peak memory consumption was 191.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: RCFGBuilder took 638.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.2 MB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,787 INFO L168 Benchmark]: TraceAbstraction took 33785.66 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 597.2 MB). Free memory was 977.2 MB in the beginning and 1.5 GB in the end (delta: -499.3 MB). Peak memory consumption was 712.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,788 INFO L168 Benchmark]: Witness Printer took 95.10 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:47,789 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 638.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.2 MB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33785.66 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 597.2 MB). Free memory was 977.2 MB in the beginning and 1.5 GB in the end (delta: -499.3 MB). Peak memory consumption was 712.6 MB. Max. memory is 11.5 GB. * Witness Printer took 95.10 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 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] - 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] - 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] - 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-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2018-12-09 00:11:47,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] Derived loop invariant: ((((((((((((((((\old(a1) < 23 || (forall v_prenex_4 : int :: (9 * v_prenex_4 / 10 < 0 || 9 * v_prenex_4 / 10 % 25 + 12 < \old(a1)) || 9 * v_prenex_4 < 0)) || (592098 <= a1 && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || !(0 == a12)) || ((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && (((!(a19 == 10) && !(a19 == 8)) && a12 == 0) && 9 == \old(a19)) && !(a10 == 4))) || (218 < a1 && (((!(a19 == 10) && !(a19 == 8)) && a12 == 0) && 9 == \old(a19)) && !(a10 == 4))) || (1 == a10 && \old(a19) == 9)) || 4 == \old(a10)) || ((a19 <= 8 && 9 == \old(a19)) && !(2 == a10))) || ((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && (8 == a19 && \old(a19) == 9) && !(a10 == 1))) || ((\old(a19) == a19 && 9 == \old(a19)) && !(2 == a10)) || ((a10 == \old(a10) && a19 == \old(a19)) && a1 == \old(a1))) || 2 == \old(a10)) || 1 == \old(a10)) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19)) || ((a19 <= 8 && !(a19 == 8)) && 9 == \old(a19))) || ((((\exists v_prenex_4 : int :: (a1 <= 9 * v_prenex_4 / 10 % 25 + 12 && 0 <= 9 * v_prenex_4 / 10) && 0 <= 9 * v_prenex_4) && 9 == \old(a19)) && !(a10 == 4)) && !(2 == a10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. SAFE Result, 33.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 388 SDtfs, 9195 SDslu, 1183 SDs, 0 SdLazy, 20413 SolverSat, 3493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 1458 SyntacticMatches, 15 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4011occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 2379 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 186 PreInvPairs, 360 NumberOfFragments, 1045 HoareAnnotationTreeSize, 186 FomulaSimplifications, 274071 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 118681 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3306 NumberOfCodeBlocks, 3306 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3291 ConstructedInterpolants, 24 QuantifiedInterpolants, 4755879 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1730/2046 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...