./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-aa41828 [2018-11-23 04:27:47,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:27:47,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:27:47,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:27:47,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:27:47,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:27:47,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:27:47,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:27:47,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:27:47,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:27:47,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:27:47,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:27:47,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:27:47,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:27:47,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:27:47,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:27:47,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:27:47,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:27:47,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:27:47,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:27:47,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:27:47,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:27:47,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:27:47,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:27:47,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:27:47,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:27:47,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:27:47,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:27:47,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:27:47,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:27:47,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:27:47,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:27:47,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:27:47,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:27:47,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:27:47,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:27:47,382 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 04:27:47,391 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:27:47,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:27:47,392 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:27:47,392 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:27:47,392 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:27:47,392 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:27:47,393 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:27:47,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:27:47,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:27:47,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:27:47,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:27:47,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:27:47,396 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:27:47,396 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_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:27:47,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:27:47,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:27:47,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:27:47,431 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:27:47,431 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:27:47,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-23 04:27:47,468 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/data/79b8e1e89/e6ba88f74871466fbe1196f969eab074/FLAG05d25e36e [2018-11-23 04:27:47,813 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:27:47,813 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-23 04:27:47,819 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/data/79b8e1e89/e6ba88f74871466fbe1196f969eab074/FLAG05d25e36e [2018-11-23 04:27:48,229 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/data/79b8e1e89/e6ba88f74871466fbe1196f969eab074 [2018-11-23 04:27:48,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:27:48,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:27:48,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:27:48,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:27:48,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:27:48,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c83c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48, skipping insertion in model container [2018-11-23 04:27:48,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:27:48,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:27:48,400 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:27:48,402 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:27:48,427 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:27:48,435 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:27:48,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48 WrapperNode [2018-11-23 04:27:48,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:27:48,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:27:48,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:27:48,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:27:48,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:27:48,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:27:48,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:27:48,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:27:48,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... [2018-11-23 04:27:48,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:27:48,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:27:48,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:27:48,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:27:48,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:27:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-23 04:27:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-23 04:27:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:27:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:27:48,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:27:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 04:27:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 04:27:48,721 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:27:48,721 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 04:27:48,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:27:48 BoogieIcfgContainer [2018-11-23 04:27:48,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:27:48,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:27:48,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:27:48,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:27:48,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:27:48" (1/3) ... [2018-11-23 04:27:48,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fad4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:27:48, skipping insertion in model container [2018-11-23 04:27:48,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:27:48" (2/3) ... [2018-11-23 04:27:48,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fad4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:27:48, skipping insertion in model container [2018-11-23 04:27:48,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:27:48" (3/3) ... [2018-11-23 04:27:48,727 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-23 04:27:48,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:27:48,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:27:48,746 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:27:48,764 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:27:48,764 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:27:48,764 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:27:48,764 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:27:48,764 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:27:48,764 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:27:48,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:27:48,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:27:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 04:27:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 04:27:48,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:48,780 INFO L402 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-23 04:27:48,782 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:48,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-11-23 04:27:48,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:48,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:48,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:48,922 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-23 04:27:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:27:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:27:48,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:48,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:27:48,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:27:48,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:27:48,937 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-11-23 04:27:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:48,974 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-11-23 04:27:48,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:27:48,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 04:27:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:48,982 INFO L225 Difference]: With dead ends: 118 [2018-11-23 04:27:48,982 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 04:27:48,985 INFO L631 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-23 04:27:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 04:27:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 04:27:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 04:27:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-11-23 04:27:49,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-11-23 04:27:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:49,016 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-11-23 04:27:49,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:27:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-11-23 04:27:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:27:49,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:49,018 INFO L402 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-23 04:27:49,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:49,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-11-23 04:27:49,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:49,079 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-23 04:27:49,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:27:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:27:49,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:49,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:27:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:27:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:27:49,081 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-11-23 04:27:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:49,114 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-11-23 04:27:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:27:49,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-23 04:27:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:49,115 INFO L225 Difference]: With dead ends: 64 [2018-11-23 04:27:49,115 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 04:27:49,116 INFO L631 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-23 04:27:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 04:27:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 04:27:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 04:27:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-11-23 04:27:49,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-11-23 04:27:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:49,123 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-11-23 04:27:49,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:27:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-11-23 04:27:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 04:27:49,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:49,124 INFO L402 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-23 04:27:49,125 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:49,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-11-23 04:27:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:49,191 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-23 04:27:49,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:49,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:49,192 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 04:27:49,193 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [138], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:49,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:49,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:49,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:49,301 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 43 root evaluator evaluations with a maximum evaluation depth of 3. Performed 43 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 04:27:49,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:49,313 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:49,355 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-11-23 04:27:49,355 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:49,405 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 04:27:49,406 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:49,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:49,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-23 04:27:49,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:49,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 04:27:49,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:27:49,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:27:49,408 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 10 states. [2018-11-23 04:27:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:49,873 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-11-23 04:27:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 04:27:49,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-23 04:27:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:49,876 INFO L225 Difference]: With dead ends: 124 [2018-11-23 04:27:49,876 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 04:27:49,877 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:27:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 04:27:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-11-23 04:27:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 04:27:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-11-23 04:27:49,884 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2018-11-23 04:27:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:49,885 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-23 04:27:49,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 04:27:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-11-23 04:27:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 04:27:49,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:49,886 INFO L402 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] [2018-11-23 04:27:49,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:49,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-11-23 04:27:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:49,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:49,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:49,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:49,927 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-23 04:27:49,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:49,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:49,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-23 04:27:49,928 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:49,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:49,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:49,939 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:49,940 INFO L272 AbstractInterpreter]: Visited 17 different actions 20 times. Never merged. Never widened. Performed 51 root evaluator evaluations with a maximum evaluation depth of 4. Performed 51 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 04:27:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:49,949 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:49,970 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2018-11-23 04:27:49,970 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:50,034 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-23 04:27:50,034 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:50,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:50,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-23 04:27:50,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:50,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:27:50,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:27:50,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:27:50,036 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 11 states. [2018-11-23 04:27:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:50,383 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2018-11-23 04:27:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 04:27:50,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-23 04:27:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:50,384 INFO L225 Difference]: With dead ends: 122 [2018-11-23 04:27:50,384 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 04:27:50,385 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:27:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 04:27:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-11-23 04:27:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 04:27:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-23 04:27:50,393 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2018-11-23 04:27:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-23 04:27:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:27:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 04:27:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 04:27:50,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:50,395 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:27:50,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:50,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 801154692, now seen corresponding path program 1 times [2018-11-23 04:27:50,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:50,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:50,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:50,471 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-23 04:27:50,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:50,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:50,472 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-23 04:27:50,472 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [66], [71], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:50,474 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:50,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:50,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:50,483 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 4. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-23 04:27:50,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:50,489 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:50,502 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 66.3% of their original sizes. [2018-11-23 04:27:50,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:50,542 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-23 04:27:50,542 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:50,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:50,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-23 04:27:50,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:50,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:27:50,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:27:50,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:27:50,544 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 11 states. [2018-11-23 04:27:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:50,905 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2018-11-23 04:27:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 04:27:50,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-11-23 04:27:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:50,906 INFO L225 Difference]: With dead ends: 129 [2018-11-23 04:27:50,906 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 04:27:50,907 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-23 04:27:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 04:27:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-11-23 04:27:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 04:27:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-11-23 04:27:50,913 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 57 [2018-11-23 04:27:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:50,913 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-11-23 04:27:50,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:27:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-11-23 04:27:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 04:27:50,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:50,915 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:27:50,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:50,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1162955476, now seen corresponding path program 1 times [2018-11-23 04:27:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:50,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:50,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 04:27:50,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:50,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:50,964 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-23 04:27:50,965 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:50,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:50,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:51,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:51,007 INFO L272 AbstractInterpreter]: Visited 33 different actions 79 times. Merged at 6 different actions 18 times. Never widened. Performed 237 root evaluator evaluations with a maximum evaluation depth of 4. Performed 237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 04:27:51,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:51,009 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:51,035 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 61.95% of their original sizes. [2018-11-23 04:27:51,035 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:51,209 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-23 04:27:51,209 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:51,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:51,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-23 04:27:51,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:51,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 04:27:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 04:27:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-11-23 04:27:51,210 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 21 states. [2018-11-23 04:27:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:52,009 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2018-11-23 04:27:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 04:27:52,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-11-23 04:27:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:52,011 INFO L225 Difference]: With dead ends: 142 [2018-11-23 04:27:52,011 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 04:27:52,012 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 04:27:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 04:27:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2018-11-23 04:27:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 04:27:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-11-23 04:27:52,022 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 58 [2018-11-23 04:27:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:52,023 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-11-23 04:27:52,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 04:27:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-23 04:27:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 04:27:52,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:52,024 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:27:52,024 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:52,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2120894570, now seen corresponding path program 1 times [2018-11-23 04:27:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:52,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 04:27:52,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:52,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:52,082 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-23 04:27:52,082 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:52,083 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:52,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:52,107 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:52,107 INFO L272 AbstractInterpreter]: Visited 45 different actions 87 times. Merged at 6 different actions 14 times. Never widened. Performed 256 root evaluator evaluations with a maximum evaluation depth of 4. Performed 256 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-23 04:27:52,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:52,109 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:52,131 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 63.8% of their original sizes. [2018-11-23 04:27:52,131 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:52,413 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-23 04:27:52,413 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:52,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:52,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-11-23 04:27:52,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:52,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 04:27:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 04:27:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-11-23 04:27:52,415 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 31 states. [2018-11-23 04:27:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:27:53,747 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-11-23 04:27:53,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 04:27:53,747 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-11-23 04:27:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:27:53,748 INFO L225 Difference]: With dead ends: 122 [2018-11-23 04:27:53,748 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 04:27:53,749 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=2514, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 04:27:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 04:27:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-11-23 04:27:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 04:27:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-11-23 04:27:53,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 58 [2018-11-23 04:27:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:27:53,758 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-11-23 04:27:53,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 04:27:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-11-23 04:27:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 04:27:53,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:27:53,760 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:27:53,760 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:27:53,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:53,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1063907295, now seen corresponding path program 1 times [2018-11-23 04:27:53,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:27:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:27:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:27:53,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:27:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:27:53,808 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-23 04:27:53,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:27:53,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:27:53,809 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-23 04:27:53,809 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:27:53,810 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:27:53,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:27:53,844 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:27:53,845 INFO L272 AbstractInterpreter]: Visited 45 different actions 143 times. Merged at 18 different actions 43 times. Never widened. Performed 419 root evaluator evaluations with a maximum evaluation depth of 4. Performed 419 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 04:27:53,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:27:53,846 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:27:53,865 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 63.2% of their original sizes. [2018-11-23 04:27:53,865 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:27:54,113 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-11-23 04:27:54,113 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:27:54,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:27:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [5] total 32 [2018-11-23 04:27:54,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:27:54,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 04:27:54,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 04:27:54,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-11-23 04:27:54,115 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 29 states. [2018-11-23 04:28:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:08,036 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2018-11-23 04:28:08,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 04:28:08,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 04:28:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:08,036 INFO L225 Difference]: With dead ends: 146 [2018-11-23 04:28:08,036 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 04:28:08,037 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 04:28:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 04:28:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-11-23 04:28:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 04:28:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2018-11-23 04:28:08,047 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 62 [2018-11-23 04:28:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:08,048 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2018-11-23 04:28:08,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 04:28:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2018-11-23 04:28:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 04:28:08,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:08,049 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:28:08,049 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:08,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:08,050 INFO L82 PathProgramCache]: Analyzing trace with hash -851500765, now seen corresponding path program 1 times [2018-11-23 04:28:08,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:08,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:08,099 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-23 04:28:08,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:08,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:08,099 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-11-23 04:28:08,099 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:08,100 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:08,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:08,142 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:28:08,142 INFO L272 AbstractInterpreter]: Visited 45 different actions 165 times. Merged at 18 different actions 57 times. Never widened. Performed 528 root evaluator evaluations with a maximum evaluation depth of 4. Performed 528 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-23 04:28:08,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:08,155 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:28:08,174 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 62.83% of their original sizes. [2018-11-23 04:28:08,174 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:28:08,285 INFO L415 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-11-23 04:28:08,285 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:28:08,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:28:08,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-23 04:28:08,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:28:08,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 04:28:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 04:28:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-23 04:28:08,286 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 21 states. [2018-11-23 04:28:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:08,786 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2018-11-23 04:28:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 04:28:08,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-23 04:28:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:08,787 INFO L225 Difference]: With dead ends: 133 [2018-11-23 04:28:08,787 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 04:28:08,788 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 04:28:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 04:28:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-11-23 04:28:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 04:28:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-11-23 04:28:08,797 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 62 [2018-11-23 04:28:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:08,797 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-11-23 04:28:08,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 04:28:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-11-23 04:28:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 04:28:08,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:08,798 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:28:08,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:08,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash -265783978, now seen corresponding path program 1 times [2018-11-23 04:28:08,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:08,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:08,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:08,839 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-23 04:28:08,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:08,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:08,839 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 04:28:08,839 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:08,840 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:08,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:08,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:08,878 INFO L272 AbstractInterpreter]: Visited 51 different actions 156 times. Merged at 14 different actions 49 times. Never widened. Performed 562 root evaluator evaluations with a maximum evaluation depth of 6. Performed 562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-11-23 04:28:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:08,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:08,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:08,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:08,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:08,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:08,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 04:28:08,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:08,984 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-23 04:28:09,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:28:09,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-23 04:28:09,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:28:09,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:28:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:28:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:28:09,002 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 5 states. [2018-11-23 04:28:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:09,061 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2018-11-23 04:28:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:28:09,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-23 04:28:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:09,064 INFO L225 Difference]: With dead ends: 151 [2018-11-23 04:28:09,064 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 04:28:09,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 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-23 04:28:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 04:28:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-11-23 04:28:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 04:28:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-11-23 04:28:09,074 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 63 [2018-11-23 04:28:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:09,075 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-11-23 04:28:09,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:28:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-23 04:28:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:28:09,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:09,076 INFO L402 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-23 04:28:09,076 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:09,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1530868887, now seen corresponding path program 1 times [2018-11-23 04:28:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:09,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:09,158 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-23 04:28:09,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:09,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:09,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 04:28:09,159 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:09,162 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:09,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:09,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:09,234 INFO L272 AbstractInterpreter]: Visited 52 different actions 243 times. Merged at 20 different actions 84 times. Never widened. Performed 813 root evaluator evaluations with a maximum evaluation depth of 6. Performed 813 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 04:28:09,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:09,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:09,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:09,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:09,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:09,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:09,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 04:28:09,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:28:09,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:28:09,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 10] total 18 [2018-11-23 04:28:09,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:28:09,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:28:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:28:09,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:28:09,526 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 8 states. [2018-11-23 04:28:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:11,601 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2018-11-23 04:28:11,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:28:11,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 04:28:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:11,603 INFO L225 Difference]: With dead ends: 111 [2018-11-23 04:28:11,603 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 04:28:11,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:28:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 04:28:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2018-11-23 04:28:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 04:28:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2018-11-23 04:28:11,611 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 65 [2018-11-23 04:28:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:11,611 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-11-23 04:28:11,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:28:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2018-11-23 04:28:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:28:11,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:11,612 INFO L402 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-23 04:28:11,612 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:11,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 251005209, now seen corresponding path program 1 times [2018-11-23 04:28:11,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:11,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:11,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:11,691 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-23 04:28:11,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:11,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:11,691 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 04:28:11,692 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:11,693 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:11,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:11,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:11,740 INFO L272 AbstractInterpreter]: Visited 52 different actions 239 times. Merged at 21 different actions 87 times. Never widened. Performed 730 root evaluator evaluations with a maximum evaluation depth of 6. Performed 730 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 04:28:11,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:11,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:11,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:11,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:11,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:11,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 04:28:11,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:28:11,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:28:11,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 10] total 18 [2018-11-23 04:28:11,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:28:11,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:28:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:28:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:28:11,977 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 8 states. [2018-11-23 04:28:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:12,026 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-23 04:28:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:28:12,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-23 04:28:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:12,026 INFO L225 Difference]: With dead ends: 105 [2018-11-23 04:28:12,027 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 04:28:12,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:28:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 04:28:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-11-23 04:28:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 04:28:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-11-23 04:28:12,033 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 65 [2018-11-23 04:28:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:12,033 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-11-23 04:28:12,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:28:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-11-23 04:28:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:28:12,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:12,034 INFO L402 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-23 04:28:12,034 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:12,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash 889285657, now seen corresponding path program 2 times [2018-11-23 04:28:12,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:12,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:12,072 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-23 04:28:12,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:12,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:12,073 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 04:28:12,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 04:28:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:12,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:12,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:28:12,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 04:28:12,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 04:28:12,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:28:12,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:28:12,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 04:28:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:28:12,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [6] total 21 [2018-11-23 04:28:12,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:28:12,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:28:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:28:12,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-23 04:28:12,392 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 11 states. [2018-11-23 04:28:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:12,470 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-11-23 04:28:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:28:12,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-23 04:28:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:12,471 INFO L225 Difference]: With dead ends: 100 [2018-11-23 04:28:12,471 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 04:28:12,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-11-23 04:28:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 04:28:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-11-23 04:28:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 04:28:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-11-23 04:28:12,479 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 65 [2018-11-23 04:28:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:12,480 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-11-23 04:28:12,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:28:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-11-23 04:28:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 04:28:12,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:12,481 INFO L402 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] [2018-11-23 04:28:12,481 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:12,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1372971101, now seen corresponding path program 1 times [2018-11-23 04:28:12,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:12,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:28:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:12,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:12,548 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-23 04:28:12,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:12,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:12,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 04:28:12,549 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:12,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:12,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:12,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:12,599 INFO L272 AbstractInterpreter]: Visited 51 different actions 166 times. Merged at 20 different actions 47 times. Never widened. Performed 524 root evaluator evaluations with a maximum evaluation depth of 6. Performed 524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-23 04:28:12,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:12,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:12,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:12,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:12,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:12,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:12,787 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-23 04:28:12,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:12,923 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-23 04:28:12,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:28:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2018-11-23 04:28:12,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:28:12,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:28:12,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:28:12,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:28:12,939 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 14 states. [2018-11-23 04:28:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:13,375 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2018-11-23 04:28:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 04:28:13,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-23 04:28:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:13,376 INFO L225 Difference]: With dead ends: 193 [2018-11-23 04:28:13,376 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 04:28:13,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 04:28:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 04:28:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 96. [2018-11-23 04:28:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 04:28:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-11-23 04:28:13,388 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 65 [2018-11-23 04:28:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:13,388 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-11-23 04:28:13,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:28:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-11-23 04:28:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 04:28:13,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:13,389 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-11-23 04:28:13,389 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:13,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 16355109, now seen corresponding path program 1 times [2018-11-23 04:28:13,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:13,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 04:28:13,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:13,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:13,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-23 04:28:13,428 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:13,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:13,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:13,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:13,458 INFO L272 AbstractInterpreter]: Visited 51 different actions 161 times. Merged at 20 different actions 47 times. Never widened. Performed 457 root evaluator evaluations with a maximum evaluation depth of 6. Performed 457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-23 04:28:13,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:13,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:13,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/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-23 04:28:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:13,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:13,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 04:28:13,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 04:28:13,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:28:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-23 04:28:13,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:28:13,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:28:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:28:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:28:13,566 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 6 states. [2018-11-23 04:28:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:13,622 INFO L93 Difference]: Finished difference Result 200 states and 248 transitions. [2018-11-23 04:28:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:28:13,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-23 04:28:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:13,623 INFO L225 Difference]: With dead ends: 200 [2018-11-23 04:28:13,623 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 04:28:13,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 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-23 04:28:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 04:28:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2018-11-23 04:28:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 04:28:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-11-23 04:28:13,634 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 66 [2018-11-23 04:28:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:13,634 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-23 04:28:13,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:28:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-11-23 04:28:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 04:28:13,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:28:13,635 INFO L402 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] [2018-11-23 04:28:13,635 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:28:13,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -644872026, now seen corresponding path program 1 times [2018-11-23 04:28:13,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:28:13,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:13,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:13,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:28:13,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:28:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:13,696 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-23 04:28:13,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:13,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:28:13,696 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-23 04:28:13,697 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-11-23 04:28:13,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:28:13,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:28:13,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:28:13,731 INFO L272 AbstractInterpreter]: Visited 51 different actions 166 times. Merged at 20 different actions 49 times. Never widened. Performed 483 root evaluator evaluations with a maximum evaluation depth of 6. Performed 483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-23 04:28:13,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:28:13,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:28:13,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:28:13,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:28:13,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:28:13,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:28:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:28:13,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:28:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 04:28:13,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:28:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 04:28:14,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:28:14,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2018-11-23 04:28:14,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:28:14,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:28:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:28:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:28:14,037 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 14 states. [2018-11-23 04:28:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:28:14,347 INFO L93 Difference]: Finished difference Result 204 states and 254 transitions. [2018-11-23 04:28:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 04:28:14,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-23 04:28:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:28:14,348 INFO L225 Difference]: With dead ends: 204 [2018-11-23 04:28:14,348 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:28:14,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-11-23 04:28:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:28:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:28:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:28:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:28:14,349 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-11-23 04:28:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:28:14,349 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:28:14,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:28:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:28:14,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:28:14,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:28:14,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:28:14,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:28:14,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:28:14,817 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-11-23 04:28:17,122 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2018-11-23 04:28:17,268 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 30 [2018-11-23 04:28:17,275 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-23 04:28:17,275 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (and (or (= mulflt_~__retres10~1 0) (and (= mulflt_~a |mulflt_#in~a|) (= mulflt_~b |mulflt_#in~b|) (not (= 0 (mod |mulflt_#in~b| 4294967296)))) (and (= mulflt_~b |mulflt_#in~a|) (exists ((v_mulflt_~a_10 Int)) (< (mod v_mulflt_~a_10 4294967296) (mod |mulflt_#in~b| 4294967296))) (not (= (mod |mulflt_#in~a| 4294967296) 0)))) (or (and (= mulflt_~a 0) (= mulflt_~b 0)) (not (= |mulflt_#in~a| 0)) (not (= |mulflt_#in~b| 0)))) [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= |base2flt_#in~m| 0)) (not (= |base2flt_#in~e| 0)) (and (= base2flt_~__retres4~0 0) (= base2flt_~m 0) (= base2flt_~e 0))) [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-23 04:28:17,276 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 0)) .cse0) (not (= base2flt_~m 0)) (or (and (<= base2flt_~m |base2flt_#in~m|) (<= |base2flt_#in~m| base2flt_~m) (= base2flt_~e 0)) (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (= (mod base2flt_~m 4) 0)) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-11-23 04:28:17,276 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 0)) .cse0) (or (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (and (not (= base2flt_~m 0)) (= (mod base2flt_~m 4) 0))) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (let ((.cse1 (* 4 |base2flt_#in~m|)) (.cse0 (+ (div base2flt_~m 4294967296) 1))) (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= |base2flt_#in~e| base2flt_~e) (or (<= .cse0 0) (<= base2flt_~m .cse1)) (or (<= .cse1 base2flt_~m) (< 0 .cse0)))) [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 04:28:17,277 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-23 04:28:17,277 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~zero~0 0) (= main_~tmp___0~0 0)) [2018-11-23 04:28:17,278 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-23 04:28:17,278 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-23 04:28:17,278 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (and (= main_~tmp~2 0) (= main_~zero~0 0) (forall ((v_mulflt_~a_16 Int)) (<= (mod main_~b~0 4294967296) (mod v_mulflt_~a_16 4294967296))) (= main_~sb~0 0)) (<= (+ main_~sb~0 1) 0) (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0))) [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-23 04:28:17,279 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-23 04:28:17,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] [2018-11-23 04:28:17,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] [2018-11-23 04:28:17,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:28:17 BoogieIcfgContainer [2018-11-23 04:28:17,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:28:17,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:28:17,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:28:17,292 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:28:17,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:27:48" (3/4) ... [2018-11-23 04:28:17,295 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:28:17,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:28:17,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-23 04:28:17,300 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-23 04:28:17,300 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:28:17,300 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 04:28:17,304 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 04:28:17,304 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 04:28:17,305 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 04:28:17,322 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || !(\old(e) == 0)) || ((__retres4 == 0 && m == 0) && e == 0) [2018-11-23 04:28:17,322 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-11-23 04:28:17,322 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) [2018-11-23 04:28:17,322 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-11-23 04:28:17,323 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__retres10 == 0 || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || ((b == \old(a) && (\exists v_mulflt_~a_10 : int :: v_mulflt_~a_10 % 4294967296 < \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) [2018-11-23 04:28:17,347 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_69103758-a949-4944-8d7c-e4ae149dd9dc/bin-2019/utaipan/witness.graphml [2018-11-23 04:28:17,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:28:17,348 INFO L168 Benchmark]: Toolchain (without parser) took 29115.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 421.5 MB). Free memory was 953.8 MB in the beginning and 1.3 GB in the end (delta: -318.4 MB). Peak memory consumption was 103.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,348 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:28:17,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.6 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.34 ms. Allocated memory is still 1.0 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:28:17,349 INFO L168 Benchmark]: Boogie Preprocessor took 53.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,349 INFO L168 Benchmark]: RCFGBuilder took 219.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,350 INFO L168 Benchmark]: TraceAbstraction took 28569.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.5 MB). Peak memory consumption was 509.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,350 INFO L168 Benchmark]: Witness Printer took 55.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:28:17,352 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.6 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.34 ms. Allocated memory is still 1.0 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28569.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -190.5 MB). Peak memory consumption was 509.3 MB. Max. memory is 11.5 GB. * Witness Printer took 55.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\old(e) == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || !(\old(e) == 0)) || ((__retres4 == 0 && m == 0) && e == 0) - InvariantResult [Line: 147]: Loop Invariant [2018-11-23 04:28:17,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] [2018-11-23 04:28:17,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_mulflt_~a_10,QUANTIFIED] Derived loop invariant: ((__retres10 == 0 || ((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296))) || ((b == \old(a) && (\exists v_mulflt_~a_10 : int :: v_mulflt_~a_10 % 4294967296 < \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 28.5s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 968 SDtfs, 902 SDslu, 7374 SDs, 0 SdLazy, 1321 SolverSat, 143 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1506 GetRequests, 1134 SyntacticMatches, 12 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 13 AbstIntIterations, 7 AbstIntStrong, 0.7462859152099663 AbsIntWeakeningRatio, 1.369620253164557 AbsIntAvgWeakeningVarsNumRemoved, 0.9443037974683545 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 293 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 193 PreInvPairs, 387 NumberOfFragments, 256 HoareAnnotationTreeSize, 193 FomulaSimplifications, 547442 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1314 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1414 NumberOfCodeBlocks, 1385 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1841 ConstructedInterpolants, 48 QuantifiedInterpolants, 258364 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1152 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 767/1027 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...