./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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 06d11383001c52cfbf19a51eafe2dc3d238c9679 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:13:37,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:13:37,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:13:37,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:13:37,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:13:37,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:13:37,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:13:37,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:13:37,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:13:37,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:13:37,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:13:37,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:13:37,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:13:37,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:13:37,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:13:37,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:13:37,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:13:37,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:13:37,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:13:37,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:13:37,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:13:37,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:13:37,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:13:37,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:13:37,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:13:37,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:13:37,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:13:37,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:13:37,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:13:37,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:13:37,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:13:37,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:13:37,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:13:37,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:13:37,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:13:37,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:13:37,063 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-27 00:13:37,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:13:37,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:13:37,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:13:37,076 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:13:37,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:13:37,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:13:37,077 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 00:13:37,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:13:37,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:13:37,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:13:37,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:13:37,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:13:37,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:13:37,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:13:37,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:13:37,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 00:13:37,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:13:37,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:13:37,083 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_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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 -> 06d11383001c52cfbf19a51eafe2dc3d238c9679 [2018-10-27 00:13:37,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:13:37,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:13:37,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:13:37,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:13:37,125 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:13:37,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-10-27 00:13:37,175 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/data/4f82ce320/6e6f108466eb4095afc70c62a2a87721/FLAG7adbd7827 [2018-10-27 00:13:37,765 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:13:37,767 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-10-27 00:13:37,783 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/data/4f82ce320/6e6f108466eb4095afc70c62a2a87721/FLAG7adbd7827 [2018-10-27 00:13:37,797 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/data/4f82ce320/6e6f108466eb4095afc70c62a2a87721 [2018-10-27 00:13:37,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:13:37,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:13:37,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:13:37,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:13:37,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:13:37,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:13:37" (1/1) ... [2018-10-27 00:13:37,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce6d6bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:37, skipping insertion in model container [2018-10-27 00:13:37,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:13:37" (1/1) ... [2018-10-27 00:13:37,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:13:37,884 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:13:38,362 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:13:38,367 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:13:38,516 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:13:38,530 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:13:38,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38 WrapperNode [2018-10-27 00:13:38,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:13:38,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:13:38,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:13:38,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:13:38,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... [2018-10-27 00:13:38,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:13:38,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:13:38,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:13:38,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:13:38,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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-10-27 00:13:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:13:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:13:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:13:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:13:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:13:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 00:13:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 00:13:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 00:13:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:13:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:13:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:13:43,196 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:13:43,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:13:43 BoogieIcfgContainer [2018-10-27 00:13:43,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:13:43,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:13:43,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:13:43,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:13:43,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:13:37" (1/3) ... [2018-10-27 00:13:43,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b91cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:13:43, skipping insertion in model container [2018-10-27 00:13:43,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:13:38" (2/3) ... [2018-10-27 00:13:43,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b91cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:13:43, skipping insertion in model container [2018-10-27 00:13:43,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:13:43" (3/3) ... [2018-10-27 00:13:43,205 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44_true-unreach-call.c [2018-10-27 00:13:43,215 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:13:43,223 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:13:43,238 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:13:43,270 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 00:13:43,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:13:43,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:13:43,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:13:43,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:13:43,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:13:43,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:13:43,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:13:43,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:13:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-10-27 00:13:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 00:13:43,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:43,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:13:43,304 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:43,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -889068935, now seen corresponding path program 1 times [2018-10-27 00:13:43,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:13:43,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:13:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:43,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:13:43,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:13:43,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:13:43,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:13:43,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:13:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:13:43,749 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-10-27 00:13:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:13:46,244 INFO L93 Difference]: Finished difference Result 979 states and 1754 transitions. [2018-10-27 00:13:46,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:13:46,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-10-27 00:13:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:13:46,261 INFO L225 Difference]: With dead ends: 979 [2018-10-27 00:13:46,261 INFO L226 Difference]: Without dead ends: 680 [2018-10-27 00:13:46,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:13:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-27 00:13:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 484. [2018-10-27 00:13:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-27 00:13:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 730 transitions. [2018-10-27 00:13:46,335 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 730 transitions. Word has length 33 [2018-10-27 00:13:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:13:46,336 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 730 transitions. [2018-10-27 00:13:46,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:13:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 730 transitions. [2018-10-27 00:13:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:13:46,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:46,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:13:46,340 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:46,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash 337985131, now seen corresponding path program 1 times [2018-10-27 00:13:46,341 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:13:46,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:13:46,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:13:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:13:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:13:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:13:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:13:46,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:13:46,606 INFO L87 Difference]: Start difference. First operand 484 states and 730 transitions. Second operand 6 states. [2018-10-27 00:13:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:13:49,556 INFO L93 Difference]: Finished difference Result 1555 states and 2493 transitions. [2018-10-27 00:13:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:13:49,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-10-27 00:13:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:13:49,572 INFO L225 Difference]: With dead ends: 1555 [2018-10-27 00:13:49,572 INFO L226 Difference]: Without dead ends: 1077 [2018-10-27 00:13:49,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:13:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-10-27 00:13:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1063. [2018-10-27 00:13:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-10-27 00:13:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1592 transitions. [2018-10-27 00:13:49,636 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1592 transitions. Word has length 106 [2018-10-27 00:13:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:13:49,637 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1592 transitions. [2018-10-27 00:13:49,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:13:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1592 transitions. [2018-10-27 00:13:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 00:13:49,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:49,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:13:49,639 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:49,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash 375100500, now seen corresponding path program 1 times [2018-10-27 00:13:49,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:13:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:13:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:49,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:49,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:13:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:13:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 00:13:49,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 00:13:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 00:13:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:13:49,930 INFO L87 Difference]: Start difference. First operand 1063 states and 1592 transitions. Second operand 7 states. [2018-10-27 00:13:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:13:53,242 INFO L93 Difference]: Finished difference Result 2979 states and 4525 transitions. [2018-10-27 00:13:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:13:53,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-10-27 00:13:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:13:53,256 INFO L225 Difference]: With dead ends: 2979 [2018-10-27 00:13:53,257 INFO L226 Difference]: Without dead ends: 1922 [2018-10-27 00:13:53,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:13:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-10-27 00:13:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1813. [2018-10-27 00:13:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-10-27 00:13:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2564 transitions. [2018-10-27 00:13:53,339 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2564 transitions. Word has length 107 [2018-10-27 00:13:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:13:53,341 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2564 transitions. [2018-10-27 00:13:53,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 00:13:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2564 transitions. [2018-10-27 00:13:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-27 00:13:53,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:53,344 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:13:53,344 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:53,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1471774269, now seen corresponding path program 1 times [2018-10-27 00:13:53,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:13:53,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:13:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:53,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:13:53,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:13:53,762 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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-10-27 00:13:53,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:53,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:13:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:13:53,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:13:53,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-27 00:13:53,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:13:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:13:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:13:53,954 INFO L87 Difference]: Start difference. First operand 1813 states and 2564 transitions. Second operand 9 states. [2018-10-27 00:13:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:13:59,345 INFO L93 Difference]: Finished difference Result 7085 states and 11093 transitions. [2018-10-27 00:13:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 00:13:59,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 165 [2018-10-27 00:13:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:13:59,374 INFO L225 Difference]: With dead ends: 7085 [2018-10-27 00:13:59,375 INFO L226 Difference]: Without dead ends: 5278 [2018-10-27 00:13:59,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2018-10-27 00:13:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2018-10-27 00:13:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 4653. [2018-10-27 00:13:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4653 states. [2018-10-27 00:13:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 6164 transitions. [2018-10-27 00:13:59,536 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 6164 transitions. Word has length 165 [2018-10-27 00:13:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:13:59,538 INFO L481 AbstractCegarLoop]: Abstraction has 4653 states and 6164 transitions. [2018-10-27 00:13:59,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:13:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 6164 transitions. [2018-10-27 00:13:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-27 00:13:59,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:59,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 00:13:59,549 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:59,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash -580003924, now seen corresponding path program 1 times [2018-10-27 00:13:59,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:13:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:13:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:14:00,173 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-27 00:14:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-27 00:14:00,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:14:00,394 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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-10-27 00:14:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:14:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:14:00,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:14:02,630 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (and (not (= 0 (mod (+ .cse0 30) 90))) (<= 0 (+ .cse0 58979)) (< (+ .cse0 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse0 29) 90) 48)) (= (mod .cse1 10) 0) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_15 Int)) (let ((.cse4 (* 9 v_prenex_15))) (let ((.cse3 (div .cse4 10))) (let ((.cse2 (mod (+ .cse3 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_15) (= .cse2 0) (= 0 (mod (+ .cse3 30) 90)) (<= c_~a23~0 (+ .cse2 48)) (= (mod .cse4 10) 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse5 (* 9 v_prenex_1))) (let ((.cse6 (div .cse5 10))) (let ((.cse7 (mod (+ .cse6 29) 90))) (and (<= 0 .cse5) (< (+ .cse6 58979) 0) (<= (+ c_~a23~0 42) .cse7) (<= 0 (+ .cse6 58980)) (not (= .cse7 0)) (<= |c_old(~a23~0)| v_prenex_1)))))) (exists ((v_prenex_23 Int)) (let ((.cse9 (* 9 v_prenex_23))) (let ((.cse8 (div .cse9 10))) (and (<= |c_old(~a23~0)| v_prenex_23) (<= c_~a23~0 (+ (mod (+ .cse8 30) 90) 48)) (< .cse9 0) (not (= (mod .cse9 10) 0)) (= (mod (+ .cse8 29) 90) 0) (<= 0 (+ .cse8 58980)))))) (exists ((v_prenex_8 Int)) (let ((.cse10 (* 9 v_prenex_8))) (let ((.cse11 (div .cse10 10))) (and (<= 0 .cse10) (<= 0 (+ .cse11 58979)) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod (+ .cse11 29) 90) 48)) (= 0 (mod (+ .cse11 30) 90)))))) (exists ((v_prenex_16 Int)) (let ((.cse14 (* 9 v_prenex_16))) (let ((.cse13 (div .cse14 10))) (let ((.cse12 (mod (+ .cse13 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= (+ c_~a23~0 42) .cse12) (< (+ .cse13 58979) 0) (not (= .cse12 0)) (= 0 (mod (+ .cse13 30) 90)) (<= 0 .cse14)))))) (exists ((v_prenex_14 Int)) (let ((.cse17 (* 9 v_prenex_14))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 29) 90))) (and (= .cse15 0) (<= |c_old(~a23~0)| v_prenex_14) (<= c_~a23~0 (+ .cse15 48)) (< (+ .cse16 58980) 0) (not (= 0 (mod (+ .cse16 30) 90))) (<= 0 .cse17)))))) (exists ((v_prenex_7 Int)) (let ((.cse18 (* 9 v_prenex_7))) (let ((.cse19 (div .cse18 10))) (and (<= 0 .cse18) (<= 0 (+ .cse19 58979)) (<= c_~a23~0 (+ (mod (+ .cse19 29) 90) 48)) (<= |c_old(~a23~0)| v_prenex_7) (not (= 0 (mod (+ .cse19 30) 90))) (< (+ .cse19 58980) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse20 (* 9 v_prenex_3))) (let ((.cse22 (div .cse20 10))) (let ((.cse21 (mod (+ .cse22 29) 90))) (and (= (mod .cse20 10) 0) (<= (+ c_~a23~0 42) .cse21) (not (= .cse21 0)) (<= |c_old(~a23~0)| v_prenex_3) (= 0 (mod (+ .cse22 30) 90)) (< (+ .cse22 58979) 0)))))) (exists ((v_prenex_24 Int)) (let ((.cse24 (* 9 v_prenex_24))) (let ((.cse23 (div .cse24 10))) (let ((.cse25 (mod (+ .cse23 30) 90))) (and (not (= (mod (+ .cse23 29) 90) 0)) (<= |c_old(~a23~0)| v_prenex_24) (not (= (mod .cse24 10) 0)) (< (+ .cse23 58979) 0) (< (+ .cse23 58980) 0) (<= (+ c_~a23~0 42) .cse25) (< .cse24 0) (not (= 0 .cse25))))))) (exists ((v_prenex_2 Int)) (let ((.cse27 (* 9 v_prenex_2))) (let ((.cse28 (div .cse27 10))) (let ((.cse26 (mod (+ .cse28 29) 90))) (and (<= c_~a23~0 (+ .cse26 48)) (<= |c_old(~a23~0)| v_prenex_2) (<= 0 .cse27) (= .cse26 0) (= 0 (mod (+ .cse28 30) 90))))))) (exists ((v_prenex_6 Int)) (let ((.cse30 (* 9 v_prenex_6))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (mod (+ .cse29 30) 90))) (and (< (+ .cse29 58979) 0) (not (= (mod (+ .cse29 29) 90) 0)) (< .cse30 0) (not (= (mod .cse30 10) 0)) (= 0 .cse31) (<= c_~a23~0 (+ .cse31 48)) (<= |c_old(~a23~0)| v_prenex_6)))))) (exists ((v_prenex_17 Int)) (let ((.cse32 (* 9 v_prenex_17))) (let ((.cse34 (div .cse32 10))) (let ((.cse33 (mod (+ .cse34 30) 90))) (and (< .cse32 0) (= 0 .cse33) (<= |c_old(~a23~0)| v_prenex_17) (<= c_~a23~0 (+ .cse33 48)) (= (mod (+ .cse34 29) 90) 0) (not (= (mod .cse32 10) 0))))))) (exists ((v_prenex_20 Int)) (let ((.cse35 (* 9 v_prenex_20))) (let ((.cse36 (div .cse35 10))) (and (not (= (mod .cse35 10) 0)) (<= c_~a23~0 (+ (mod (+ .cse36 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_20) (<= 0 (+ .cse36 58979)) (<= 0 (+ .cse36 58980)) (< .cse35 0))))) (exists ((v_prenex_22 Int)) (let ((.cse39 (* 9 v_prenex_22))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (mod (+ .cse38 29) 90))) (and (<= (+ c_~a23~0 42) .cse37) (<= |c_old(~a23~0)| v_prenex_22) (not (= 0 (mod (+ .cse38 30) 90))) (< (+ .cse38 58980) 0) (not (= .cse37 0)) (= (mod .cse39 10) 0) (< (+ .cse38 58979) 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse40 (* 9 v_prenex_10))) (let ((.cse41 (div .cse40 10))) (and (< .cse40 0) (not (= (mod (+ .cse41 29) 90) 0)) (not (= (mod .cse40 10) 0)) (< (+ .cse41 58979) 0) (<= c_~a23~0 (+ (mod (+ .cse41 30) 90) 48)) (<= 0 (+ .cse41 58980)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_26 Int)) (let ((.cse43 (* 9 v_prenex_26))) (let ((.cse42 (div .cse43 10))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse42 58980)) (<= 0 (+ .cse42 58979)) (<= c_~a23~0 (+ (mod (+ .cse42 29) 90) 48)) (<= 0 .cse43))))) (exists ((v_prenex_19 Int)) (let ((.cse46 (* 9 v_prenex_19))) (let ((.cse44 (div .cse46 10))) (let ((.cse45 (mod (+ .cse44 29) 90))) (and (<= 0 (+ .cse44 58980)) (< (+ .cse44 58979) 0) (<= (+ c_~a23~0 42) .cse45) (= (mod .cse46 10) 0) (not (= .cse45 0)) (<= |c_old(~a23~0)| v_prenex_19)))))) (exists ((v_prenex_13 Int)) (let ((.cse49 (* 9 v_prenex_13))) (let ((.cse48 (div .cse49 10))) (let ((.cse47 (mod (+ .cse48 29) 90))) (and (= .cse47 0) (<= c_~a23~0 (+ .cse47 48)) (<= |c_old(~a23~0)| v_prenex_13) (<= 0 (+ .cse48 58980)) (<= 0 .cse49)))))) (exists ((v_prenex_9 Int)) (let ((.cse51 (* 9 v_prenex_9))) (let ((.cse50 (div .cse51 10))) (and (<= |c_old(~a23~0)| v_prenex_9) (= 0 (mod (+ .cse50 30) 90)) (<= c_~a23~0 (+ (mod (+ .cse50 29) 90) 48)) (<= 0 (+ .cse50 58979)) (= (mod .cse51 10) 0))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (* 9 v_prenex_25))) (let ((.cse54 (div .cse53 10))) (let ((.cse52 (mod (+ .cse54 29) 90))) (and (= .cse52 0) (= (mod .cse53 10) 0) (<= |c_old(~a23~0)| v_prenex_25) (<= c_~a23~0 (+ .cse52 48)) (not (= 0 (mod (+ .cse54 30) 90))) (< (+ .cse54 58980) 0)))))) (exists ((v_prenex_12 Int)) (let ((.cse56 (* 9 v_prenex_12))) (let ((.cse55 (div .cse56 10))) (and (<= |c_old(~a23~0)| v_prenex_12) (<= 0 (+ .cse55 58980)) (<= c_~a23~0 (+ (mod (+ .cse55 29) 90) 48)) (<= 0 (+ .cse55 58979)) (= (mod .cse56 10) 0))))) (exists ((v_prenex_18 Int)) (let ((.cse57 (* 9 v_prenex_18))) (let ((.cse59 (div .cse57 10))) (let ((.cse58 (mod (+ .cse59 29) 90))) (and (<= 0 .cse57) (not (= .cse58 0)) (< (+ .cse59 58979) 0) (< (+ .cse59 58980) 0) (not (= 0 (mod (+ .cse59 30) 90))) (<= |c_old(~a23~0)| v_prenex_18) (<= (+ c_~a23~0 42) .cse58)))))) (exists ((v_~a23~0_478 Int)) (let ((.cse60 (* 9 v_~a23~0_478))) (let ((.cse62 (div .cse60 10))) (let ((.cse61 (mod (+ .cse62 30) 90))) (and (not (= (mod .cse60 10) 0)) (<= (+ c_~a23~0 42) .cse61) (not (= 0 .cse61)) (< (+ .cse62 58980) 0) (<= 0 (+ .cse62 58979)) (< .cse60 0) (<= |c_old(~a23~0)| v_~a23~0_478)))))) (exists ((v_prenex_21 Int)) (let ((.cse64 (* 9 v_prenex_21))) (let ((.cse65 (div .cse64 10))) (let ((.cse63 (mod (+ .cse65 29) 90))) (and (= .cse63 0) (<= |c_old(~a23~0)| v_prenex_21) (= (mod .cse64 10) 0) (<= c_~a23~0 (+ .cse63 48)) (<= 0 (+ .cse65 58980))))))) (exists ((v_prenex_11 Int)) (let ((.cse68 (* 9 v_prenex_11))) (let ((.cse66 (div .cse68 10))) (let ((.cse67 (mod (+ .cse66 30) 90))) (and (<= 0 (+ .cse66 58979)) (<= c_~a23~0 (+ .cse67 48)) (<= |c_old(~a23~0)| v_prenex_11) (< .cse68 0) (= 0 .cse67) (not (= (mod .cse68 10) 0))))))) (exists ((v_prenex_5 Int)) (let ((.cse71 (* 9 v_prenex_5))) (let ((.cse69 (div .cse71 10))) (let ((.cse70 (mod (+ .cse69 30) 90))) (and (= (mod (+ .cse69 29) 90) 0) (not (= 0 .cse70)) (< (+ .cse69 58980) 0) (<= (+ c_~a23~0 42) .cse70) (not (= (mod .cse71 10) 0)) (<= |c_old(~a23~0)| v_prenex_5) (< .cse71 0))))))) is different from true [2018-10-27 00:14:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 71 trivial. 2 not checked. [2018-10-27 00:14:03,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:14:03,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 00:14:03,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:14:03,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:14:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-10-27 00:14:03,279 INFO L87 Difference]: Start difference. First operand 4653 states and 6164 transitions. Second operand 9 states. [2018-10-27 00:15:35,467 WARN L179 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 503 DAG size of output: 102 [2018-10-27 00:17:14,772 WARN L179 SmtUtils]: Spent 1.50 m on a formula simplification. DAG size of input: 504 DAG size of output: 104 [2018-10-27 00:17:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:17:18,586 INFO L93 Difference]: Finished difference Result 14275 states and 19899 transitions. [2018-10-27 00:17:18,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 00:17:18,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-10-27 00:17:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:17:18,627 INFO L225 Difference]: With dead ends: 14275 [2018-10-27 00:17:18,627 INFO L226 Difference]: Without dead ends: 9628 [2018-10-27 00:17:18,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 193.0s TimeCoverageRelationStatistics Valid=75, Invalid=195, Unknown=6, NotChecked=30, Total=306 [2018-10-27 00:17:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9628 states. [2018-10-27 00:17:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9628 to 8758. [2018-10-27 00:17:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8758 states. [2018-10-27 00:17:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8758 states to 8758 states and 11645 transitions. [2018-10-27 00:17:18,909 INFO L78 Accepts]: Start accepts. Automaton has 8758 states and 11645 transitions. Word has length 224 [2018-10-27 00:17:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:17:18,909 INFO L481 AbstractCegarLoop]: Abstraction has 8758 states and 11645 transitions. [2018-10-27 00:17:18,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:17:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8758 states and 11645 transitions. [2018-10-27 00:17:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-27 00:17:18,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:17:18,917 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 00:17:18,917 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:17:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:17:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1071646111, now seen corresponding path program 1 times [2018-10-27 00:17:18,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:17:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:17:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:18,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:17:18,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:17:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-27 00:17:19,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:17:19,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:17:19,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:17:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:17:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:17:19,188 INFO L87 Difference]: Start difference. First operand 8758 states and 11645 transitions. Second operand 4 states. [2018-10-27 00:17:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:17:21,732 INFO L93 Difference]: Finished difference Result 23003 states and 32169 transitions. [2018-10-27 00:17:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:17:21,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-10-27 00:17:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:17:21,869 INFO L225 Difference]: With dead ends: 23003 [2018-10-27 00:17:21,869 INFO L226 Difference]: Without dead ends: 13780 [2018-10-27 00:17:21,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:17:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13780 states. [2018-10-27 00:17:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13780 to 13365. [2018-10-27 00:17:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13365 states. [2018-10-27 00:17:22,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13365 states to 13365 states and 18086 transitions. [2018-10-27 00:17:22,157 INFO L78 Accepts]: Start accepts. Automaton has 13365 states and 18086 transitions. Word has length 245 [2018-10-27 00:17:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:17:22,158 INFO L481 AbstractCegarLoop]: Abstraction has 13365 states and 18086 transitions. [2018-10-27 00:17:22,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:17:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13365 states and 18086 transitions. [2018-10-27 00:17:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-27 00:17:22,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:17:22,164 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 00:17:22,164 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:17:22,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:17:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 248780968, now seen corresponding path program 1 times [2018-10-27 00:17:22,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:17:22,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:17:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:17:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:17:23,468 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-27 00:17:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-27 00:17:23,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:17:23,521 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 00:17:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:17:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:17:23,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:17:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:17:23,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:17:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-10-27 00:17:23,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 00:17:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 00:17:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:17:23,936 INFO L87 Difference]: Start difference. First operand 13365 states and 18086 transitions. Second operand 12 states. [2018-10-27 00:17:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:17:37,118 INFO L93 Difference]: Finished difference Result 38453 states and 55014 transitions. [2018-10-27 00:17:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-27 00:17:37,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 247 [2018-10-27 00:17:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:17:37,219 INFO L225 Difference]: With dead ends: 38453 [2018-10-27 00:17:37,219 INFO L226 Difference]: Without dead ends: 24869 [2018-10-27 00:17:37,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=763, Invalid=4639, Unknown=0, NotChecked=0, Total=5402 [2018-10-27 00:17:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24869 states. [2018-10-27 00:17:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24869 to 21785. [2018-10-27 00:17:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21785 states. [2018-10-27 00:17:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21785 states to 21785 states and 29042 transitions. [2018-10-27 00:17:37,777 INFO L78 Accepts]: Start accepts. Automaton has 21785 states and 29042 transitions. Word has length 247 [2018-10-27 00:17:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:17:37,778 INFO L481 AbstractCegarLoop]: Abstraction has 21785 states and 29042 transitions. [2018-10-27 00:17:37,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 00:17:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21785 states and 29042 transitions. [2018-10-27 00:17:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-27 00:17:37,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:17:37,788 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:17:37,788 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:17:37,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:17:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2081573900, now seen corresponding path program 1 times [2018-10-27 00:17:37,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:17:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:17:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:37,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:17:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:17:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:17:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 00:17:38,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:17:38,830 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/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-10-27 00:17:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:17:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:17:38,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:17:44,986 WARN L179 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-10-27 00:17:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-27 00:17:45,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:17:45,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 00:17:45,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:17:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:17:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-10-27 00:17:45,109 INFO L87 Difference]: Start difference. First operand 21785 states and 29042 transitions. Second operand 9 states. [2018-10-27 00:17:47,828 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 34 DAG size of output: 6 [2018-10-27 00:17:53,730 WARN L179 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2018-10-27 00:19:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:19:32,736 INFO L93 Difference]: Finished difference Result 76755 states and 115005 transitions. [2018-10-27 00:19:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 00:19:32,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 278 [2018-10-27 00:19:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:19:32,953 INFO L225 Difference]: With dead ends: 76755 [2018-10-27 00:19:32,953 INFO L226 Difference]: Without dead ends: 55356 [2018-10-27 00:19:33,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 280 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=99, Invalid=205, Unknown=2, NotChecked=0, Total=306 [2018-10-27 00:19:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55356 states. [2018-10-27 00:19:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55356 to 49161. [2018-10-27 00:19:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49161 states. [2018-10-27 00:19:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49161 states to 49161 states and 64799 transitions. [2018-10-27 00:19:34,447 INFO L78 Accepts]: Start accepts. Automaton has 49161 states and 64799 transitions. Word has length 278 [2018-10-27 00:19:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:19:34,449 INFO L481 AbstractCegarLoop]: Abstraction has 49161 states and 64799 transitions. [2018-10-27 00:19:34,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:19:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 49161 states and 64799 transitions. [2018-10-27 00:19:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-27 00:19:34,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:19:34,504 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:19:34,504 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:19:34,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:19:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash -425290735, now seen corresponding path program 1 times [2018-10-27 00:19:34,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:19:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:19:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:19:34,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:19:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:19:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:19:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-10-27 00:19:34,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:19:34,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:19:34,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:19:34,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:19:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:19:34,757 INFO L87 Difference]: Start difference. First operand 49161 states and 64799 transitions. Second operand 3 states. [2018-10-27 00:19:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:19:36,434 INFO L93 Difference]: Finished difference Result 105991 states and 141738 transitions. [2018-10-27 00:19:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:19:36,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 390 [2018-10-27 00:19:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:19:36,572 INFO L225 Difference]: With dead ends: 105991 [2018-10-27 00:19:36,572 INFO L226 Difference]: Without dead ends: 57216 [2018-10-27 00:19:36,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:19:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57216 states. [2018-10-27 00:19:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57216 to 57020. [2018-10-27 00:19:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57020 states. [2018-10-27 00:19:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57020 states to 57020 states and 71755 transitions. [2018-10-27 00:19:37,920 INFO L78 Accepts]: Start accepts. Automaton has 57020 states and 71755 transitions. Word has length 390 [2018-10-27 00:19:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:19:37,921 INFO L481 AbstractCegarLoop]: Abstraction has 57020 states and 71755 transitions. [2018-10-27 00:19:37,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:19:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 57020 states and 71755 transitions. [2018-10-27 00:19:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-27 00:19:38,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:19:38,029 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:19:38,029 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:19:38,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:19:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash -326225717, now seen corresponding path program 1 times [2018-10-27 00:19:38,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:19:38,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:19:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:19:38,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:19:38,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:19:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:19:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-27 00:19:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:19:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:19:38,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:19:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:19:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:19:38,379 INFO L87 Difference]: Start difference. First operand 57020 states and 71755 transitions. Second operand 4 states. [2018-10-27 00:19:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:19:39,742 INFO L93 Difference]: Finished difference Result 110346 states and 138443 transitions. [2018-10-27 00:19:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:19:39,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2018-10-27 00:19:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:19:39,743 INFO L225 Difference]: With dead ends: 110346 [2018-10-27 00:19:39,743 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 00:19:39,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:19:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 00:19:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 00:19:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 00:19:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 00:19:39,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 433 [2018-10-27 00:19:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:19:39,854 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 00:19:39,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:19:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 00:19:39,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 00:19:39,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 00:19:40,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:40,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:41,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,225 WARN L179 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 945 DAG size of output: 440 [2018-10-27 00:19:42,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:42,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:19:43,713 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 945 DAG size of output: 440 [2018-10-27 00:19:47,452 WARN L179 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 754 DAG size of output: 92 [2018-10-27 00:19:49,243 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 399 DAG size of output: 95 [2018-10-27 00:19:50,969 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 399 DAG size of output: 95 [2018-10-27 00:19:50,971 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a23~0 |old(~a23~0)|) (= |old(~a4~0)| ~a4~0) (= ~a25~0 |old(~a25~0)|) (= |old(~a29~0)| ~a29~0)) [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,972 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,973 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,974 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,975 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,976 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,977 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,978 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-10-27 00:19:50,979 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,980 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse3 (= ~a23~0 |old(~a23~0)|)) (.cse4 (= |old(~a4~0)| ~a4~0)) (.cse5 (= ~a25~0 |old(~a25~0)|)) (.cse6 (= |old(~a29~0)| ~a29~0))) (let ((.cse1 (<= |old(~a23~0)| 306)) (.cse14 (< 137 |old(~a23~0)|)) (.cse9 (not (= 12 |old(~a25~0)|))) (.cse10 (not (= 10 |old(~a25~0)|))) (.cse16 (= ~a29~0 |old(~a29~0)|)) (.cse13 (< 138 |old(~a23~0)|)) (.cse12 (< |old(~a29~0)| 130)) (.cse15 (= 9 |old(~a25~0)|)) (.cse7 (not (= |old(~a4~0)| 1))) (.cse0 (not (= 15 ~a8~0))) (.cse11 (< 140 |old(~a29~0)|)) (.cse2 (< |old(~a4~0)| 1)) (.cse19 (= 13 |old(~a25~0)|)) (.cse8 (and .cse3 .cse4 .cse5 .cse6))) (and (or .cse0 (or (< |old(~a25~0)| 12) .cse1 .cse2) (and (and .cse3 .cse4) .cse5 .cse6)) (or .cse7 .cse0 .cse1 .cse8) (or .cse9 .cse0 .cse8) (or .cse0 .cse10 .cse11 .cse8) (or .cse0 .cse12 .cse8 .cse2 .cse13) (or .cse0 .cse2 .cse8 (< |old(~a23~0)| 21783)) (or .cse8 .cse0 .cse14 .cse15) (or .cse0 .cse8 (or .cse14 (< |old(~a29~0)| 262))) (let ((.cse18 (+ |old(~a23~0)| 599772))) (or .cse7 (let ((.cse17 (+ ~a23~0 599772))) (and .cse16 (<= .cse17 0) .cse4 (<= 0 .cse17) .cse5)) (< 0 .cse18) .cse9 (< .cse18 0))) (or .cse0 .cse11 .cse19 .cse8 .cse13) (or .cse10 .cse7 (and .cse16 .cse3 (= 10 ~a25~0) .cse4) .cse13) (or .cse0 .cse2 .cse8 (<= |old(~a29~0)| 245)) (or .cse8 .cse0 .cse12 .cse2 .cse15) (or .cse7 .cse0 .cse11 .cse8) (or .cse0 .cse11 .cse2 .cse19 .cse8)))) [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,981 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,982 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,983 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-10-27 00:19:50,984 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,985 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-10-27 00:19:50,986 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,987 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,988 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,989 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,990 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,991 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,992 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,993 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,994 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,996 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-10-27 00:19:50,997 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:19:50,997 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a23~0 312) (= ~a8~0 15) (<= 1 ~a4~0) (<= ~a29~0 130) (= 10 ~a25~0) (<= 130 ~a29~0) (<= 312 ~a23~0)) [2018-10-27 00:19:50,997 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 00:19:50,997 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:19:50,997 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (< 312 |old(~a23~0)|) (not (= 10 |old(~a25~0)|)) (not (= 15 ~a8~0)) (< |old(~a23~0)| 312) (< |old(~a29~0)| 130) (and (= ~a23~0 |old(~a23~0)|) (= |old(~a4~0)| ~a4~0) (= ~a25~0 |old(~a25~0)|) (= |old(~a29~0)| ~a29~0)) (< |old(~a4~0)| 1) (< 130 |old(~a29~0)|)) [2018-10-27 00:19:50,997 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-10-27 00:19:50,998 INFO L421 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse9 (not (= ~a25~0 13))) (.cse7 (= |old(~a4~0)| ~a4~0)) (.cse1 (<= 1 ~a4~0)) (.cse3 (= |old(~a4~0)| 1)) (.cse0 (not (= 9 ~a25~0)))) (let ((.cse8 (<= ~a29~0 140)) (.cse4 (= ~a25~0 12)) (.cse11 (and (and (let ((.cse13 (<= ~a29~0 130))) (or (and .cse9 .cse13 .cse7) (and .cse13 .cse1 .cse3))) (<= 312 ~a23~0)) .cse0)) (.cse5 (<= ~a23~0 137)) (.cse6 (< 306 ~a23~0)) (.cse12 (<= 21783 ~a23~0)) (.cse10 (<= ~a23~0 138)) (.cse2 (<= 130 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (exists ((v_~a29~0_506 Int)) (and (<= |old(~a29~0)| v_~a29~0_506) (<= (+ (mod (+ v_~a29~0_506 4) 15) 262) ~a29~0) (<= 0 (+ v_~a29~0_506 355924)))) .cse5 .cse3) (and .cse6 .cse7 .cse3) (and .cse7 .cse3 .cse8) (< |old(~a29~0)| 130) (< |old(~a23~0)| 312) (and (and .cse9 .cse10 .cse3) .cse8) (and (= 10 ~a25~0) .cse3 .cse8) (and .cse1 (< 245 ~a29~0) .cse3) (and .cse9 .cse1 .cse3 .cse8) (not (= 10 |old(~a25~0)|)) (and (= ~a23~0 |old(~a23~0)|) (= ~a25~0 |old(~a25~0)|) (= |old(~a29~0)| ~a29~0) .cse11) (and .cse12 .cse4 .cse11) (and .cse0 .cse5 .cse3) (< |old(~a4~0)| 1) (< 312 |old(~a23~0)|) (< 130 |old(~a29~0)|) (and (<= 12 ~a25~0) .cse6 .cse1 .cse3) (and .cse12 .cse1 .cse3) (not (= 15 ~a8~0)) (and .cse10 .cse1 .cse2 .cse3)))) [2018-10-27 00:19:50,998 INFO L425 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-10-27 00:19:50,998 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-10-27 00:19:50,998 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-10-27 00:19:50,998 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse9 (not (= ~a25~0 13))) (.cse7 (= |old(~a4~0)| ~a4~0)) (.cse1 (<= 1 ~a4~0)) (.cse3 (= |old(~a4~0)| 1)) (.cse0 (not (= 9 ~a25~0)))) (let ((.cse8 (<= ~a29~0 140)) (.cse4 (= ~a25~0 12)) (.cse11 (and (and (let ((.cse13 (<= ~a29~0 130))) (or (and .cse9 .cse13 .cse7) (and .cse13 .cse1 .cse3))) (<= 312 ~a23~0)) .cse0)) (.cse5 (<= ~a23~0 137)) (.cse6 (< 306 ~a23~0)) (.cse12 (<= 21783 ~a23~0)) (.cse10 (<= ~a23~0 138)) (.cse2 (<= 130 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (exists ((v_~a29~0_506 Int)) (and (<= |old(~a29~0)| v_~a29~0_506) (<= (+ (mod (+ v_~a29~0_506 4) 15) 262) ~a29~0) (<= 0 (+ v_~a29~0_506 355924)))) .cse5 .cse3) (and .cse6 .cse7 .cse3) (and .cse7 .cse3 .cse8) (< |old(~a29~0)| 130) (< |old(~a23~0)| 312) (and (and .cse9 .cse10 .cse3) .cse8) (and (= 10 ~a25~0) .cse3 .cse8) (and .cse1 (< 245 ~a29~0) .cse3) (and .cse9 .cse1 .cse3 .cse8) (not (= 10 |old(~a25~0)|)) (and (= ~a23~0 |old(~a23~0)|) (= ~a25~0 |old(~a25~0)|) (= |old(~a29~0)| ~a29~0) .cse11) (and .cse12 .cse4 .cse11) (and .cse0 .cse5 .cse3) (< |old(~a4~0)| 1) (< 312 |old(~a23~0)|) (< 130 |old(~a29~0)|) (and (<= 12 ~a25~0) .cse6 .cse1 .cse3) (and .cse12 .cse1 .cse3) (not (= 15 ~a8~0)) (and .cse10 .cse1 .cse2 .cse3)))) [2018-10-27 00:19:50,998 INFO L425 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-10-27 00:19:51,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,016 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,017 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:19:51 BoogieIcfgContainer [2018-10-27 00:19:51,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:19:51,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:19:51,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:19:51,022 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:19:51,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:13:43" (3/4) ... [2018-10-27 00:19:51,035 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 00:19:51,043 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 00:19:51,043 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-10-27 00:19:51,044 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 00:19:51,073 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-27 00:19:51,074 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-27 00:19:51,112 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(9 == a25) && 1 <= a4) && 130 <= a29) && \old(a4) == 1) || (a25 == 12 && \old(a4) == 1)) || (((\exists v_~a29~0_506 : int :: (\old(a29) <= v_~a29~0_506 && (v_~a29~0_506 + 4) % 15 + 262 <= a29) && 0 <= v_~a29~0_506 + 355924) && a23 <= 137) && \old(a4) == 1)) || ((306 < a23 && \old(a4) == a4) && \old(a4) == 1)) || ((\old(a4) == a4 && \old(a4) == 1) && a29 <= 140)) || \old(a29) < 130) || \old(a23) < 312) || (((!(a25 == 13) && a23 <= 138) && \old(a4) == 1) && a29 <= 140)) || ((10 == a25 && \old(a4) == 1) && a29 <= 140)) || ((1 <= a4 && 245 < a29) && \old(a4) == 1)) || (((!(a25 == 13) && 1 <= a4) && \old(a4) == 1) && a29 <= 140)) || !(10 == \old(a25))) || (((a23 == \old(a23) && a25 == \old(a25)) && \old(a29) == a29) && ((((!(a25 == 13) && a29 <= 130) && \old(a4) == a4) || ((a29 <= 130 && 1 <= a4) && \old(a4) == 1)) && 312 <= a23) && !(9 == a25))) || ((21783 <= a23 && a25 == 12) && ((((!(a25 == 13) && a29 <= 130) && \old(a4) == a4) || ((a29 <= 130 && 1 <= a4) && \old(a4) == 1)) && 312 <= a23) && !(9 == a25))) || ((!(9 == a25) && a23 <= 137) && \old(a4) == 1)) || \old(a4) < 1) || 312 < \old(a23)) || 130 < \old(a29)) || (((12 <= a25 && 306 < a23) && 1 <= a4) && \old(a4) == 1)) || ((21783 <= a23 && 1 <= a4) && \old(a4) == 1)) || !(15 == a8)) || (((a23 <= 138 && 1 <= a4) && 130 <= a29) && \old(a4) == 1) [2018-10-27 00:19:51,287 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_baa45b7a-fe0f-48eb-8999-a19b0ab180e0/bin-2019/uautomizer/witness.graphml [2018-10-27 00:19:51,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:19:51,288 INFO L168 Benchmark]: Toolchain (without parser) took 373486.62 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 955.9 MB in the beginning and 1.3 GB in the end (delta: -349.6 MB). Peak memory consumption was 988.9 MB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,289 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:19:51,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.36 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 902.2 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,289 INFO L168 Benchmark]: Boogie Preprocessor took 238.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 902.2 MB in the beginning and 1.1 GB in the end (delta: -243.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,289 INFO L168 Benchmark]: RCFGBuilder took 4427.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.3 MB in the end (delta: 165.7 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,290 INFO L168 Benchmark]: TraceAbstraction took 367822.77 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 980.3 MB in the beginning and 1.4 GB in the end (delta: -372.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,290 INFO L168 Benchmark]: Witness Printer took 265.16 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:19:51,292 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.36 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 902.2 MB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 238.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 902.2 MB in the beginning and 1.1 GB in the end (delta: -243.8 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4427.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.3 MB in the end (delta: 165.7 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 367822.77 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 980.3 MB in the beginning and 1.4 GB in the end (delta: -372.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 265.16 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 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_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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: 1034]: Loop Invariant [2018-10-27 00:19:51,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2018-10-27 00:19:51,299 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((!(9 == a25) && 1 <= a4) && 130 <= a29) && \old(a4) == 1) || (a25 == 12 && \old(a4) == 1)) || (((\exists v_~a29~0_506 : int :: (\old(a29) <= v_~a29~0_506 && (v_~a29~0_506 + 4) % 15 + 262 <= a29) && 0 <= v_~a29~0_506 + 355924) && a23 <= 137) && \old(a4) == 1)) || ((306 < a23 && \old(a4) == a4) && \old(a4) == 1)) || ((\old(a4) == a4 && \old(a4) == 1) && a29 <= 140)) || \old(a29) < 130) || \old(a23) < 312) || (((!(a25 == 13) && a23 <= 138) && \old(a4) == 1) && a29 <= 140)) || ((10 == a25 && \old(a4) == 1) && a29 <= 140)) || ((1 <= a4 && 245 < a29) && \old(a4) == 1)) || (((!(a25 == 13) && 1 <= a4) && \old(a4) == 1) && a29 <= 140)) || !(10 == \old(a25))) || (((a23 == \old(a23) && a25 == \old(a25)) && \old(a29) == a29) && ((((!(a25 == 13) && a29 <= 130) && \old(a4) == a4) || ((a29 <= 130 && 1 <= a4) && \old(a4) == 1)) && 312 <= a23) && !(9 == a25))) || ((21783 <= a23 && a25 == 12) && ((((!(a25 == 13) && a29 <= 130) && \old(a4) == a4) || ((a29 <= 130 && 1 <= a4) && \old(a4) == 1)) && 312 <= a23) && !(9 == a25))) || ((!(9 == a25) && a23 <= 137) && \old(a4) == 1)) || \old(a4) < 1) || 312 < \old(a23)) || 130 < \old(a29)) || (((12 <= a25 && 306 < a23) && 1 <= a4) && \old(a4) == 1)) || ((21783 <= a23 && 1 <= a4) && \old(a4) == 1)) || !(15 == a8)) || (((a23 <= 138 && 1 <= a4) && 130 <= a29) && \old(a4) == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 367.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 337.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1760 SDtfs, 13877 SDslu, 2971 SDs, 0 SdLazy, 30658 SolverSat, 5161 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 130.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 978 SyntacticMatches, 5 SemanticMatches, 149 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 209.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57020occurred 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: 3.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 11704 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 900 PreInvPairs, 1374 NumberOfFragments, 1041 HoareAnnotationTreeSize, 900 FomulaSimplifications, 106967 FormulaSimplificationTreeSizeReduction, 3.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 38191 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 3142 NumberOfCodeBlocks, 3142 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3128 ConstructedInterpolants, 4 QuantifiedInterpolants, 2640324 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1700 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1545/1814 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...