./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_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/config/TaipanReach.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_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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 05:33:40,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:33:40,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:33:41,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:33:41,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:33:41,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:33:41,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:33:41,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:33:41,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:33:41,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:33:41,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:33:41,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:33:41,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:33:41,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:33:41,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:33:41,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:33:41,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:33:41,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:33:41,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:33:41,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:33:41,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:33:41,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:33:41,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:33:41,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:33:41,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:33:41,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:33:41,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:33:41,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:33:41,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:33:41,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:33:41,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:33:41,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:33:41,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:33:41,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:33:41,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:33:41,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:33:41,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:33:41,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:33:41,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:33:41,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:33:41,034 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:33:41,034 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:33:41,034 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:33:41,034 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:33:41,035 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:33:41,035 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:33:41,035 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:33:41,035 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:33:41,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:33:41,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:33:41,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:33:41,037 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:33:41,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:33:41,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:33:41,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:33:41,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:33:41,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:33:41,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:33:41,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:33:41,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:33:41,039 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-11-10 05:33:41,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:33:41,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:33:41,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:33:41,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:33:41,072 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:33:41,073 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 05:33:41,107 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/data/c46875c80/890ebdf31c0343a5a210929e2c7f092d/FLAG59a270beb [2018-11-10 05:33:41,517 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:33:41,517 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 05:33:41,524 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/data/c46875c80/890ebdf31c0343a5a210929e2c7f092d/FLAG59a270beb [2018-11-10 05:33:41,535 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/data/c46875c80/890ebdf31c0343a5a210929e2c7f092d [2018-11-10 05:33:41,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:33:41,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:33:41,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:33:41,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:33:41,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:33:41,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1788b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41, skipping insertion in model container [2018-11-10 05:33:41,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:33:41,573 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:33:41,696 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:33:41,698 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:33:41,722 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:33:41,729 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:33:41,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41 WrapperNode [2018-11-10 05:33:41,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:33:41,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:33:41,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:33:41,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:33:41,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:33:41,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:33:41,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:33:41,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:33:41,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... [2018-11-10 05:33:41,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:33:41,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:33:41,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:33:41,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:33:41,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:33:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:33:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:33:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:33:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:33:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-10 05:33:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-10 05:33:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-10 05:33:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-10 05:33:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:33:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:33:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 05:33:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 05:33:42,038 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:33:42,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:42 BoogieIcfgContainer [2018-11-10 05:33:42,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:33:42,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:33:42,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:33:42,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:33:42,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:33:41" (1/3) ... [2018-11-10 05:33:42,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76141f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:42, skipping insertion in model container [2018-11-10 05:33:42,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:41" (2/3) ... [2018-11-10 05:33:42,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76141f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:42, skipping insertion in model container [2018-11-10 05:33:42,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:42" (3/3) ... [2018-11-10 05:33:42,044 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-10 05:33:42,050 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:33:42,054 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:33:42,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:33:42,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:33:42,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:33:42,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:33:42,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:33:42,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:33:42,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:33:42,087 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:33:42,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:33:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-10 05:33:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 05:33:42,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:42,105 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 05:33:42,106 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:42,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1192633110, now seen corresponding path program 1 times [2018-11-10 05:33:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:42,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:42,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:42,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:42,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:42,247 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 05:33:42,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:33:42,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:33:42,249 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:42,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:33:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:33:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:33:42,262 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-11-10 05:33:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:42,299 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-10 05:33:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:33:42,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 05:33:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:42,309 INFO L225 Difference]: With dead ends: 122 [2018-11-10 05:33:42,309 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 05:33:42,312 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 05:33:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 05:33:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-10 05:33:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 05:33:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-10 05:33:42,343 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-10 05:33:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:42,344 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-10 05:33:42,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:33:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-10 05:33:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 05:33:42,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:42,346 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 05:33:42,347 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:42,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash 817956730, now seen corresponding path program 1 times [2018-11-10 05:33:42,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:42,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:42,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:42,428 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 05:33:42,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:42,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:42,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-10 05:33:42,431 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [140], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:42,461 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:42,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:42,546 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:42,560 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:42,561 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 05:33:42,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:42,565 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:42,634 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-11-10 05:33:42,634 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:42,769 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-10 05:33:42,769 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:42,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:42,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-10 05:33:42,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:42,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:33:42,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:33:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:33:42,772 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 11 states. [2018-11-10 05:33:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:43,503 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-10 05:33:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 05:33:43,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-10 05:33:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:43,506 INFO L225 Difference]: With dead ends: 130 [2018-11-10 05:33:43,506 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 05:33:43,507 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:33:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 05:33:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-10 05:33:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 05:33:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-11-10 05:33:43,519 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 50 [2018-11-10 05:33:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:43,520 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-11-10 05:33:43,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:33:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-10 05:33:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 05:33:43,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:43,521 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 05:33:43,524 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:43,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1569223978, now seen corresponding path program 1 times [2018-11-10 05:33:43,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:43,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:43,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:43,563 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 05:33:43,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:43,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:43,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 05:33:43,564 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:43,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:43,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:43,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:43,582 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:43,582 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 05:33:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:43,583 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:43,615 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 71.85% of their original sizes. [2018-11-10 05:33:43,616 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:43,698 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 05:33:43,698 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:43,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:43,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-10 05:33:43,698 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:43,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:33:43,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:33:43,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:33:43,700 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 12 states. [2018-11-10 05:33:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:44,326 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-10 05:33:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 05:33:44,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-10 05:33:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:44,328 INFO L225 Difference]: With dead ends: 128 [2018-11-10 05:33:44,328 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 05:33:44,329 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-10 05:33:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 05:33:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-10 05:33:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 05:33:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-11-10 05:33:44,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 56 [2018-11-10 05:33:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:44,340 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-11-10 05:33:44,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:33:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-11-10 05:33:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 05:33:44,343 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:44,343 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 05:33:44,343 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:44,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1810436268, now seen corresponding path program 1 times [2018-11-10 05:33:44,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:44,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:44,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:44,428 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 05:33:44,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:44,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:44,429 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 05:33:44,429 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [33], [65], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:44,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:44,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:44,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:44,444 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:44,445 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-11-10 05:33:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:44,450 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:44,478 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64.67% of their original sizes. [2018-11-10 05:33:44,479 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:44,545 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 05:33:44,545 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:44,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:44,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-10 05:33:44,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:44,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:33:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:33:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:33:44,546 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 12 states. [2018-11-10 05:33:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:45,019 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2018-11-10 05:33:45,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 05:33:45,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-10 05:33:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:45,020 INFO L225 Difference]: With dead ends: 136 [2018-11-10 05:33:45,020 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 05:33:45,020 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-11-10 05:33:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 05:33:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-11-10 05:33:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 05:33:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-11-10 05:33:45,029 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 58 [2018-11-10 05:33:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:45,029 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-11-10 05:33:45,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:33:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-11-10 05:33:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:33:45,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:45,030 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 05:33:45,030 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:45,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1332257313, now seen corresponding path program 1 times [2018-11-10 05:33:45,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:45,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:45,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:45,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:45,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:45,083 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 05:33:45,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:45,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:45,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 05:33:45,083 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:45,084 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:45,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:45,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:45,235 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:45,235 INFO L272 AbstractInterpreter]: Visited 34 different actions 275 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:33:45,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:45,258 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:45,314 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 64.38% of their original sizes. [2018-11-10 05:33:45,314 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:45,639 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 05:33:45,639 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:45,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:45,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [5] total 27 [2018-11-10 05:33:45,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:45,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 05:33:45,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 05:33:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:33:45,641 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 24 states. [2018-11-10 05:33:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:47,532 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2018-11-10 05:33:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 05:33:47,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-11-10 05:33:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:47,533 INFO L225 Difference]: With dead ends: 135 [2018-11-10 05:33:47,533 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 05:33:47,534 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 05:33:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 05:33:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2018-11-10 05:33:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 05:33:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2018-11-10 05:33:47,565 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 60 [2018-11-10 05:33:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:47,565 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2018-11-10 05:33:47,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 05:33:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-10 05:33:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:33:47,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:47,567 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 05:33:47,568 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:47,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1951592733, now seen corresponding path program 1 times [2018-11-10 05:33:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:47,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:47,627 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 05:33:47,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:47,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:47,628 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 05:33:47,628 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [74], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:47,629 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:47,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:47,632 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:47,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:47,727 INFO L272 AbstractInterpreter]: Visited 42 different actions 283 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:33:47,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:47,742 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:47,779 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 66.71% of their original sizes. [2018-11-10 05:33:47,779 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:48,192 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 05:33:48,192 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:48,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:48,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [5] total 33 [2018-11-10 05:33:48,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:48,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 05:33:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 05:33:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-11-10 05:33:48,193 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 30 states. [2018-11-10 05:33:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:50,107 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2018-11-10 05:33:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 05:33:50,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-11-10 05:33:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:50,109 INFO L225 Difference]: With dead ends: 120 [2018-11-10 05:33:50,109 INFO L226 Difference]: Without dead ends: 114 [2018-11-10 05:33:50,110 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=2400, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 05:33:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-10 05:33:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2018-11-10 05:33:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 05:33:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-10 05:33:50,120 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 60 [2018-11-10 05:33:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:50,121 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-10 05:33:50,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 05:33:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-10 05:33:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:33:50,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:50,122 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 05:33:50,122 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:50,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2008851035, now seen corresponding path program 1 times [2018-11-10 05:33:50,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:50,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:50,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:50,181 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 05:33:50,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:50,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:50,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-10 05:33:50,182 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [67], [68], [69], [74], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [147], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:50,183 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:50,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:50,185 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:50,258 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:50,258 INFO L272 AbstractInterpreter]: Visited 46 different actions 287 times. Merged at 7 different actions 184 times. Widened at 2 different actions 28 times. Found 25 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:33:50,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:50,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:50,306 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 67.41% of their original sizes. [2018-11-10 05:33:50,306 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:50,824 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-10 05:33:50,824 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:50,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:50,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [5] total 37 [2018-11-10 05:33:50,824 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:50,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 05:33:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 05:33:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 05:33:50,826 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 34 states. [2018-11-10 05:33:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:53,598 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2018-11-10 05:33:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 05:33:53,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 60 [2018-11-10 05:33:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:53,599 INFO L225 Difference]: With dead ends: 122 [2018-11-10 05:33:53,599 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 05:33:53,601 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=3571, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 05:33:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 05:33:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-11-10 05:33:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 05:33:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-10 05:33:53,610 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 60 [2018-11-10 05:33:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:53,611 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-10 05:33:53,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 05:33:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-10 05:33:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 05:33:53,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:53,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:53,612 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:53,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash -840271592, now seen corresponding path program 1 times [2018-11-10 05:33:53,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:53,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:53,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:53,644 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 05:33:53,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:53,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:53,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 05:33:53,644 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:53,646 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:53,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:53,648 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:53,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:53,819 INFO L272 AbstractInterpreter]: Visited 47 different actions 527 times. Merged at 19 different actions 346 times. Widened at 2 different actions 48 times. Found 46 fixpoints after 7 different actions. Largest state had 23 variables. [2018-11-10 05:33:53,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:53,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:53,873 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 65.18% of their original sizes. [2018-11-10 05:33:53,873 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:54,485 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 05:33:54,485 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:54,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:54,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [5] total 37 [2018-11-10 05:33:54,485 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:54,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 05:33:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 05:33:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 05:33:54,486 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 34 states. [2018-11-10 05:33:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:57,517 INFO L93 Difference]: Finished difference Result 153 states and 191 transitions. [2018-11-10 05:33:57,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 05:33:57,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-11-10 05:33:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:57,520 INFO L225 Difference]: With dead ends: 153 [2018-11-10 05:33:57,520 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 05:33:57,521 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=382, Invalid=3524, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 05:33:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 05:33:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2018-11-10 05:33:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 05:33:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2018-11-10 05:33:57,535 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 65 [2018-11-10 05:33:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:57,535 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2018-11-10 05:33:57,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 05:33:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2018-11-10 05:33:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 05:33:57,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:57,536 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:57,536 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1153873114, now seen corresponding path program 1 times [2018-11-10 05:33:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:57,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:57,584 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 05:33:57,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:33:57,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:33:57,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:57,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:33:57,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:33:57,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:33:57,585 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 4 states. [2018-11-10 05:33:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:57,602 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2018-11-10 05:33:57,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:33:57,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 05:33:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:57,603 INFO L225 Difference]: With dead ends: 118 [2018-11-10 05:33:57,603 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 05:33:57,604 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 05:33:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 05:33:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-10 05:33:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 05:33:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-10 05:33:57,611 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 65 [2018-11-10 05:33:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:57,612 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-10 05:33:57,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:33:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-10 05:33:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 05:33:57,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:57,613 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:57,613 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:57,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1101763500, now seen corresponding path program 1 times [2018-11-10 05:33:57,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:57,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:57,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:57,644 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 05:33:57,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:57,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:57,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-10 05:33:57,644 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [55], [65], [67], [68], [69], [72], [78], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:57,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:57,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:57,649 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:57,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 05:33:57,731 INFO L272 AbstractInterpreter]: Visited 47 different actions 424 times. Merged at 19 different actions 274 times. Widened at 2 different actions 39 times. Found 36 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-10 05:33:57,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:57,738 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 05:33:57,770 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 75.69% of their original sizes. [2018-11-10 05:33:57,770 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 05:33:58,031 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-10 05:33:58,031 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 05:33:58,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:33:58,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [5] total 29 [2018-11-10 05:33:58,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:33:58,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 05:33:58,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 05:33:58,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-11-10 05:33:58,032 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 26 states. [2018-11-10 05:33:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:59,089 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-11-10 05:33:59,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 05:33:59,089 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-10 05:33:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:59,090 INFO L225 Difference]: With dead ends: 125 [2018-11-10 05:33:59,090 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 05:33:59,091 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 05:33:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 05:33:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2018-11-10 05:33:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 05:33:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-11-10 05:33:59,099 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 65 [2018-11-10 05:33:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:59,100 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-11-10 05:33:59,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 05:33:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-10 05:33:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 05:33:59,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:59,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:59,101 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:59,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:59,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1800460031, now seen corresponding path program 1 times [2018-11-10 05:33:59,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:59,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:59,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:59,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:59,104 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:59,136 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 05:33:59,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:59,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:59,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-10 05:33:59,136 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:59,137 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:59,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:59,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:59,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:33:59,302 INFO L272 AbstractInterpreter]: Visited 53 different actions 596 times. Merged at 21 different actions 394 times. Widened at 2 different actions 65 times. Found 49 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:33:59,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:59,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:33:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:59,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:33:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:59,328 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:33:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:59,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:33:59,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:33:59,476 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 05:33:59,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:33:59,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 05:33:59,493 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:33:59,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:33:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:33:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:33:59,494 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 5 states. [2018-11-10 05:33:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:33:59,553 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2018-11-10 05:33:59,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:33:59,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-10 05:33:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:33:59,555 INFO L225 Difference]: With dead ends: 160 [2018-11-10 05:33:59,555 INFO L226 Difference]: Without dead ends: 106 [2018-11-10 05:33:59,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:33:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-10 05:33:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2018-11-10 05:33:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 05:33:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-11-10 05:33:59,565 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 66 [2018-11-10 05:33:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:33:59,565 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-11-10 05:33:59,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:33:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-11-10 05:33:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 05:33:59,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:33:59,566 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:33:59,566 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:33:59,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1320929471, now seen corresponding path program 1 times [2018-11-10 05:33:59,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:33:59,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:59,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:59,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:33:59,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:33:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:33:59,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:59,620 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:33:59,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-10 05:33:59,620 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [59], [65], [67], [68], [69], [72], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:33:59,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:33:59,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:33:59,625 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:33:59,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:33:59,784 INFO L272 AbstractInterpreter]: Visited 54 different actions 675 times. Merged at 22 different actions 480 times. Widened at 3 different actions 105 times. Found 59 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:33:59,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:33:59,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:33:59,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:33:59,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:33:59,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:33:59,802 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:33:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:33:59,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:33:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 05:33:59,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:34:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 05:34:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:34:00,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2018-11-10 05:34:00,098 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:34:00,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:34:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:34:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-10 05:34:00,099 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 14 states. [2018-11-10 05:34:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:00,523 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2018-11-10 05:34:00,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 05:34:00,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-10 05:34:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:00,525 INFO L225 Difference]: With dead ends: 205 [2018-11-10 05:34:00,525 INFO L226 Difference]: Without dead ends: 150 [2018-11-10 05:34:00,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 05:34:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-10 05:34:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 98. [2018-11-10 05:34:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 05:34:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-11-10 05:34:00,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 68 [2018-11-10 05:34:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:00,540 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-11-10 05:34:00,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:34:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-11-10 05:34:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 05:34:00,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:34:00,541 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 05:34:00,541 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:34:00,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 925129036, now seen corresponding path program 1 times [2018-11-10 05:34:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:34:00,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:00,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:00,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:00,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:34:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:00,569 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 05:34:00,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:00,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:34:00,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-10 05:34:00,569 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [53], [59], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:34:00,570 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:34:00,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:34:00,574 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:34:00,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:34:00,741 INFO L272 AbstractInterpreter]: Visited 53 different actions 610 times. Merged at 21 different actions 400 times. Widened at 2 different actions 65 times. Found 49 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:34:00,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:00,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:34:00,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:00,750 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/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 05:34:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:00,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:34:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:00,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:34:00,790 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 05:34:00,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:34:00,868 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 05:34:00,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:34:00,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-10 05:34:00,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:34:00,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:34:00,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:34:00,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:34:00,885 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 6 states. [2018-11-10 05:34:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:00,938 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2018-11-10 05:34:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:34:00,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-10 05:34:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:00,941 INFO L225 Difference]: With dead ends: 205 [2018-11-10 05:34:00,941 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 05:34:00,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:34:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 05:34:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2018-11-10 05:34:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 05:34:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-11-10 05:34:00,954 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 70 [2018-11-10 05:34:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:00,954 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-11-10 05:34:00,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:34:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-11-10 05:34:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 05:34:00,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:34:00,955 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 05:34:00,955 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:34:00,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:00,956 INFO L82 PathProgramCache]: Analyzing trace with hash 990456522, now seen corresponding path program 1 times [2018-11-10 05:34:00,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:34:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:00,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:00,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:00,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:34:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:01,009 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 05:34:01,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:01,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:34:01,009 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-10 05:34:01,009 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [53], [59], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:34:01,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:34:01,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:34:01,013 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:34:01,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:34:01,177 INFO L272 AbstractInterpreter]: Visited 54 different actions 702 times. Merged at 22 different actions 492 times. Widened at 3 different actions 105 times. Found 59 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-10 05:34:01,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:01,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:34:01,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:01,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/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 05:34:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:01,195 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:34:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:01,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:34:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 05:34:01,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:34:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:34:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:34:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 14] total 27 [2018-11-10 05:34:01,632 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:34:01,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:34:01,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:34:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-11-10 05:34:01,633 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 15 states. [2018-11-10 05:34:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:02,049 INFO L93 Difference]: Finished difference Result 232 states and 292 transitions. [2018-11-10 05:34:02,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 05:34:02,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-10 05:34:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:02,051 INFO L225 Difference]: With dead ends: 232 [2018-11-10 05:34:02,051 INFO L226 Difference]: Without dead ends: 156 [2018-11-10 05:34:02,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 05:34:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-10 05:34:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2018-11-10 05:34:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 05:34:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2018-11-10 05:34:02,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 72 [2018-11-10 05:34:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:02,066 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2018-11-10 05:34:02,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:34:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2018-11-10 05:34:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 05:34:02,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:34:02,067 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 05:34:02,067 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:34:02,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1054728999, now seen corresponding path program 1 times [2018-11-10 05:34:02,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:34:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:02,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:34:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:02,095 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 05:34:02,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:02,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:34:02,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-11-10 05:34:02,096 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [26], [28], [31], [39], [43], [49], [55], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:34:02,096 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:34:02,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:34:02,100 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:34:02,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:34:02,194 INFO L272 AbstractInterpreter]: Visited 53 different actions 485 times. Merged at 21 different actions 312 times. Widened at 2 different actions 52 times. Found 37 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 05:34:02,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:02,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:34:02,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:02,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/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 05:34:02,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:02,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:34:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:02,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:34:02,243 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 05:34:02,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:34:02,314 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 05:34:02,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:34:02,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-10 05:34:02,330 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:34:02,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:34:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:34:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:34:02,331 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2018-11-10 05:34:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:02,399 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2018-11-10 05:34:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:34:02,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 05:34:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:02,401 INFO L225 Difference]: With dead ends: 226 [2018-11-10 05:34:02,401 INFO L226 Difference]: Without dead ends: 154 [2018-11-10 05:34:02,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:34:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-10 05:34:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2018-11-10 05:34:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 05:34:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2018-11-10 05:34:02,416 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 74 [2018-11-10 05:34:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:02,416 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2018-11-10 05:34:02,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:34:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2018-11-10 05:34:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 05:34:02,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:34:02,417 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2018-11-10 05:34:02,417 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:34:02,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:02,417 INFO L82 PathProgramCache]: Analyzing trace with hash 535838743, now seen corresponding path program 1 times [2018-11-10 05:34:02,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:34:02,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:02,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:02,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:34:02,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:34:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:34:02,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:02,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:34:02,482 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-11-10 05:34:02,482 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [16], [22], [28], [31], [33], [39], [43], [49], [55], [65], [67], [68], [69], [74], [80], [83], [109], [110], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-10 05:34:02,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:34:02,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:34:02,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:34:02,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:34:02,602 INFO L272 AbstractInterpreter]: Visited 53 different actions 568 times. Merged at 21 different actions 398 times. Widened at 3 different actions 90 times. Found 48 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-10 05:34:02,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:34:02,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:34:02,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:34:02,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/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 05:34:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:34:02,635 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:34:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:34:02,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:34:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 05:34:02,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:34:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 05:34:02,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:34:02,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2018-11-10 05:34:02,976 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:34:02,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 05:34:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 05:34:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-11-10 05:34:02,977 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand 15 states. [2018-11-10 05:34:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:34:03,389 INFO L93 Difference]: Finished difference Result 231 states and 291 transitions. [2018-11-10 05:34:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 05:34:03,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-10 05:34:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:34:03,391 INFO L225 Difference]: With dead ends: 231 [2018-11-10 05:34:03,391 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:34:03,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-11-10 05:34:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:34:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:34:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:34:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:34:03,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-11-10 05:34:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:34:03,392 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:34:03,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 05:34:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:34:03,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:34:03,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:34:03,542 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-10 05:34:03,685 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-10 05:34:03,825 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-10 05:34:03,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:03,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:03,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:03,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:03,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:03,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,115 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 131 [2018-11-10 05:34:04,218 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 113 [2018-11-10 05:34:04,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,510 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 132 [2018-11-10 05:34:04,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,772 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2018-11-10 05:34:04,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:04,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:34:05,396 WARN L179 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 41 [2018-11-10 05:34:06,301 WARN L179 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 39 [2018-11-10 05:34:06,622 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-11-10 05:34:06,936 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 49 [2018-11-10 05:34:06,968 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:34:06,968 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:34:06,968 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-10 05:34:06,968 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (let ((.cse1 (* 2 base2flt_~e)) (.cse0 (not (= |base2flt_#in~e| 0)))) (and (or .cse0 (<= .cse1 0) (not (= |base2flt_#in~m| 1))) (let ((.cse2 (* 2 |base2flt_#in~e|))) (or (and (<= 0 (+ .cse1 256)) (<= .cse1 254)) (< (+ .cse2 256) 0) (< 254 .cse2))) (let ((.cse3 (* 2 |base2flt_#in~m|))) (or (and (= base2flt_~e 0) (= base2flt_~m 0) (= base2flt_~__retres4~0 0)) .cse0 (< .cse3 0) (< 0 .cse3))))) [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse1 (* 2 base2flt_~e)) (.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (and (<= (+ base2flt_~e 1) base2flt_~m) (= base2flt_~e 0) (<= (+ base2flt_~e base2flt_~m) 1)) (not (= |base2flt_#in~m| 1)) .cse0 (and (<= (+ .cse1 2) 0) (= (mod base2flt_~m 2) 0) (<= 4 (* 2 base2flt_~m)))) (let ((.cse2 (* 2 |base2flt_#in~e|))) (or (and (<= 0 (+ .cse1 256)) (not (= base2flt_~m 0)) (<= .cse1 254)) (< (+ .cse2 256) 0) (< 254 .cse2))) (let ((.cse3 (* 2 |base2flt_#in~m|))) (or .cse0 (< .cse3 0) (< 0 .cse3))))) [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (* 2 base2flt_~e)) (.cse2 (not (= |base2flt_#in~e| 0)))) (and (let ((.cse1 (* 2 |base2flt_#in~e|))) (or (and (<= 0 (+ .cse0 256)) (<= .cse0 254)) (< (+ .cse1 256) 0) (< 254 .cse1))) (or (not (= |base2flt_#in~m| 1)) .cse2 (and (<= (+ .cse0 2) 0) (= (mod base2flt_~m 2) 0) (<= 4 (* 2 base2flt_~m)))) (let ((.cse3 (* 2 |base2flt_#in~m|))) (or .cse2 (< .cse3 0) (< 0 .cse3))))) [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-10 05:34:06,969 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (let ((.cse0 (* 2 |base2flt_#in~e|))) (or (< (+ .cse0 256) 0) (and (<= |base2flt_#in~e| base2flt_~e) (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= (* 2 base2flt_~e) 254))) (< 254 .cse0))) [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-10 05:34:06,970 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse1 (* 2 |mulflt_#in~a|))) (let ((.cse0 (let ((.cse6 (* 2 mulflt_~__retres10~1))) (and (<= .cse6 0) (<= 0 .cse6)))) (.cse4 (+ |mulflt_#in~b| |mulflt_#in~a|)) (.cse5 (< .cse1 0))) (and (or .cse0 (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (or .cse0 (and (= mulflt_~a |mulflt_#in~a|) (= mulflt_~b |mulflt_#in~b|)) (and (= mulflt_~b |mulflt_#in~a|) (not (= (mod |mulflt_#in~a| 4294967296) 0)))) (or (not (= (mod |mulflt_#in~b| 4294967295) 0)) (< 8589934590 .cse1) (< (* 2 |mulflt_#in~b|) 0) (let ((.cse2 (* 2 mulflt_~b)) (.cse3 (* 2 mulflt_~a))) (and (<= .cse2 8589934590) (<= 0 .cse3) (= (mod mulflt_~b 4294967295) 0) (= (mod mulflt_~a 4294967295) 0) (<= 0 .cse2) (<= .cse3 8589934590))) (not (= (mod |mulflt_#in~a| 4294967295) 0)) (< 8589934590 .cse4) (< (+ |mulflt_#in~a| 4294967295) |mulflt_#in~b|) .cse5) (or (and (= mulflt_~b 0) (<= mulflt_~a mulflt_~b)) (not (= |mulflt_#in~b| 0)) (< 0 .cse4) .cse5)))) [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-10 05:34:06,971 INFO L421 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: (let ((.cse0 (* 2 main_~eb~2)) (.cse1 (* 2 main_~ea~2))) (and (<= .cse0 254) (<= 0 (+ .cse1 256)) (<= 0 (+ .cse0 256)) (<= .cse1 254))) [2018-11-10 05:34:06,971 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L421 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (let ((.cse0 (* 2 main_~tmp___1~0)) (.cse1 (* 2 main_~tmp___0~0))) (and (<= 0 .cse0) (<= 0 (+ (* 2 main_~eb~2) 256)) (<= .cse0 0) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (<= 0 .cse1) (= main_~zero~0 0) (<= .cse1 0) (<= main_~zero~0 (+ main_~ea~2 128)))) [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 05:34:06,972 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse2 (<= 0 (+ (* 2 main_~eb~2) 256))) (.cse0 (<= main_~zero~0 (+ main_~ea~2 128))) (.cse3 (<= (+ main_~ea~2 main_~zero~0) 127)) (.cse1 (<= main_~eb~2 (+ main_~zero~0 127)))) (or (and .cse0 .cse1 (<= (mod main_~b~0 4294967296) 0) (<= (* 2 main_~tmp~2) 0) .cse2 (<= main_~sb~0 main_~zero~0) (<= main_~zero~0 main_~tmp~2) .cse3) (<= (+ main_~sb~0 1) 0) (and (<= 1 main_~tmp~2) .cse2 (<= 1 main_~sb~0) .cse0 .cse3 .cse1 (= main_~zero~0 0)))) [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (and (<= 0 (+ (* 2 main_~eb~2) 256)) (<= (+ main_~ea~2 main_~zero~0) 127) (<= main_~eb~2 (+ main_~zero~0 127)) (= main_~zero~0 0) (<= main_~zero~0 (+ main_~ea~2 128))) [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-10 05:34:06,972 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-10 05:34:06,973 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-10 05:34:06,973 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-10 05:34:06,973 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-10 05:34:06,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:34:06 BoogieIcfgContainer [2018-11-10 05:34:06,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:34:06,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:34:06,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:34:06,993 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:34:06,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:33:42" (3/4) ... [2018-11-10 05:34:06,998 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:34:07,003 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:34:07,003 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-10 05:34:07,003 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-10 05:34:07,003 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:34:07,003 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 05:34:07,008 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-10 05:34:07,008 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 05:34:07,009 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:34:07,025 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(e) == 0) || 2 * e <= 0) || !(\old(m) == 1)) && (((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && (((((e == 0 && m == 0) && __retres4 == 0) || !(\old(e) == 0)) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) [2018-11-10 05:34:07,025 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((e + 1 <= m && e == 0) && e + m <= 1) || !(\old(m) == 1)) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((((0 <= 2 * e + 256 && !(m == 0)) && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) [2018-11-10 05:34:07,025 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (2 * \old(e) + 256 < 0 || (\old(e) <= e && (4194304 <= \old(m) || \old(m) + 1 <= 0) && 2 * e <= 254)) || 254 < 2 * \old(e) [2018-11-10 05:34:07,025 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e)) && ((!(\old(m) == 1) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m))) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) [2018-11-10 05:34:07,026 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || !(0 == \old(b) % 4294967296)) && (((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || (a == \old(a) && b == \old(b))) || (b == \old(a) && !(\old(a) % 4294967296 == 0)))) && (((((((!(\old(b) % 4294967295 == 0) || 8589934590 < 2 * \old(a)) || 2 * \old(b) < 0) || (((((2 * b <= 8589934590 && 0 <= 2 * a) && b % 4294967295 == 0) && a % 4294967295 == 0) && 0 <= 2 * b) && 2 * a <= 8589934590)) || !(\old(a) % 4294967295 == 0)) || 8589934590 < \old(b) + \old(a)) || \old(a) + 4294967295 < \old(b)) || 2 * \old(a) < 0)) && ((((b == 0 && a <= b) || !(\old(b) == 0)) || 0 < \old(b) + \old(a)) || 2 * \old(a) < 0) [2018-11-10 05:34:07,047 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_547553f9-0435-423e-9436-b06530dcc726/bin-2019/utaipan/witness.graphml [2018-11-10 05:34:07,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:34:07,048 INFO L168 Benchmark]: Toolchain (without parser) took 25510.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 590.9 MB). Free memory was 960.2 MB in the beginning and 1.5 GB in the end (delta: -558.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:34:07,048 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:34:07,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.66 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:34:07,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.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 05:34:07,048 INFO L168 Benchmark]: Boogie Preprocessor took 19.09 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:34:07,049 INFO L168 Benchmark]: RCFGBuilder took 240.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:34:07,049 INFO L168 Benchmark]: TraceAbstraction took 24953.43 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -394.0 MB). Peak memory consumption was 720.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:34:07,049 INFO L168 Benchmark]: Witness Printer took 54.39 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:34:07,050 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.66 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 944.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.09 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 240.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24953.43 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -394.0 MB). Peak memory consumption was 720.0 MB. Max. memory is 11.5 GB. * Witness Printer took 54.39 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 Derived loop invariant: ((((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e)) && ((!(\old(m) == 1) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m))) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((!(\old(e) == 0) || 2 * e <= 0) || !(\old(m) == 1)) && (((0 <= 2 * e + 256 && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && (((((e == 0 && m == 0) && __retres4 == 0) || !(\old(e) == 0)) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (2 * \old(e) + 256 < 0 || (\old(e) <= e && (4194304 <= \old(m) || \old(m) + 1 <= 0) && 2 * e <= 254)) || 254 < 2 * \old(e) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || !(0 == \old(b) % 4294967296)) && (((2 * __retres10 <= 0 && 0 <= 2 * __retres10) || (a == \old(a) && b == \old(b))) || (b == \old(a) && !(\old(a) % 4294967296 == 0)))) && (((((((!(\old(b) % 4294967295 == 0) || 8589934590 < 2 * \old(a)) || 2 * \old(b) < 0) || (((((2 * b <= 8589934590 && 0 <= 2 * a) && b % 4294967295 == 0) && a % 4294967295 == 0) && 0 <= 2 * b) && 2 * a <= 8589934590)) || !(\old(a) % 4294967295 == 0)) || 8589934590 < \old(b) + \old(a)) || \old(a) + 4294967295 < \old(b)) || 2 * \old(a) < 0)) && ((((b == 0 && a <= b) || !(\old(b) == 0)) || 0 < \old(b) + \old(a)) || 2 * \old(a) < 0) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((e + 1 <= m && e == 0) && e + m <= 1) || !(\old(m) == 1)) || !(\old(e) == 0)) || ((2 * e + 2 <= 0 && m % 2 == 0) && 4 <= 2 * m)) && ((((0 <= 2 * e + 256 && !(m == 0)) && 2 * e <= 254) || 2 * \old(e) + 256 < 0) || 254 < 2 * \old(e))) && ((!(\old(e) == 0) || 2 * \old(m) < 0) || 0 < 2 * \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. SAFE Result, 24.8s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1000 SDtfs, 1348 SDslu, 9427 SDs, 0 SdLazy, 2229 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 1563 GetRequests, 1112 SyntacticMatches, 11 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 14 AbstIntIterations, 8 AbstIntStrong, 0.9241396315943794 AbsIntWeakeningRatio, 1.3240343347639485 AbsIntAvgWeakeningVarsNumRemoved, 22.628755364806867 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 367 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 235 PreInvPairs, 516 NumberOfFragments, 647 HoareAnnotationTreeSize, 235 FomulaSimplifications, 18797716 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 18 FomulaSimplificationsInter, 4027376 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1439 NumberOfCodeBlocks, 1439 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1837 ConstructedInterpolants, 23 QuantifiedInterpolants, 283495 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 739/1104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...