./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.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_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/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 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:39:37,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:39:37,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:39:37,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:39:37,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:39:37,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:39:37,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:39:37,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:39:37,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:39:37,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:39:37,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:39:37,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:39:37,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:39:37,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:39:37,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:39:37,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:39:37,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:39:37,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:39:37,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:39:37,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:39:37,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:39:37,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:39:37,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:39:37,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:39:37,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:39:37,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:39:37,914 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:39:37,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:39:37,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:39:37,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:39:37,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:39:37,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:39:37,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:39:37,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:39:37,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:39:37,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:39:37,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 04:39:37,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:39:37,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:39:37,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:39:37,932 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:39:37,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:39:37,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:39:37,933 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:39:37,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:39:37,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:39:37,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:39:37,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:39:37,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:39:37,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:39:37,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:39:37,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:39:37,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:39:37,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:39:37,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:39:37,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:39:37,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:39:37,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:39:37,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:39:37,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:39:37,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:39:37,936 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_15a20df5-c042-4b00-8997-c3c1e4a0efb2/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 -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-11-10 04:39:37,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:39:37,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:39:37,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:39:37,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:39:37,979 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:39:37,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 04:39:38,021 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/data/b4c34087c/594f22777cdc4c529a24539609786254/FLAGf8562d29a [2018-11-10 04:39:38,369 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:39:38,370 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 04:39:38,375 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/data/b4c34087c/594f22777cdc4c529a24539609786254/FLAGf8562d29a [2018-11-10 04:39:38,384 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/data/b4c34087c/594f22777cdc4c529a24539609786254 [2018-11-10 04:39:38,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:39:38,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 04:39:38,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:39:38,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:39:38,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:39:38,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61785316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38, skipping insertion in model container [2018-11-10 04:39:38,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:39:38,421 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:39:38,555 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:39:38,558 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:39:38,591 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:39:38,602 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:39:38,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38 WrapperNode [2018-11-10 04:39:38,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:39:38,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:39:38,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:39:38,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:39:38,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... [2018-11-10 04:39:38,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:39:38,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:39:38,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:39:38,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:39:38,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:39:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:39:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:39:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 04:39:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-10 04:39:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-10 04:39:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-10 04:39:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:39:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:39:38,953 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:39:38,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:39:38 BoogieIcfgContainer [2018-11-10 04:39:38,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:39:38,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:39:38,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:39:38,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:39:38,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:39:38" (1/3) ... [2018-11-10 04:39:38,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd13f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:39:38, skipping insertion in model container [2018-11-10 04:39:38,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:39:38" (2/3) ... [2018-11-10 04:39:38,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd13f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:39:38, skipping insertion in model container [2018-11-10 04:39:38,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:39:38" (3/3) ... [2018-11-10 04:39:38,959 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 04:39:38,965 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:39:38,970 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:39:38,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:39:38,999 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:39:39,000 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:39:39,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:39:39,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:39:39,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:39:39,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:39:39,000 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:39:39,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:39:39,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:39:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-10 04:39:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 04:39:39,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:39,019 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:39,020 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:39,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1252609817, now seen corresponding path program 1 times [2018-11-10 04:39:39,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:39,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:39:39,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:39:39,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:39:39,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:39:39,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:39:39,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:39:39,184 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-11-10 04:39:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:39,224 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-10 04:39:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:39:39,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 04:39:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:39,233 INFO L225 Difference]: With dead ends: 122 [2018-11-10 04:39:39,233 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 04:39:39,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:39:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 04:39:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-10 04:39:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 04:39:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 04:39:39,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-10 04:39:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:39,268 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 04:39:39,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:39:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-10 04:39:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 04:39:39,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:39,271 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:39,271 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -955411957, now seen corresponding path program 1 times [2018-11-10 04:39:39,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:39,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:39,357 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:39,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:39,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:39,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 8 [2018-11-10 04:39:39,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:39:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:39:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:39:39,517 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 8 states. [2018-11-10 04:39:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:39,774 INFO L93 Difference]: Finished difference Result 157 states and 220 transitions. [2018-11-10 04:39:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:39:39,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-10 04:39:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:39,777 INFO L225 Difference]: With dead ends: 157 [2018-11-10 04:39:39,777 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 04:39:39,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:39:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 04:39:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2018-11-10 04:39:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 04:39:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2018-11-10 04:39:39,794 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 50 [2018-11-10 04:39:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:39,794 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2018-11-10 04:39:39,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:39:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2018-11-10 04:39:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 04:39:39,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:39,796 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:39,796 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:39,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1292080167, now seen corresponding path program 1 times [2018-11-10 04:39:39,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:39,855 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:39,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:39,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:39,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:39:39,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 04:39:39,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:39:39,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:39:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:39:39,950 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand 4 states. [2018-11-10 04:39:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:40,025 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2018-11-10 04:39:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:39:40,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-10 04:39:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:40,027 INFO L225 Difference]: With dead ends: 169 [2018-11-10 04:39:40,027 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 04:39:40,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:39:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 04:39:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2018-11-10 04:39:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 04:39:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2018-11-10 04:39:40,038 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 56 [2018-11-10 04:39:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:40,038 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2018-11-10 04:39:40,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:39:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2018-11-10 04:39:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 04:39:40,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:40,040 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:40,040 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:40,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1744296243, now seen corresponding path program 1 times [2018-11-10 04:39:40,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:40,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:40,083 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:40,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:40,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:39:40,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 04:39:40,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:39:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:39:40,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:39:40,135 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand 4 states. [2018-11-10 04:39:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:40,201 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2018-11-10 04:39:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:39:40,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-10 04:39:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:40,203 INFO L225 Difference]: With dead ends: 186 [2018-11-10 04:39:40,204 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 04:39:40,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:39:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 04:39:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2018-11-10 04:39:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 04:39:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2018-11-10 04:39:40,215 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 57 [2018-11-10 04:39:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:40,215 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2018-11-10 04:39:40,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:39:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2018-11-10 04:39:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 04:39:40,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:40,217 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:40,217 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:40,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1105818479, now seen corresponding path program 1 times [2018-11-10 04:39:40,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:40,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:40,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:40,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:40,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:40,321 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:40,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:39:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:40,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2018-11-10 04:39:40,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 04:39:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 04:39:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-10 04:39:40,465 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand 13 states. [2018-11-10 04:39:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:40,918 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2018-11-10 04:39:40,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 04:39:40,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-10 04:39:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:40,919 INFO L225 Difference]: With dead ends: 200 [2018-11-10 04:39:40,919 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 04:39:40,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:39:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 04:39:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 81. [2018-11-10 04:39:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 04:39:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2018-11-10 04:39:40,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 57 [2018-11-10 04:39:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:40,929 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2018-11-10 04:39:40,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 04:39:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2018-11-10 04:39:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 04:39:40,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:40,931 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:40,932 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:40,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 15098307, now seen corresponding path program 1 times [2018-11-10 04:39:40,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:40,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:40,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:40,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:40,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:40,986 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:40,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:41,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:41,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 10 [2018-11-10 04:39:41,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 04:39:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:39:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:39:41,100 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 10 states. [2018-11-10 04:39:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:41,297 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2018-11-10 04:39:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 04:39:41,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-10 04:39:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:41,302 INFO L225 Difference]: With dead ends: 180 [2018-11-10 04:39:41,303 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 04:39:41,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:39:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 04:39:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-11-10 04:39:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 04:39:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2018-11-10 04:39:41,313 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 58 [2018-11-10 04:39:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:41,314 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2018-11-10 04:39:41,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 04:39:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2018-11-10 04:39:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 04:39:41,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:41,315 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:41,315 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:41,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1665507476, now seen corresponding path program 1 times [2018-11-10 04:39:41,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:41,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:41,352 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:41,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 04:39:41,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:39:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:39:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:39:41,422 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand 5 states. [2018-11-10 04:39:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:41,475 INFO L93 Difference]: Finished difference Result 178 states and 231 transitions. [2018-11-10 04:39:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:39:41,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-10 04:39:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:41,477 INFO L225 Difference]: With dead ends: 178 [2018-11-10 04:39:41,477 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 04:39:41,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:39:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 04:39:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-11-10 04:39:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 04:39:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2018-11-10 04:39:41,486 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 60 [2018-11-10 04:39:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:41,486 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-10 04:39:41,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:39:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2018-11-10 04:39:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 04:39:41,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:41,487 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:39:41,487 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:41,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570678, now seen corresponding path program 1 times [2018-11-10 04:39:41,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:41,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:41,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:41,552 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:41,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:39:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:39:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 04:39:41,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 04:39:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:39:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:39:41,629 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand 10 states. [2018-11-10 04:39:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:41,821 INFO L93 Difference]: Finished difference Result 201 states and 262 transitions. [2018-11-10 04:39:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 04:39:41,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-11-10 04:39:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:41,823 INFO L225 Difference]: With dead ends: 201 [2018-11-10 04:39:41,823 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 04:39:41,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:39:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 04:39:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2018-11-10 04:39:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 04:39:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2018-11-10 04:39:41,832 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 62 [2018-11-10 04:39:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:41,832 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2018-11-10 04:39:41,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 04:39:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2018-11-10 04:39:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 04:39:41,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:41,833 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2018-11-10 04:39:41,833 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:41,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -13236933, now seen corresponding path program 1 times [2018-11-10 04:39:41,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:41,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:41,908 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:41,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:41,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:41,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 04:39:41,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:39:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:39:41,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:39:41,984 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 6 states. [2018-11-10 04:39:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:42,077 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2018-11-10 04:39:42,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 04:39:42,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-10 04:39:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:42,079 INFO L225 Difference]: With dead ends: 161 [2018-11-10 04:39:42,079 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 04:39:42,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:39:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 04:39:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-11-10 04:39:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 04:39:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2018-11-10 04:39:42,088 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 70 [2018-11-10 04:39:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:42,088 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2018-11-10 04:39:42,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:39:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2018-11-10 04:39:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 04:39:42,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:42,089 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2018-11-10 04:39:42,089 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:42,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:42,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1194924903, now seen corresponding path program 1 times [2018-11-10 04:39:42,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:42,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:42,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:42,161 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:42,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 04:39:42,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:42,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2018-11-10 04:39:42,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 04:39:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 04:39:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-10 04:39:42,322 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 15 states. [2018-11-10 04:39:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:42,950 INFO L93 Difference]: Finished difference Result 200 states and 258 transitions. [2018-11-10 04:39:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 04:39:42,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-10 04:39:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:42,952 INFO L225 Difference]: With dead ends: 200 [2018-11-10 04:39:42,952 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 04:39:42,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-11-10 04:39:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 04:39:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2018-11-10 04:39:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 04:39:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-11-10 04:39:42,961 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 72 [2018-11-10 04:39:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:42,961 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-11-10 04:39:42,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 04:39:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-11-10 04:39:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 04:39:42,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:42,963 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2018-11-10 04:39:42,964 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:42,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -794669882, now seen corresponding path program 1 times [2018-11-10 04:39:42,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:43,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:43,032 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:43,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:43,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 04:39:43,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:39:43,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:39:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:39:43,101 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 7 states. [2018-11-10 04:39:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:43,169 INFO L93 Difference]: Finished difference Result 210 states and 275 transitions. [2018-11-10 04:39:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 04:39:43,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 04:39:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:43,172 INFO L225 Difference]: With dead ends: 210 [2018-11-10 04:39:43,172 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 04:39:43,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-10 04:39:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 04:39:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-11-10 04:39:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 04:39:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2018-11-10 04:39:43,183 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 74 [2018-11-10 04:39:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:43,184 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2018-11-10 04:39:43,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:39:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-10 04:39:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 04:39:43,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:43,185 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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] [2018-11-10 04:39:43,185 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:43,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -224227868, now seen corresponding path program 1 times [2018-11-10 04:39:43,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:43,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:43,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 04:39:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2018-11-10 04:39:43,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 04:39:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 04:39:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-10 04:39:43,412 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand 16 states. [2018-11-10 04:39:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:43,867 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2018-11-10 04:39:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 04:39:43,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-11-10 04:39:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:43,869 INFO L225 Difference]: With dead ends: 242 [2018-11-10 04:39:43,870 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 04:39:43,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-11-10 04:39:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 04:39:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2018-11-10 04:39:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 04:39:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2018-11-10 04:39:43,883 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 76 [2018-11-10 04:39:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:43,884 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2018-11-10 04:39:43,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 04:39:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2018-11-10 04:39:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 04:39:43,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:43,885 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2018-11-10 04:39:43,885 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:43,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -980398131, now seen corresponding path program 1 times [2018-11-10 04:39:43,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 04:39:43,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:39:43,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:39:43,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:39:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:39:43,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:39:43,914 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand 4 states. [2018-11-10 04:39:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:43,935 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2018-11-10 04:39:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:39:43,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-10 04:39:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:43,937 INFO L225 Difference]: With dead ends: 125 [2018-11-10 04:39:43,937 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 04:39:43,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:39:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 04:39:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-10 04:39:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 04:39:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-10 04:39:43,951 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 78 [2018-11-10 04:39:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:43,951 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-10 04:39:43,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:39:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-10 04:39:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 04:39:43,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:43,952 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2018-11-10 04:39:43,953 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:43,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:43,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2109310867, now seen corresponding path program 1 times [2018-11-10 04:39:43,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:43,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:43,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:43,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:43,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:43,999 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:44,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:44,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:39:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:44,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 04:39:44,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 04:39:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 04:39:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-10 04:39:44,072 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 8 states. [2018-11-10 04:39:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:44,192 INFO L93 Difference]: Finished difference Result 231 states and 298 transitions. [2018-11-10 04:39:44,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 04:39:44,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-10 04:39:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:44,194 INFO L225 Difference]: With dead ends: 231 [2018-11-10 04:39:44,194 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 04:39:44,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-10 04:39:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 04:39:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-11-10 04:39:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 04:39:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-10 04:39:44,204 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 78 [2018-11-10 04:39:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:44,204 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-10 04:39:44,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 04:39:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2018-11-10 04:39:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:39:44,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:39:44,205 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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-11-10 04:39:44,206 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:39:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:39:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1709028751, now seen corresponding path program 1 times [2018-11-10 04:39:44,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:39:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:39:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:44,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:39:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:39:44,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:39:44,295 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:39:44,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:39:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:39:44,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:39:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:39:44,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:39:44,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-10 04:39:44,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 04:39:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 04:39:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-10 04:39:44,468 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 16 states. [2018-11-10 04:39:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:39:44,975 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2018-11-10 04:39:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 04:39:44,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-11-10 04:39:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:39:44,975 INFO L225 Difference]: With dead ends: 231 [2018-11-10 04:39:44,975 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:39:44,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-11-10 04:39:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:39:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:39:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:39:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:39:44,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-11-10 04:39:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:39:44,977 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:39:44,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 04:39:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:39:44,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:39:44,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:39:45,470 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 30 [2018-11-10 04:39:45,605 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse0 (<= |base2flt_#in~e| base2flt_~e)) (.cse1 (<= base2flt_~e |base2flt_#in~e|))) (or (and .cse0 (<= (+ |base2flt_#in~e| 128) 0)) (and (<= 127 |base2flt_#in~e|) .cse1) (and (<= base2flt_~m |base2flt_#in~m|) (= 0 base2flt_~__retres4~0) .cse0 (<= |base2flt_#in~m| base2flt_~m) .cse1) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))))) [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-10 04:39:45,605 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (and (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (<= base2flt_~e |base2flt_#in~e|)) [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (let ((.cse2 (div base2flt_~m 4294967296))) (let ((.cse0 (+ .cse2 1))) (let ((.cse1 (<= .cse0 0))) (and (<= |base2flt_#in~e| base2flt_~e) (forall ((base2flt_~m Int)) (or (< base2flt_~m |base2flt_#in~m|) (< |base2flt_#in~m| base2flt_~m) (< 0 (mod base2flt_~m 4294967296)))) (or (<= |base2flt_#in~m| base2flt_~m) (< 0 .cse0)) (or .cse1 (<= (+ (* 4294967296 .cse2) 16777216) |base2flt_#in~m|)) (or (<= base2flt_~m |base2flt_#in~m|) .cse1))))) [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-10 04:39:45,606 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (exists ((v_mulflt_~a_6 Int)) (< (mod v_mulflt_~a_6 4294967296) (mod |mulflt_#in~b| 4294967296)))) (.cse2 (= mulflt_~b |mulflt_#in~b|)) (.cse1 (= 0 mulflt_~__retres10~1))) (or (and .cse0 .cse1) (and .cse0 (= mulflt_~b |mulflt_#in~a|) (not (= (mod |mulflt_#in~a| 4294967296) 0))) (and (= mulflt_~a |mulflt_#in~a|) .cse2 (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (and .cse2 .cse1))) [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 04:39:45,607 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-10 04:39:45,607 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L428 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-10 04:39:45,608 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-10 04:39:45,608 INFO L421 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~tmp___0~0 0)) [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 04:39:45,609 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= 0 main_~zero~0))) (or (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0) .cse0) (and (<= (mod main_~b~0 4294967296) 0) .cse0) (<= (+ main_~sb~0 1) 0))) [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-10 04:39:45,609 INFO L425 ceAbstractionStarter]: For program point addfltENTRY(lines 73 136) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L133(lines 83 135) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-11-10 04:39:45,610 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 115 126) no Hoare annotation was computed. [2018-11-10 04:39:45,614 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,615 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,615 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,627 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,627 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,627 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,628 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,629 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,632 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,633 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,635 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,636 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:39:45 BoogieIcfgContainer [2018-11-10 04:39:45,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:39:45,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:39:45,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:39:45,638 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:39:45,643 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:39:38" (3/4) ... [2018-11-10 04:39:45,646 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:39:45,650 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:39:45,650 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-10 04:39:45,651 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-10 04:39:45,651 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:39:45,651 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 04:39:45,651 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-11-10 04:39:45,655 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-10 04:39:45,656 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 04:39:45,656 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:39:45,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e && \old(e) + 128 <= 0) || (127 <= \old(e) && e <= \old(e))) || ((((m <= \old(m) && 0 == __retres4) && \old(e) <= e) && \old(m) <= m) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-10 04:39:45,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) [2018-11-10 04:39:45,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e && (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296)) && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) [2018-11-10 04:39:45,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) [2018-11-10 04:39:45,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) [2018-11-10 04:39:45,702 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_15a20df5-c042-4b00-8997-c3c1e4a0efb2/bin-2019/uautomizer/witness.graphml [2018-11-10 04:39:45,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:39:45,703 INFO L168 Benchmark]: Toolchain (without parser) took 7316.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 960.3 MB in the beginning and 940.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,704 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:39:45,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.04 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,704 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,705 INFO L168 Benchmark]: RCFGBuilder took 325.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,705 INFO L168 Benchmark]: TraceAbstraction took 6683.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 162.1 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,705 INFO L168 Benchmark]: Witness Printer took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 947.1 MB in the beginning and 940.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:39:45,709 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.04 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.8 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6683.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 947.1 MB in the end (delta: 162.1 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 947.1 MB in the beginning and 940.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 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[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 25]: Loop Invariant [2018-11-10 04:39:45,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 18]: Loop Invariant [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (((\old(e) <= e && \old(e) + 128 <= 0) || (127 <= \old(e) && e <= \old(e))) || ((((m <= \old(m) && 0 == __retres4) && \old(e) <= e) && \old(m) <= m) && e <= \old(e))) || (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) - InvariantResult [Line: 47]: Loop Invariant [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (((\old(e) <= e && (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296)) && (\old(m) <= m || 0 < m / 4294967296 + 1)) && (m / 4294967296 + 1 <= 0 || 4294967296 * (m / 4294967296) + 16777216 <= \old(m))) && (m <= \old(m) || m / 4294967296 + 1 <= 0) - InvariantResult [Line: 147]: Loop Invariant [2018-11-10 04:39:45,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] [2018-11-10 04:39:45,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_6,QUANTIFIED] Derived loop invariant: ((((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && 0 == __retres10) || (((\exists v_mulflt_~a_6 : int :: v_mulflt_~a_6 % 4294967296 < \old(b) % 4294967296) && b == \old(a)) && !(\old(a) % 4294967296 == 0))) || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || (b == \old(b) && 0 == __retres10) - InvariantResult [Line: 27]: Loop Invariant [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] [2018-11-10 04:39:45,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[base2flt_~m,QUANTIFIED] Derived loop invariant: (forall base2flt_~m : int :: (base2flt_~m < \old(m) || \old(m) < base2flt_~m) || 0 < base2flt_~m % 4294967296) && e <= \old(e) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 74 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1017 SDtfs, 582 SDslu, 5723 SDs, 0 SdLazy, 3085 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1028 GetRequests, 842 SyntacticMatches, 9 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 255 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 321 PreInvPairs, 883 NumberOfFragments, 245 HoareAnnotationTreeSize, 321 FomulaSimplifications, 508192 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 5320 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1826 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1798 ConstructedInterpolants, 22 QuantifiedInterpolants, 256698 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2264 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 785/1191 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...