./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:59:41,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:59:41,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:59:41,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:59:41,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:59:41,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:59:41,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:59:41,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:59:41,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:59:41,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:59:41,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:59:41,338 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:59:41,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:59:41,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:59:41,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:59:41,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:59:41,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:59:41,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:59:41,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:59:41,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:59:41,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:59:41,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:59:41,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:59:41,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:59:41,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:59:41,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:59:41,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:59:41,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:59:41,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:59:41,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:59:41,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:59:41,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:59:41,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:59:41,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:59:41,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:59:41,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:59:41,350 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:59:41,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:59:41,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:59:41,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:59:41,357 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:59:41,357 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:59:41,357 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:59:41,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:59:41,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:59:41,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:59:41,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:59:41,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:59:41,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:59:41,360 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_9579cfb8-5e47-4c7f-940b-e93b547072b3/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-12-09 00:59:41,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:59:41,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:59:41,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:59:41,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:59:41,387 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:59:41,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:41,421 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/d04653689/dc6232fad42a4d2e8ae512a065511bce/FLAG40ace4075 [2018-12-09 00:59:41,782 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:59:41,783 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:41,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/d04653689/dc6232fad42a4d2e8ae512a065511bce/FLAG40ace4075 [2018-12-09 00:59:42,167 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/d04653689/dc6232fad42a4d2e8ae512a065511bce [2018-12-09 00:59:42,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:59:42,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:59:42,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:42,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:59:42,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:59:42,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d57af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42, skipping insertion in model container [2018-12-09 00:59:42,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:59:42,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:59:42,318 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:42,320 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:59:42,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:42,347 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:59:42,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42 WrapperNode [2018-12-09 00:59:42,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:42,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:42,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:59:42,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:59:42,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:42,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:59:42,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:59:42,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:59:42,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... [2018-12-09 00:59:42,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:59:42,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:59:42,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:59:42,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:59:42,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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-12-09 00:59:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-09 00:59:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-09 00:59:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:59:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:59:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:59:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:59:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:59:42,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:59:42,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:59:42,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:59:42,595 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:59:42,595 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:59:42,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:42 BoogieIcfgContainer [2018-12-09 00:59:42,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:59:42,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:59:42,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:59:42,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:59:42,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:59:42" (1/3) ... [2018-12-09 00:59:42,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea245cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:42, skipping insertion in model container [2018-12-09 00:59:42,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:42" (2/3) ... [2018-12-09 00:59:42,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea245cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:42, skipping insertion in model container [2018-12-09 00:59:42,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:42" (3/3) ... [2018-12-09 00:59:42,600 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:42,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:59:42,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:59:42,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:59:42,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:59:42,639 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:59:42,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:59:42,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:59:42,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:59:42,640 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:59:42,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:59:42,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:59:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-09 00:59:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:59:42,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:42,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:42,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:42,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:42,658 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-09 00:59:42,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:42,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:59:42,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:42,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 00:59:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 00:59:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:59:42,755 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-09 00:59:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:42,769 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-09 00:59:42,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 00:59:42,769 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-09 00:59:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:42,775 INFO L225 Difference]: With dead ends: 76 [2018-12-09 00:59:42,775 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 00:59:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:59:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 00:59:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 00:59:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 00:59:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-09 00:59:42,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-09 00:59:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:42,799 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-09 00:59:42,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 00:59:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-09 00:59:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:59:42,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:42,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:42,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:42,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-09 00:59:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:42,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:42,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:42,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:42,879 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2018-12-09 00:59:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:42,970 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2018-12-09 00:59:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:42,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 00:59:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:42,971 INFO L225 Difference]: With dead ends: 102 [2018-12-09 00:59:42,971 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 00:59:42,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 00:59:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 00:59:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 00:59:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2018-12-09 00:59:42,977 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2018-12-09 00:59:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:42,977 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2018-12-09 00:59:42,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2018-12-09 00:59:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:59:42,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:42,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:42,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:42,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2018-12-09 00:59:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:42,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:42,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:42,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:43,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:43,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:43,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:43,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:43,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:43,026 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2018-12-09 00:59:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:43,174 INFO L93 Difference]: Finished difference Result 159 states and 262 transitions. [2018-12-09 00:59:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:43,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 00:59:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:43,175 INFO L225 Difference]: With dead ends: 159 [2018-12-09 00:59:43,175 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 00:59:43,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 00:59:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-09 00:59:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 00:59:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2018-12-09 00:59:43,181 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2018-12-09 00:59:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:43,181 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2018-12-09 00:59:43,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2018-12-09 00:59:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:59:43,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:43,182 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:59:43,182 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:43,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2018-12-09 00:59:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:43,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:43,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:43,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:43,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:43,222 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2018-12-09 00:59:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:43,361 INFO L93 Difference]: Finished difference Result 245 states and 378 transitions. [2018-12-09 00:59:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:43,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 00:59:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:43,362 INFO L225 Difference]: With dead ends: 245 [2018-12-09 00:59:43,362 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 00:59:43,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 00:59:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2018-12-09 00:59:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 00:59:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 188 transitions. [2018-12-09 00:59:43,369 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 188 transitions. Word has length 33 [2018-12-09 00:59:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:43,369 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 188 transitions. [2018-12-09 00:59:43,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 188 transitions. [2018-12-09 00:59:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:59:43,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:43,370 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:43,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:43,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1417056703, now seen corresponding path program 1 times [2018-12-09 00:59:43,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:43,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:59:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:59:43,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:43,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:59:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:59:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:43,413 INFO L87 Difference]: Start difference. First operand 124 states and 188 transitions. Second operand 5 states. [2018-12-09 00:59:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:43,565 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2018-12-09 00:59:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:43,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-09 00:59:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:43,568 INFO L225 Difference]: With dead ends: 346 [2018-12-09 00:59:43,568 INFO L226 Difference]: Without dead ends: 240 [2018-12-09 00:59:43,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-09 00:59:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 132. [2018-12-09 00:59:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 00:59:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-12-09 00:59:43,576 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 39 [2018-12-09 00:59:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:43,577 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-09 00:59:43,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:59:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2018-12-09 00:59:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:59:43,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:43,578 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:43,578 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:43,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2018-12-09 00:59:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:43,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:59:43,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:43,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:59:43,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:43,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:59:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:59:43,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:43,634 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand 5 states. [2018-12-09 00:59:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:43,786 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2018-12-09 00:59:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:43,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-09 00:59:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:43,787 INFO L225 Difference]: With dead ends: 367 [2018-12-09 00:59:43,787 INFO L226 Difference]: Without dead ends: 260 [2018-12-09 00:59:43,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-09 00:59:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 142. [2018-12-09 00:59:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 00:59:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-09 00:59:43,796 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 40 [2018-12-09 00:59:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-09 00:59:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:59:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-09 00:59:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 00:59:43,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:43,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:43,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:43,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash 482670800, now seen corresponding path program 1 times [2018-12-09 00:59:43,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:43,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:43,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:43,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:43,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:43,847 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-09 00:59:43,848 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [33], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:43,868 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:43,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:43,955 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:43,956 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Performed 49 root evaluator evaluations with a maximum evaluation depth of 3. Performed 49 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:43,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:43,964 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:44,011 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 57.22% of their original sizes. [2018-12-09 00:59:44,011 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:44,035 INFO L418 sIntCurrentIteration]: We unified 40 AI predicates to 40 [2018-12-09 00:59:44,035 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-12-09 00:59:44,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:44,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:44,036 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 7 states. [2018-12-09 00:59:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:44,329 INFO L93 Difference]: Finished difference Result 682 states and 1044 transitions. [2018-12-09 00:59:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:59:44,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-09 00:59:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:44,331 INFO L225 Difference]: With dead ends: 682 [2018-12-09 00:59:44,331 INFO L226 Difference]: Without dead ends: 576 [2018-12-09 00:59:44,331 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-09 00:59:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 145. [2018-12-09 00:59:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 00:59:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2018-12-09 00:59:44,338 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 41 [2018-12-09 00:59:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:44,338 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2018-12-09 00:59:44,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2018-12-09 00:59:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:59:44,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:44,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:44,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:44,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1228767343, now seen corresponding path program 1 times [2018-12-09 00:59:44,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:44,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:44,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:44,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:44,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:44,401 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 00:59:44,401 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [33], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:44,402 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:44,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:44,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:44,409 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 3. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:44,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:44,410 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:44,424 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 63.62% of their original sizes. [2018-12-09 00:59:44,424 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:44,451 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-09 00:59:44,451 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-09 00:59:44,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:44,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:59:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:59:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:44,452 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand 9 states. [2018-12-09 00:59:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:45,152 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2018-12-09 00:59:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:59:45,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-09 00:59:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:45,155 INFO L225 Difference]: With dead ends: 801 [2018-12-09 00:59:45,155 INFO L226 Difference]: Without dead ends: 695 [2018-12-09 00:59:45,156 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-09 00:59:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 145. [2018-12-09 00:59:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 00:59:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2018-12-09 00:59:45,165 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 42 [2018-12-09 00:59:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:45,166 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2018-12-09 00:59:45,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:59:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2018-12-09 00:59:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:59:45,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:45,167 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:45,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1156380785, now seen corresponding path program 1 times [2018-12-09 00:59:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:45,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:45,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:45,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:45,219 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 00:59:45,219 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [33], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:45,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:45,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:45,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:45,227 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 3. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:45,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:45,232 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:45,242 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 63.62% of their original sizes. [2018-12-09 00:59:45,243 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:45,261 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-09 00:59:45,261 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-09 00:59:45,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:59:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:59:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:45,262 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand 8 states. [2018-12-09 00:59:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:45,613 INFO L93 Difference]: Finished difference Result 804 states and 1229 transitions. [2018-12-09 00:59:45,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:59:45,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-12-09 00:59:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:45,616 INFO L225 Difference]: With dead ends: 804 [2018-12-09 00:59:45,616 INFO L226 Difference]: Without dead ends: 698 [2018-12-09 00:59:45,617 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-09 00:59:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 142. [2018-12-09 00:59:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 00:59:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-09 00:59:45,627 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 42 [2018-12-09 00:59:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:45,627 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-09 00:59:45,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:59:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-09 00:59:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:59:45,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:45,628 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:45,628 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:45,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:45,629 INFO L82 PathProgramCache]: Analyzing trace with hash -258689098, now seen corresponding path program 1 times [2018-12-09 00:59:45,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:45,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:45,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:45,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:45,664 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 00:59:45,664 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [28], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:45,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:45,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:45,669 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:45,669 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 3. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:45,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:45,671 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:45,678 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 60.05% of their original sizes. [2018-12-09 00:59:45,678 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:45,698 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-09 00:59:45,698 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:45,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:45,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-09 00:59:45,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:45,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:59:45,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:59:45,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:45,699 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 9 states. [2018-12-09 00:59:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:46,052 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2018-12-09 00:59:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:59:46,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-09 00:59:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:46,054 INFO L225 Difference]: With dead ends: 791 [2018-12-09 00:59:46,054 INFO L226 Difference]: Without dead ends: 685 [2018-12-09 00:59:46,055 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-12-09 00:59:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 146. [2018-12-09 00:59:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 00:59:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-09 00:59:46,061 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 42 [2018-12-09 00:59:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:46,061 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-09 00:59:46,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:59:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-09 00:59:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:59:46,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:46,062 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:46,062 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:46,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash -236056844, now seen corresponding path program 1 times [2018-12-09 00:59:46,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:46,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:46,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:46,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:46,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:46,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:46,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:46,091 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 00:59:46,091 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [30], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:46,092 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:46,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:46,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:46,096 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 3. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:46,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:46,097 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:46,104 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 60.05% of their original sizes. [2018-12-09 00:59:46,104 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:46,120 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-09 00:59:46,120 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:46,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:46,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-09 00:59:46,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:46,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:59:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:59:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:46,121 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 8 states. [2018-12-09 00:59:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:46,455 INFO L93 Difference]: Finished difference Result 793 states and 1210 transitions. [2018-12-09 00:59:46,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:59:46,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-12-09 00:59:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:46,456 INFO L225 Difference]: With dead ends: 793 [2018-12-09 00:59:46,457 INFO L226 Difference]: Without dead ends: 687 [2018-12-09 00:59:46,457 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-09 00:59:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 146. [2018-12-09 00:59:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 00:59:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-09 00:59:46,463 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 42 [2018-12-09 00:59:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:46,464 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-09 00:59:46,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:59:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-09 00:59:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:59:46,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:46,464 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:46,464 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:46,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1395467255, now seen corresponding path program 1 times [2018-12-09 00:59:46,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:46,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:46,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:46,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:46,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:46,491 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-09 00:59:46,491 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [28], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:46,491 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:46,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:46,495 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:46,495 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 61 root evaluator evaluations with a maximum evaluation depth of 3. Performed 61 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:46,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:46,496 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:46,503 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-09 00:59:46,503 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:46,530 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-09 00:59:46,530 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:46,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:46,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-09 00:59:46,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:59:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:59:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:59:46,531 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 11 states. [2018-12-09 00:59:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:47,014 INFO L93 Difference]: Finished difference Result 904 states and 1384 transitions. [2018-12-09 00:59:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:47,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-12-09 00:59:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:47,015 INFO L225 Difference]: With dead ends: 904 [2018-12-09 00:59:47,015 INFO L226 Difference]: Without dead ends: 798 [2018-12-09 00:59:47,016 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:59:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-12-09 00:59:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 150. [2018-12-09 00:59:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-09 00:59:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2018-12-09 00:59:47,023 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 43 [2018-12-09 00:59:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:47,023 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2018-12-09 00:59:47,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:59:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2018-12-09 00:59:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:59:47,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:47,024 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:47,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:47,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1418099509, now seen corresponding path program 1 times [2018-12-09 00:59:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:47,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:47,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:47,054 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-09 00:59:47,054 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [30], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:47,055 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:47,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:47,058 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:47,059 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:47,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:47,060 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:47,069 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-09 00:59:47,069 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:47,096 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-09 00:59:47,096 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:47,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:47,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 00:59:47,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:47,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:59:47,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:59:47,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:47,097 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand 10 states. [2018-12-09 00:59:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:47,517 INFO L93 Difference]: Finished difference Result 906 states and 1384 transitions. [2018-12-09 00:59:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:59:47,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 00:59:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:47,519 INFO L225 Difference]: With dead ends: 906 [2018-12-09 00:59:47,519 INFO L226 Difference]: Without dead ends: 800 [2018-12-09 00:59:47,519 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-09 00:59:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 146. [2018-12-09 00:59:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 00:59:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-09 00:59:47,527 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 43 [2018-12-09 00:59:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:47,527 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-09 00:59:47,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:59:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-09 00:59:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:59:47,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:47,528 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:47,528 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:47,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash -848516043, now seen corresponding path program 1 times [2018-12-09 00:59:47,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:47,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:47,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:47,556 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-09 00:59:47,557 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [25], [28], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:47,557 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:47,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:47,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:47,561 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:47,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:47,564 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:47,570 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-09 00:59:47,570 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:47,596 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-09 00:59:47,596 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 00:59:47,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:47,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:59:47,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:59:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:47,597 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 10 states. [2018-12-09 00:59:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:47,973 INFO L93 Difference]: Finished difference Result 898 states and 1376 transitions. [2018-12-09 00:59:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:59:47,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 00:59:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:47,975 INFO L225 Difference]: With dead ends: 898 [2018-12-09 00:59:47,975 INFO L226 Difference]: Without dead ends: 792 [2018-12-09 00:59:47,975 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-12-09 00:59:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 146. [2018-12-09 00:59:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 00:59:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-09 00:59:47,982 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 43 [2018-12-09 00:59:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:47,983 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-09 00:59:47,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:59:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-09 00:59:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:59:47,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:47,983 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:47,983 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:47,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash -825883789, now seen corresponding path program 1 times [2018-12-09 00:59:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:47,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:59:48,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:48,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:48,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-09 00:59:48,011 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [25], [30], [38], [45], [147], [149], [152], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:48,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:48,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:48,015 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:48,015 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 3. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-09 00:59:48,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,016 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:48,022 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-09 00:59:48,022 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:48,044 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-09 00:59:48,045 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-09 00:59:48,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:48,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:59:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:59:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:48,045 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 9 states. [2018-12-09 00:59:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:48,292 INFO L93 Difference]: Finished difference Result 900 states and 1376 transitions. [2018-12-09 00:59:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:59:48,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-12-09 00:59:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:48,294 INFO L225 Difference]: With dead ends: 900 [2018-12-09 00:59:48,294 INFO L226 Difference]: Without dead ends: 794 [2018-12-09 00:59:48,295 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-12-09 00:59:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 137. [2018-12-09 00:59:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 00:59:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2018-12-09 00:59:48,303 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 43 [2018-12-09 00:59:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:48,303 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2018-12-09 00:59:48,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:59:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2018-12-09 00:59:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:59:48,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:48,304 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:59:48,304 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:48,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1835951532, now seen corresponding path program 1 times [2018-12-09 00:59:48,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:59:48,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:48,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:48,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:48,334 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand 4 states. [2018-12-09 00:59:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:48,413 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2018-12-09 00:59:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:48,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 00:59:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:48,414 INFO L225 Difference]: With dead ends: 368 [2018-12-09 00:59:48,414 INFO L226 Difference]: Without dead ends: 256 [2018-12-09 00:59:48,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-09 00:59:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2018-12-09 00:59:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-09 00:59:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2018-12-09 00:59:48,428 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 47 [2018-12-09 00:59:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:48,428 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2018-12-09 00:59:48,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2018-12-09 00:59:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:59:48,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:48,429 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:59:48,429 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:48,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1306744213, now seen corresponding path program 1 times [2018-12-09 00:59:48,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:59:48,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:48,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:48,511 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-09 00:59:48,511 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [36], [38], [45], [47], [76], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:48,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:48,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:48,515 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:48,516 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 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-12-09 00:59:48,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,517 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:48,527 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 49.98% of their original sizes. [2018-12-09 00:59:48,527 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:48,540 INFO L418 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-12-09 00:59:48,540 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:48,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:48,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-12-09 00:59:48,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:48,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:48,541 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand 7 states. [2018-12-09 00:59:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:48,753 INFO L93 Difference]: Finished difference Result 574 states and 865 transitions. [2018-12-09 00:59:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:59:48,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-12-09 00:59:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:48,753 INFO L225 Difference]: With dead ends: 574 [2018-12-09 00:59:48,753 INFO L226 Difference]: Without dead ends: 469 [2018-12-09 00:59:48,754 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-09 00:59:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 242. [2018-12-09 00:59:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-09 00:59:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2018-12-09 00:59:48,763 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 47 [2018-12-09 00:59:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:48,763 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2018-12-09 00:59:48,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2018-12-09 00:59:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:59:48,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:48,764 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:59:48,764 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:48,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -388841782, now seen corresponding path program 1 times [2018-12-09 00:59:48,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:59:48,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:48,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:48,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:48,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:48,807 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 4 states. [2018-12-09 00:59:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:48,882 INFO L93 Difference]: Finished difference Result 681 states and 1036 transitions. [2018-12-09 00:59:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:48,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 00:59:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:48,883 INFO L225 Difference]: With dead ends: 681 [2018-12-09 00:59:48,883 INFO L226 Difference]: Without dead ends: 476 [2018-12-09 00:59:48,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-09 00:59:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 419. [2018-12-09 00:59:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 00:59:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 632 transitions. [2018-12-09 00:59:48,907 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 632 transitions. Word has length 48 [2018-12-09 00:59:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:48,907 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 632 transitions. [2018-12-09 00:59:48,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-12-09 00:59:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:59:48,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:48,908 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:48,908 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:48,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1897999666, now seen corresponding path program 1 times [2018-12-09 00:59:48,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:48,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:48,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:48,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:48,958 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-09 00:59:48,958 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [33], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:48,959 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:48,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:48,972 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:48,973 INFO L272 AbstractInterpreter]: Visited 31 different actions 35 times. Merged at 3 different actions 3 times. Never widened. Performed 127 root evaluator evaluations with a maximum evaluation depth of 4. Performed 127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-09 00:59:48,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:48,976 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:48,996 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 51.4% of their original sizes. [2018-12-09 00:59:48,996 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:49,027 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-09 00:59:49,027 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:49,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:49,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-09 00:59:49,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:49,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:59:49,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:59:49,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:49,028 INFO L87 Difference]: Start difference. First operand 419 states and 632 transitions. Second operand 9 states. [2018-12-09 00:59:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:49,340 INFO L93 Difference]: Finished difference Result 864 states and 1309 transitions. [2018-12-09 00:59:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:59:49,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-12-09 00:59:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:49,342 INFO L225 Difference]: With dead ends: 864 [2018-12-09 00:59:49,342 INFO L226 Difference]: Without dead ends: 760 [2018-12-09 00:59:49,342 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-12-09 00:59:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 452. [2018-12-09 00:59:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-09 00:59:49,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 674 transitions. [2018-12-09 00:59:49,373 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 674 transitions. Word has length 52 [2018-12-09 00:59:49,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:49,373 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 674 transitions. [2018-12-09 00:59:49,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:59:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 674 transitions. [2018-12-09 00:59:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:59:49,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:49,374 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:49,374 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:49,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1887494540, now seen corresponding path program 1 times [2018-12-09 00:59:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:49,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:49,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:49,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:49,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 00:59:49,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:49,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:49,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:49,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:49,410 INFO L87 Difference]: Start difference. First operand 452 states and 674 transitions. Second operand 3 states. [2018-12-09 00:59:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:49,444 INFO L93 Difference]: Finished difference Result 597 states and 878 transitions. [2018-12-09 00:59:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:49,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 00:59:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:49,447 INFO L225 Difference]: With dead ends: 597 [2018-12-09 00:59:49,447 INFO L226 Difference]: Without dead ends: 566 [2018-12-09 00:59:49,447 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-12-09 00:59:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-12-09 00:59:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 515. [2018-12-09 00:59:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-12-09 00:59:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 769 transitions. [2018-12-09 00:59:49,481 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 769 transitions. Word has length 52 [2018-12-09 00:59:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:49,481 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 769 transitions. [2018-12-09 00:59:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 769 transitions. [2018-12-09 00:59:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:59:49,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:49,482 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:59:49,482 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:49,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1087112141, now seen corresponding path program 1 times [2018-12-09 00:59:49,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:49,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:49,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:49,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:49,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:49,538 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 00:59:49,538 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [33], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:49,539 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:49,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:49,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:49,550 INFO L272 AbstractInterpreter]: Visited 32 different actions 35 times. Merged at 2 different actions 2 times. Never widened. Performed 126 root evaluator evaluations with a maximum evaluation depth of 4. Performed 126 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-09 00:59:49,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:49,551 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:49,564 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.44% of their original sizes. [2018-12-09 00:59:49,564 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:49,603 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-09 00:59:49,603 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-12-09 00:59:49,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:49,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:59:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:59:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:49,604 INFO L87 Difference]: Start difference. First operand 515 states and 769 transitions. Second operand 12 states. [2018-12-09 00:59:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:50,449 INFO L93 Difference]: Finished difference Result 1281 states and 1932 transitions. [2018-12-09 00:59:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:59:50,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-09 00:59:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:50,451 INFO L225 Difference]: With dead ends: 1281 [2018-12-09 00:59:50,451 INFO L226 Difference]: Without dead ends: 1153 [2018-12-09 00:59:50,452 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-12-09 00:59:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 549. [2018-12-09 00:59:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-12-09 00:59:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 812 transitions. [2018-12-09 00:59:50,475 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 812 transitions. Word has length 53 [2018-12-09 00:59:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:50,476 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 812 transitions. [2018-12-09 00:59:50,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:59:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 812 transitions. [2018-12-09 00:59:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:59:50,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:50,476 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:59:50,476 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:50,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1158467313, now seen corresponding path program 1 times [2018-12-09 00:59:50,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:50,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:50,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:50,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:50,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:50,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:50,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:50,510 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 00:59:50,510 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [11], [19], [22], [33], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:50,511 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:50,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:50,518 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:50,518 INFO L272 AbstractInterpreter]: Visited 32 different actions 36 times. Merged at 3 different actions 3 times. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 4. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-09 00:59:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:50,519 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:50,530 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.44% of their original sizes. [2018-12-09 00:59:50,530 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:50,551 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-09 00:59:50,551 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:50,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:50,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 00:59:50,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:50,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:59:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:59:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:50,552 INFO L87 Difference]: Start difference. First operand 549 states and 812 transitions. Second operand 10 states. [2018-12-09 00:59:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:50,871 INFO L93 Difference]: Finished difference Result 1310 states and 1968 transitions. [2018-12-09 00:59:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:50,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-09 00:59:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:50,873 INFO L225 Difference]: With dead ends: 1310 [2018-12-09 00:59:50,873 INFO L226 Difference]: Without dead ends: 1182 [2018-12-09 00:59:50,874 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:59:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-12-09 00:59:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 548. [2018-12-09 00:59:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-12-09 00:59:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 810 transitions. [2018-12-09 00:59:50,896 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 810 transitions. Word has length 53 [2018-12-09 00:59:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:50,896 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 810 transitions. [2018-12-09 00:59:50,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:59:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 810 transitions. [2018-12-09 00:59:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:59:50,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:50,897 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:59:50,897 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:50,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash 944325260, now seen corresponding path program 1 times [2018-12-09 00:59:50,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:50,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:50,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:50,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:50,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:50,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 00:59:50,921 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [28], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:50,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:50,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:50,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:50,929 INFO L272 AbstractInterpreter]: Visited 32 different actions 36 times. Merged at 3 different actions 3 times. Never widened. Performed 132 root evaluator evaluations with a maximum evaluation depth of 4. Performed 132 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-09 00:59:50,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:50,930 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:50,941 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 56.4% of their original sizes. [2018-12-09 00:59:50,942 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:50,989 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-09 00:59:50,989 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-09 00:59:50,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:50,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:59:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:59:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:59:50,990 INFO L87 Difference]: Start difference. First operand 548 states and 810 transitions. Second operand 11 states. [2018-12-09 00:59:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:51,520 INFO L93 Difference]: Finished difference Result 1229 states and 1838 transitions. [2018-12-09 00:59:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:59:51,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-12-09 00:59:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:51,523 INFO L225 Difference]: With dead ends: 1229 [2018-12-09 00:59:51,523 INFO L226 Difference]: Without dead ends: 1101 [2018-12-09 00:59:51,523 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-12-09 00:59:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 578. [2018-12-09 00:59:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-09 00:59:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 849 transitions. [2018-12-09 00:59:51,563 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 849 transitions. Word has length 53 [2018-12-09 00:59:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:51,563 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 849 transitions. [2018-12-09 00:59:51,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:59:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 849 transitions. [2018-12-09 00:59:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:59:51,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:51,564 INFO L402 BasicCegarLoop]: trace histogram [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-12-09 00:59:51,564 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:51,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1367971982, now seen corresponding path program 1 times [2018-12-09 00:59:51,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:51,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:51,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:51,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:51,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:51,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:51,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:51,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 00:59:51,596 INFO L205 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [30], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:51,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:51,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:51,606 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:59:51,606 INFO L272 AbstractInterpreter]: Visited 32 different actions 36 times. Merged at 3 different actions 3 times. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 4. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-09 00:59:51,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:51,608 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:59:51,621 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 56.4% of their original sizes. [2018-12-09 00:59:51,621 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:59:51,644 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-09 00:59:51,645 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:59:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-09 00:59:51,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:51,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:59:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:59:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:59:51,645 INFO L87 Difference]: Start difference. First operand 578 states and 849 transitions. Second operand 10 states. [2018-12-09 00:59:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:52,014 INFO L93 Difference]: Finished difference Result 1252 states and 1869 transitions. [2018-12-09 00:59:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:52,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-09 00:59:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:52,016 INFO L225 Difference]: With dead ends: 1252 [2018-12-09 00:59:52,016 INFO L226 Difference]: Without dead ends: 1124 [2018-12-09 00:59:52,016 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:59:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-12-09 00:59:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 578. [2018-12-09 00:59:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-09 00:59:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 849 transitions. [2018-12-09 00:59:52,038 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 849 transitions. Word has length 53 [2018-12-09 00:59:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:52,039 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 849 transitions. [2018-12-09 00:59:52,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:59:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 849 transitions. [2018-12-09 00:59:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 00:59:52,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:52,039 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:52,039 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:52,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1399827541, now seen corresponding path program 1 times [2018-12-09 00:59:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:52,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:52,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:52,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:52,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:52,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:52,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:52,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-09 00:59:52,065 INFO L205 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [25], [28], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2018-12-09 00:59:52,065 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:52,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:52,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:59:52,081 INFO L272 AbstractInterpreter]: Visited 50 different actions 75 times. Merged at 8 different actions 17 times. Never widened. Performed 233 root evaluator evaluations with a maximum evaluation depth of 6. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 6 different actions. Largest state had 23 variables. [2018-12-09 00:59:52,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:52,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:59:52,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:52,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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-12-09 00:59:52,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:52,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:59:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:52,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:59:52,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:59:52,190 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:59:52,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-12-09 00:59:52,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:52,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:52,191 INFO L87 Difference]: Start difference. First operand 578 states and 849 transitions. Second operand 4 states. [2018-12-09 00:59:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:52,793 INFO L93 Difference]: Finished difference Result 1266 states and 1941 transitions. [2018-12-09 00:59:52,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:52,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 00:59:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:52,796 INFO L225 Difference]: With dead ends: 1266 [2018-12-09 00:59:52,796 INFO L226 Difference]: Without dead ends: 767 [2018-12-09 00:59:52,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-12-09 00:59:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 679. [2018-12-09 00:59:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-12-09 00:59:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 936 transitions. [2018-12-09 00:59:52,835 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 936 transitions. Word has length 54 [2018-12-09 00:59:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:52,835 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 936 transitions. [2018-12-09 00:59:52,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 936 transitions. [2018-12-09 00:59:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:59:52,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:52,837 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:52,837 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:52,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-09 00:59:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:52,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:52,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:52,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:52,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:59:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:59:52,876 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:59:52,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:59:52 BoogieIcfgContainer [2018-12-09 00:59:52,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:59:52,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:59:52,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:59:52,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:59:52,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:42" (3/4) ... [2018-12-09 00:59:52,919 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:59:52,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:59:52,919 INFO L168 Benchmark]: Toolchain (without parser) took 10749.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.2 MB). Free memory was 955.1 MB in the beginning and 837.4 MB in the end (delta: 117.7 MB). Peak memory consumption was 381.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:59:52,920 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:59:52,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.37 ms. Allocated memory is still 1.0 GB. Free memory was 955.1 MB in the beginning and 941.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:59:52,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 941.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:59:52,921 INFO L168 Benchmark]: Boogie Preprocessor took 48.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 941.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:59:52,921 INFO L168 Benchmark]: RCFGBuilder took 186.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:59:52,921 INFO L168 Benchmark]: TraceAbstraction took 10319.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 837.4 MB in the end (delta: 235.3 MB). Peak memory consumption was 401.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:59:52,922 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 837.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:59:52,923 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.37 ms. Allocated memory is still 1.0 GB. Free memory was 955.1 MB in the beginning and 941.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 941.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 941.7 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 186.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10319.89 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 837.4 MB in the end (delta: 235.3 MB). Peak memory consumption was 401.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 837.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=0, \old(b)=0] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L90] COND TRUE i == (unsigned char)1 [L90] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=0, \old(b)=0, \result=1, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r=1, r0=0, r1=0, r2=0, r3=0] [L110] RET, EXPR mp_add(a, b) VAL [a=0, b=0, mp_add(a, b)=1] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 10.2s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4080 SDtfs, 6038 SDslu, 12682 SDs, 0 SdLazy, 4776 SolverSat, 362 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 30 DeclaredPredicates, 841 GetRequests, 692 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=679occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 16 AbstIntIterations, 15 AbstIntStrong, 0.9852770157792315 AbsIntWeakeningRatio, 0.8286558345642541 AbsIntAvgWeakeningVarsNumRemoved, 0.983751846381093 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 8590 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1155 ConstructedInterpolants, 1 QuantifiedInterpolants, 139864 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 287/348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:59:54,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:59:54,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:59:54,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:59:54,319 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:59:54,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:59:54,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:59:54,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:59:54,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:59:54,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:59:54,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:59:54,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:59:54,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:59:54,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:59:54,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:59:54,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:59:54,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:59:54,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:59:54,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:59:54,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:59:54,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:59:54,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:59:54,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:59:54,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:59:54,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:59:54,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:59:54,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:59:54,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:59:54,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:59:54,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:59:54,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:59:54,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:59:54,332 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:59:54,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:59:54,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:59:54,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:59:54,333 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 00:59:54,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:59:54,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:59:54,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:59:54,341 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:59:54,341 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:59:54,341 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:59:54,341 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:59:54,341 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:59:54,341 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:59:54,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:59:54,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:59:54,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:59:54,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:59:54,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 00:59:54,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-12-09 00:59:54,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:59:54,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:59:54,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:59:54,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:59:54,374 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:59:54,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:54,412 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/4557a0683/2594d34f637e48299bfbedfd5b410be5/FLAG213eeb7ee [2018-12-09 00:59:54,744 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:59:54,744 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:54,748 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/4557a0683/2594d34f637e48299bfbedfd5b410be5/FLAG213eeb7ee [2018-12-09 00:59:54,755 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/data/4557a0683/2594d34f637e48299bfbedfd5b410be5 [2018-12-09 00:59:54,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:59:54,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:59:54,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:54,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:59:54,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:59:54,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f4428e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54, skipping insertion in model container [2018-12-09 00:59:54,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:59:54,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:59:54,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:54,882 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:59:54,903 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:54,911 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:59:54,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54 WrapperNode [2018-12-09 00:59:54,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:54,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:54,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:59:54,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:59:54,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:54,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:59:54,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:59:54,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:59:54,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... [2018-12-09 00:59:54,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:59:54,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:59:54,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:59:54,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:59:54,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/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-12-09 00:59:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-09 00:59:55,015 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-09 00:59:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:59:55,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:59:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:59:55,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:59:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:59:55,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:59:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:59:55,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:59:55,187 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:59:55,187 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:59:55,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:55 BoogieIcfgContainer [2018-12-09 00:59:55,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:59:55,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:59:55,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:59:55,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:59:55,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:59:54" (1/3) ... [2018-12-09 00:59:55,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:55, skipping insertion in model container [2018-12-09 00:59:55,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:54" (2/3) ... [2018-12-09 00:59:55,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afe5d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:55, skipping insertion in model container [2018-12-09 00:59:55,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:55" (3/3) ... [2018-12-09 00:59:55,192 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-09 00:59:55,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:59:55,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:59:55,218 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:59:55,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:59:55,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:59:55,237 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:59:55,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:59:55,237 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:59:55,237 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:59:55,237 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:59:55,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:59:55,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:59:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-09 00:59:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:59:55,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:55,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:55,252 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:55,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-09 00:59:55,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:55,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:55,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:55,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:59:55,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 00:59:55,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 00:59:55,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:59:55,328 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-09 00:59:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:55,342 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-09 00:59:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 00:59:55,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-09 00:59:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:55,348 INFO L225 Difference]: With dead ends: 76 [2018-12-09 00:59:55,348 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 00:59:55,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 00:59:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 00:59:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 00:59:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 00:59:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-09 00:59:55,372 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-09 00:59:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:55,372 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-09 00:59:55,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 00:59:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-09 00:59:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:59:55,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:55,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:55,373 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:55,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-09 00:59:55,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:55,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:55,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:55,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:55,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:55,457 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-12-09 00:59:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:55,564 INFO L93 Difference]: Finished difference Result 127 states and 213 transitions. [2018-12-09 00:59:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:55,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-09 00:59:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:55,566 INFO L225 Difference]: With dead ends: 127 [2018-12-09 00:59:55,566 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 00:59:55,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 00:59:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-12-09 00:59:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 00:59:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-09 00:59:55,575 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 21 [2018-12-09 00:59:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:55,575 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-09 00:59:55,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-09 00:59:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:59:55,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:55,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:55,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:55,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1988705185, now seen corresponding path program 1 times [2018-12-09 00:59:55,576 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:55,576 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:55,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:55,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:55,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:55,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:59:55,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:59:55,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:59:55,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:55,649 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 5 states. [2018-12-09 00:59:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:55,831 INFO L93 Difference]: Finished difference Result 173 states and 282 transitions. [2018-12-09 00:59:55,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:55,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 00:59:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:55,833 INFO L225 Difference]: With dead ends: 173 [2018-12-09 00:59:55,833 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 00:59:55,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 00:59:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2018-12-09 00:59:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 00:59:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-09 00:59:55,843 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 22 [2018-12-09 00:59:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:55,844 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-09 00:59:55,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:59:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-09 00:59:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:59:55,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:55,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:55,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:55,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1386022735, now seen corresponding path program 1 times [2018-12-09 00:59:55,845 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:55,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:55,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:55,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:55,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:55,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:59:55,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:55,914 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 7 states. [2018-12-09 00:59:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,071 INFO L93 Difference]: Finished difference Result 215 states and 343 transitions. [2018-12-09 00:59:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:59:56,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-09 00:59:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,072 INFO L225 Difference]: With dead ends: 215 [2018-12-09 00:59:56,073 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 00:59:56,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 00:59:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2018-12-09 00:59:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 00:59:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2018-12-09 00:59:56,082 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 23 [2018-12-09 00:59:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:56,082 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2018-12-09 00:59:56,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2018-12-09 00:59:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:59:56,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:56,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:56,083 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:56,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1127857297, now seen corresponding path program 1 times [2018-12-09 00:59:56,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:56,083 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:56,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:56,137 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:56,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:56,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:59:56,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:59:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:59:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:56,139 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand 6 states. [2018-12-09 00:59:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,311 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2018-12-09 00:59:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:59:56,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 00:59:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,312 INFO L225 Difference]: With dead ends: 234 [2018-12-09 00:59:56,313 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 00:59:56,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 00:59:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 96. [2018-12-09 00:59:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 00:59:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-12-09 00:59:56,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 23 [2018-12-09 00:59:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:56,319 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-12-09 00:59:56,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:59:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-12-09 00:59:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:59:56,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:56,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:56,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:56,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 214387631, now seen corresponding path program 1 times [2018-12-09 00:59:56,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:56,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:56,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:56,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:56,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:56,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:56,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:56,368 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 4 states. [2018-12-09 00:59:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,458 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2018-12-09 00:59:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:56,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 00:59:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,459 INFO L225 Difference]: With dead ends: 254 [2018-12-09 00:59:56,459 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 00:59:56,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 00:59:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2018-12-09 00:59:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 00:59:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-09 00:59:56,466 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 34 [2018-12-09 00:59:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-09 00:59:56,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-09 00:59:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:59:56,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:56,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:56,468 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:56,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1041972219, now seen corresponding path program 1 times [2018-12-09 00:59:56,468 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:56,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:56,519 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:56,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:56,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:59:56,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:59:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:59:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:56,520 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 5 states. [2018-12-09 00:59:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,599 INFO L93 Difference]: Finished difference Result 334 states and 488 transitions. [2018-12-09 00:59:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:59:56,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 00:59:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,600 INFO L225 Difference]: With dead ends: 334 [2018-12-09 00:59:56,600 INFO L226 Difference]: Without dead ends: 260 [2018-12-09 00:59:56,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-09 00:59:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2018-12-09 00:59:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 00:59:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-09 00:59:56,606 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 35 [2018-12-09 00:59:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:56,606 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-09 00:59:56,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:59:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-09 00:59:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:59:56,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:56,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:56,607 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:56,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash 919023332, now seen corresponding path program 1 times [2018-12-09 00:59:56,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:56,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:56,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:56,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:59:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:56,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:56,676 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 7 states. [2018-12-09 00:59:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,793 INFO L93 Difference]: Finished difference Result 408 states and 594 transitions. [2018-12-09 00:59:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:59:56,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-09 00:59:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,795 INFO L225 Difference]: With dead ends: 408 [2018-12-09 00:59:56,795 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 00:59:56,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 00:59:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2018-12-09 00:59:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-09 00:59:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2018-12-09 00:59:56,806 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 36 [2018-12-09 00:59:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:56,806 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2018-12-09 00:59:56,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2018-12-09 00:59:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:59:56,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:56,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:56,807 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:56,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1452715930, now seen corresponding path program 1 times [2018-12-09 00:59:56,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:56,807 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:56,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:56,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:56,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:59:56,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:59:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:59:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:56,860 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand 6 states. [2018-12-09 00:59:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:56,995 INFO L93 Difference]: Finished difference Result 406 states and 588 transitions. [2018-12-09 00:59:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:59:56,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-09 00:59:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:56,997 INFO L225 Difference]: With dead ends: 406 [2018-12-09 00:59:56,997 INFO L226 Difference]: Without dead ends: 332 [2018-12-09 00:59:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-09 00:59:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 156. [2018-12-09 00:59:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-09 00:59:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2018-12-09 00:59:57,003 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 36 [2018-12-09 00:59:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:57,003 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2018-12-09 00:59:57,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:59:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2018-12-09 00:59:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:59:57,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:57,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:57,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:57,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash 617124283, now seen corresponding path program 1 times [2018-12-09 00:59:57,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:57,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:57,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:57,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:57,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:59:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:57,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:57,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:57,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:59:57,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 4] total 12 [2018-12-09 00:59:57,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:59:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:59:57,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:57,164 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand 12 states. [2018-12-09 00:59:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:57,857 INFO L93 Difference]: Finished difference Result 864 states and 1399 transitions. [2018-12-09 00:59:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 00:59:57,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-09 00:59:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:57,860 INFO L225 Difference]: With dead ends: 864 [2018-12-09 00:59:57,860 INFO L226 Difference]: Without dead ends: 734 [2018-12-09 00:59:57,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-12-09 00:59:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-09 00:59:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 602. [2018-12-09 00:59:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-09 00:59:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 906 transitions. [2018-12-09 00:59:57,890 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 906 transitions. Word has length 38 [2018-12-09 00:59:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:57,890 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 906 transitions. [2018-12-09 00:59:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:59:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 906 transitions. [2018-12-09 00:59:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 00:59:57,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:57,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:57,892 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash -569962265, now seen corresponding path program 1 times [2018-12-09 00:59:57,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:57,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 00:59:57,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 00:59:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:57,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:59:57,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:57,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:59:58,002 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:59:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:59:58,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-12-09 00:59:58,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:59:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:59:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:58,018 INFO L87 Difference]: Start difference. First operand 602 states and 906 transitions. Second operand 9 states. [2018-12-09 00:59:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:58,464 INFO L93 Difference]: Finished difference Result 1777 states and 2720 transitions. [2018-12-09 00:59:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:59:58,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-12-09 00:59:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:58,467 INFO L225 Difference]: With dead ends: 1777 [2018-12-09 00:59:58,467 INFO L226 Difference]: Without dead ends: 1451 [2018-12-09 00:59:58,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:59:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2018-12-09 00:59:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1184. [2018-12-09 00:59:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-12-09 00:59:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1745 transitions. [2018-12-09 00:59:58,504 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1745 transitions. Word has length 58 [2018-12-09 00:59:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:58,504 INFO L480 AbstractCegarLoop]: Abstraction has 1184 states and 1745 transitions. [2018-12-09 00:59:58,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:59:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1745 transitions. [2018-12-09 00:59:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:59:58,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:58,506 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:58,506 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:58,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-09 00:59:58,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:59:58,506 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:59:58,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:58,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:59:59,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:00:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:00:02,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:00:02,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:00:02,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:00:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:00:02,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:00:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:00:02,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:00:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:00:02,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:00:02,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23] total 48 [2018-12-09 01:00:02,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-09 01:00:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-09 01:00:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 01:00:02,981 INFO L87 Difference]: Start difference. First operand 1184 states and 1745 transitions. Second operand 48 states. [2018-12-09 01:00:22,663 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-12-09 01:00:24,808 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2018-12-09 01:00:25,772 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-12-09 01:00:26,248 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-12-09 01:00:26,905 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-09 01:00:28,963 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-09 01:00:29,905 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-09 01:00:30,537 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-09 01:00:37,114 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-09 01:00:38,540 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-09 01:00:38,869 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-09 01:00:39,545 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-12-09 01:00:39,834 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-12-09 01:00:41,139 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-09 01:00:41,599 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-09 01:00:42,063 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-09 01:00:42,346 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-09 01:00:42,819 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-09 01:00:43,712 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-12-09 01:00:44,685 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-12-09 01:00:45,002 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-09 01:00:46,447 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-09 01:00:46,987 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-12-09 01:00:48,091 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-09 01:00:50,107 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-12-09 01:00:50,652 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-09 01:00:51,197 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-12-09 01:00:51,710 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-09 01:00:52,876 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-12-09 01:00:53,391 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-09 01:00:53,670 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-09 01:00:54,419 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-12-09 01:00:54,919 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-09 01:00:55,645 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-09 01:00:56,240 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-09 01:00:56,872 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-12-09 01:00:58,062 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-12-09 01:00:58,406 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-12-09 01:00:59,354 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-09 01:00:59,718 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-12-09 01:01:01,197 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-09 01:01:03,117 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-09 01:01:03,547 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-09 01:01:04,077 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-09 01:01:04,435 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2018-12-09 01:01:04,964 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-12-09 01:01:06,051 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-09 01:01:07,276 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-09 01:01:08,870 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-09 01:01:09,396 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-12-09 01:01:09,785 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-09 01:01:10,238 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-09 01:01:11,809 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-12-09 01:01:12,678 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-09 01:01:13,142 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-09 01:01:14,015 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-12-09 01:01:14,663 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-12-09 01:01:15,541 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-09 01:01:16,663 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-09 01:01:17,204 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-09 01:01:17,820 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-12-09 01:01:19,569 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-09 01:01:20,065 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-09 01:01:21,136 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2018-12-09 01:01:21,807 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-09 01:01:22,257 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-09 01:01:23,322 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-09 01:01:23,885 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-09 01:01:24,910 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-09 01:01:25,970 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-09 01:01:26,594 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-12-09 01:01:29,372 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-09 01:01:30,394 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-12-09 01:01:31,012 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-09 01:01:31,669 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-09 01:01:32,139 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-12-09 01:01:33,734 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-09 01:01:34,466 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-12-09 01:01:35,438 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-09 01:01:36,004 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-12-09 01:01:36,572 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-09 01:01:37,014 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2018-12-09 01:01:37,610 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-09 01:01:38,159 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-12-09 01:01:38,781 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-09 01:01:39,929 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-09 01:01:40,450 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-12-09 01:01:40,991 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2018-12-09 01:01:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:01:41,043 INFO L93 Difference]: Finished difference Result 10102 states and 15163 transitions. [2018-12-09 01:01:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2018-12-09 01:01:41,043 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-12-09 01:01:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:01:41,069 INFO L225 Difference]: With dead ends: 10102 [2018-12-09 01:01:41,069 INFO L226 Difference]: Without dead ends: 9749 [2018-12-09 01:01:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31832 ImplicationChecksByTransitivity, 81.7s TimeCoverageRelationStatistics Valid=18544, Invalid=72358, Unknown=0, NotChecked=0, Total=90902 [2018-12-09 01:01:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2018-12-09 01:01:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 3517. [2018-12-09 01:01:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3517 states. [2018-12-09 01:01:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 5422 transitions. [2018-12-09 01:01:41,285 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 5422 transitions. Word has length 60 [2018-12-09 01:01:41,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:01:41,285 INFO L480 AbstractCegarLoop]: Abstraction has 3517 states and 5422 transitions. [2018-12-09 01:01:41,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-09 01:01:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 5422 transitions. [2018-12-09 01:01:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:01:41,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:01:41,287 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:01:41,287 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:01:41,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:01:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1987160410, now seen corresponding path program 1 times [2018-12-09 01:01:41,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:01:41,288 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:01:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:01:41,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:01:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:01:41,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:01:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:01:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:01:41,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:01:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:01:41,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:01:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:01:41,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:01:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:01:41,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:01:41,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 4] total 10 [2018-12-09 01:01:41,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:01:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:01:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:01:41,444 INFO L87 Difference]: Start difference. First operand 3517 states and 5422 transitions. Second operand 10 states. [2018-12-09 01:01:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:01:42,268 INFO L93 Difference]: Finished difference Result 8531 states and 13372 transitions. [2018-12-09 01:01:42,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 01:01:42,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-12-09 01:01:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:01:42,275 INFO L225 Difference]: With dead ends: 8531 [2018-12-09 01:01:42,275 INFO L226 Difference]: Without dead ends: 5047 [2018-12-09 01:01:42,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2018-12-09 01:01:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2018-12-09 01:01:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 4331. [2018-12-09 01:01:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2018-12-09 01:01:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6202 transitions. [2018-12-09 01:01:42,424 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6202 transitions. Word has length 60 [2018-12-09 01:01:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:01:42,424 INFO L480 AbstractCegarLoop]: Abstraction has 4331 states and 6202 transitions. [2018-12-09 01:01:42,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:01:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6202 transitions. [2018-12-09 01:01:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:01:42,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:01:42,425 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:01:42,426 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:01:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:01:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1930321118, now seen corresponding path program 1 times [2018-12-09 01:01:42,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:01:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:01:42,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:01:42,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:01:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:01:42,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:01:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:01:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:01:42,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:01:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:01:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:01:42,460 INFO L87 Difference]: Start difference. First operand 4331 states and 6202 transitions. Second operand 3 states. [2018-12-09 01:01:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:01:42,623 INFO L93 Difference]: Finished difference Result 5190 states and 7268 transitions. [2018-12-09 01:01:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:01:42,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 01:01:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:01:42,629 INFO L225 Difference]: With dead ends: 5190 [2018-12-09 01:01:42,629 INFO L226 Difference]: Without dead ends: 5102 [2018-12-09 01:01:42,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-12-09 01:01:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2018-12-09 01:01:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4686. [2018-12-09 01:01:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-12-09 01:01:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6625 transitions. [2018-12-09 01:01:42,790 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6625 transitions. Word has length 60 [2018-12-09 01:01:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:01:42,790 INFO L480 AbstractCegarLoop]: Abstraction has 4686 states and 6625 transitions. [2018-12-09 01:01:42,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:01:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6625 transitions. [2018-12-09 01:01:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 01:01:42,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:01:42,791 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:01:42,791 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:01:42,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:01:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash -666750562, now seen corresponding path program 1 times [2018-12-09 01:01:42,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:01:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:01:42,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:01:42,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:01:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:01:42,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:01:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:01:42,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:01:42,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:01:42,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:01:42,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:01:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:01:42,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:01:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:01:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2018-12-09 01:01:42,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 01:01:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 01:01:42,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:01:42,964 INFO L87 Difference]: Start difference. First operand 4686 states and 6625 transitions. Second operand 14 states. [2018-12-09 01:01:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:01:44,215 INFO L93 Difference]: Finished difference Result 10771 states and 15360 transitions. [2018-12-09 01:01:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 01:01:44,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-12-09 01:01:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:01:44,223 INFO L225 Difference]: With dead ends: 10771 [2018-12-09 01:01:44,223 INFO L226 Difference]: Without dead ends: 5824 [2018-12-09 01:01:44,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2018-12-09 01:01:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2018-12-09 01:01:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 3172. [2018-12-09 01:01:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3172 states. [2018-12-09 01:01:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 3985 transitions. [2018-12-09 01:01:44,397 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 3985 transitions. Word has length 60 [2018-12-09 01:01:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:01:44,397 INFO L480 AbstractCegarLoop]: Abstraction has 3172 states and 3985 transitions. [2018-12-09 01:01:44,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 01:01:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 3985 transitions. [2018-12-09 01:01:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 01:01:44,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:01:44,399 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:01:44,399 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:01:44,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:01:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1543067804, now seen corresponding path program 1 times [2018-12-09 01:01:44,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:01:44,399 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:01:44,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:01:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:01:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:01:44,510 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:01:44,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:01:44 BoogieIcfgContainer [2018-12-09 01:01:44,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:01:44,554 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:01:44,554 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:01:44,554 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:01:44,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:55" (3/4) ... [2018-12-09 01:01:44,556 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:01:44,625 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9579cfb8-5e47-4c7f-940b-e93b547072b3/bin-2019/utaipan/witness.graphml [2018-12-09 01:01:44,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:01:44,625 INFO L168 Benchmark]: Toolchain (without parser) took 109867.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.1 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -92.8 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:01:44,626 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:01:44,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.40 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 925.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:01:44,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.13 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:01:44,626 INFO L168 Benchmark]: Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:01:44,626 INFO L168 Benchmark]: RCFGBuilder took 242.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:01:44,627 INFO L168 Benchmark]: TraceAbstraction took 109365.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:01:44,627 INFO L168 Benchmark]: Witness Printer took 70.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:01:44,628 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.40 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 925.9 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.13 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.58 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 242.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109365.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.2 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. * Witness Printer took 70.75 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=35, \old(b)=220] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L70] COND TRUE i < nb VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=35] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L85] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L64] COND FALSE !(i < na) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L70] COND FALSE !(i < nb) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L85] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=35, \old(b)=220, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=35, \old(b)=220, \result=511, a=35, a0=35, a1=0, a2=0, a3=0, b=220, b0=-36, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r=511, r0=-1, r1=1, r2=0, r3=0] [L110] RET, EXPR mp_add(a, b) VAL [a=35, b=220, mp_add(a, b)=511] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 109.3s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 102.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1847 SDtfs, 6936 SDslu, 11502 SDs, 0 SdLazy, 18175 SolverSat, 1342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1606 GetRequests, 1175 SyntacticMatches, 9 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32370 ImplicationChecksByTransitivity, 82.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4686occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 11212 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 926 NumberOfCodeBlocks, 926 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 664572 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 272/338 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...