./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_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:25,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:36:25,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:36:25,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:36:25,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:36:25,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:36:25,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:36:25,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:36:25,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:36:25,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:36:25,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:36:25,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:36:25,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:36:25,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:36:25,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:36:25,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:36:25,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:36:25,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:36:25,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:36:25,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:36:25,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:36:25,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:36:25,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:36:25,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:36:25,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:36:25,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:36:25,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:36:25,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:36:25,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:36:25,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:36:25,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:36:25,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:36:25,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:36:25,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:36:25,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:36:25,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:36:25,382 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:36:25,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:36:25,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:36:25,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:36:25,390 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:36:25,390 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:36:25,390 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:36:25,390 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:36:25,390 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:36:25,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:36:25,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:36:25,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:36:25,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:36:25,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:36:25,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:36:25,393 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_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:25,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:36:25,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:36:25,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:36:25,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:36:25,419 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:36:25,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:25,453 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/726411186/b177a546288d4296a823515ee984e806/FLAGf141ca4bf [2018-12-03 07:36:25,749 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:36:25,750 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:25,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/726411186/b177a546288d4296a823515ee984e806/FLAGf141ca4bf [2018-12-03 07:36:26,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/726411186/b177a546288d4296a823515ee984e806 [2018-12-03 07:36:26,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:36:26,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:36:26,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:36:26,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:36:26,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:36:26,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed18be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26, skipping insertion in model container [2018-12-03 07:36:26,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:36:26,211 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:36:26,309 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:36:26,311 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:36:26,329 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:36:26,337 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:36:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26 WrapperNode [2018-12-03 07:36:26,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:36:26,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:36:26,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:36:26,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:36:26,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:36:26,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:36:26,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:36:26,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:36:26,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... [2018-12-03 07:36:26,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:36:26,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:36:26,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:36:26,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:36:26,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-03 07:36:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-03 07:36:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:36:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:36:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:36:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:36:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:36:26,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:36:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-03 07:36:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-03 07:36:26,630 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:36:26,630 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 07:36:26,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:26 BoogieIcfgContainer [2018-12-03 07:36:26,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:36:26,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:36:26,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:36:26,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:36:26,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:36:26" (1/3) ... [2018-12-03 07:36:26,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f97f49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:26, skipping insertion in model container [2018-12-03 07:36:26,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:26" (2/3) ... [2018-12-03 07:36:26,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f97f49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:26, skipping insertion in model container [2018-12-03 07:36:26,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:26" (3/3) ... [2018-12-03 07:36:26,636 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:26,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:36:26,649 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:36:26,661 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:36:26,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:36:26,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:36:26,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:36:26,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:36:26,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:36:26,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:36:26,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:36:26,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:36:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-03 07:36:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:36:26,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:26,699 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-03 07:36:26,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:26,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-03 07:36:26,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:26,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:26,786 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-03 07:36:26,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:26,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:36:26,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:26,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 07:36:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 07:36:26,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 07:36:26,800 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-03 07:36:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:26,819 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-03 07:36:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 07:36:26,819 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-03 07:36:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:26,825 INFO L225 Difference]: With dead ends: 76 [2018-12-03 07:36:26,825 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 07:36:26,827 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-03 07:36:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 07:36:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 07:36:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 07:36:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-03 07:36:26,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-03 07:36:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:26,849 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-03 07:36:26,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 07:36:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-03 07:36:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:36:26,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:26,850 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-03 07:36:26,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:26,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-03 07:36:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:26,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:26,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:26,915 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-03 07:36:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:36:26,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:26,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:36:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:36:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:36:26,917 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2018-12-03 07:36:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:27,013 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2018-12-03 07:36:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:36:27,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-03 07:36:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:27,014 INFO L225 Difference]: With dead ends: 102 [2018-12-03 07:36:27,014 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 07:36:27,014 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-03 07:36:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 07:36:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-03 07:36:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 07:36:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2018-12-03 07:36:27,019 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2018-12-03 07:36:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:27,019 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2018-12-03 07:36:27,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:36:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2018-12-03 07:36:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 07:36:27,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:27,020 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-03 07:36:27,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:27,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2018-12-03 07:36:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:27,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:27,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:27,068 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-03 07:36:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:27,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:27,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:27,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:27,069 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2018-12-03 07:36:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:27,213 INFO L93 Difference]: Finished difference Result 159 states and 262 transitions. [2018-12-03 07:36:27,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:27,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-03 07:36:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:27,215 INFO L225 Difference]: With dead ends: 159 [2018-12-03 07:36:27,215 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 07:36:27,215 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-03 07:36:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 07:36:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-12-03 07:36:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 07:36:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2018-12-03 07:36:27,221 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2018-12-03 07:36:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:27,221 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2018-12-03 07:36:27,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2018-12-03 07:36:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 07:36:27,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:27,222 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-03 07:36:27,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:27,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2018-12-03 07:36:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:27,262 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-03 07:36:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:27,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:27,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:27,263 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2018-12-03 07:36:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:27,394 INFO L93 Difference]: Finished difference Result 245 states and 378 transitions. [2018-12-03 07:36:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:27,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-03 07:36:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:27,396 INFO L225 Difference]: With dead ends: 245 [2018-12-03 07:36:27,396 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 07:36:27,396 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-03 07:36:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 07:36:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2018-12-03 07:36:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 07:36:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 188 transitions. [2018-12-03 07:36:27,403 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 188 transitions. Word has length 33 [2018-12-03 07:36:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 188 transitions. [2018-12-03 07:36:27,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 188 transitions. [2018-12-03 07:36:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 07:36:27,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:27,404 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-03 07:36:27,404 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:27,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1417056703, now seen corresponding path program 1 times [2018-12-03 07:36:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:27,456 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-03 07:36:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:36:27,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:36:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:36:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:36:27,457 INFO L87 Difference]: Start difference. First operand 124 states and 188 transitions. Second operand 5 states. [2018-12-03 07:36:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:27,610 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2018-12-03 07:36:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:36:27,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-03 07:36:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:27,612 INFO L225 Difference]: With dead ends: 346 [2018-12-03 07:36:27,612 INFO L226 Difference]: Without dead ends: 240 [2018-12-03 07:36:27,613 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-03 07:36:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-12-03 07:36:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 132. [2018-12-03 07:36:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 07:36:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-12-03 07:36:27,620 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 39 [2018-12-03 07:36:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:27,621 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-12-03 07:36:27,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:36:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2018-12-03 07:36:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 07:36:27,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:27,621 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-03 07:36:27,622 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:27,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2018-12-03 07:36:27,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:27,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:27,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:27,661 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-03 07:36:27,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:27,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:36:27,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:27,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:36:27,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:36:27,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:36:27,663 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand 5 states. [2018-12-03 07:36:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:27,849 INFO L93 Difference]: Finished difference Result 367 states and 553 transitions. [2018-12-03 07:36:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:36:27,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-03 07:36:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:27,851 INFO L225 Difference]: With dead ends: 367 [2018-12-03 07:36:27,851 INFO L226 Difference]: Without dead ends: 260 [2018-12-03 07:36:27,851 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-03 07:36:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-03 07:36:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 142. [2018-12-03 07:36:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 07:36:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-03 07:36:27,858 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 40 [2018-12-03 07:36:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:27,858 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-03 07:36:27,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:36:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-03 07:36:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 07:36:27,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:27,859 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-03 07:36:27,859 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:27,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash 482670800, now seen corresponding path program 1 times [2018-12-03 07:36:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:27,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:27,900 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-03 07:36:27,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:27,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:27,901 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-03 07:36:27,902 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-03 07:36:27,923 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:27,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:28,008 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:28,010 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-03 07:36:28,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:28,016 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:28,053 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 57.22% of their original sizes. [2018-12-03 07:36:28,053 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:28,080 INFO L418 sIntCurrentIteration]: We unified 40 AI predicates to 40 [2018-12-03 07:36:28,080 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:28,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-12-03 07:36:28,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:28,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:36:28,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:36:28,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:36:28,081 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 7 states. [2018-12-03 07:36:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:28,382 INFO L93 Difference]: Finished difference Result 682 states and 1044 transitions. [2018-12-03 07:36:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:36:28,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-03 07:36:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:28,384 INFO L225 Difference]: With dead ends: 682 [2018-12-03 07:36:28,384 INFO L226 Difference]: Without dead ends: 576 [2018-12-03 07:36:28,385 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-03 07:36:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-03 07:36:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 145. [2018-12-03 07:36:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 07:36:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2018-12-03 07:36:28,393 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 41 [2018-12-03 07:36:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:28,394 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2018-12-03 07:36:28,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:36:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2018-12-03 07:36:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:36:28,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:28,395 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-03 07:36:28,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:28,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:28,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1228767343, now seen corresponding path program 1 times [2018-12-03 07:36:28,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:28,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:28,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:28,455 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-03 07:36:28,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:28,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:28,455 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-03 07:36:28,455 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-03 07:36:28,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:28,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:28,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:28,466 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-03 07:36:28,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:28,468 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:28,482 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 63.62% of their original sizes. [2018-12-03 07:36:28,482 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:28,511 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-03 07:36:28,511 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-03 07:36:28,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:28,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:36:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:36:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:36:28,512 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand 9 states. [2018-12-03 07:36:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:29,256 INFO L93 Difference]: Finished difference Result 801 states and 1226 transitions. [2018-12-03 07:36:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:36:29,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-03 07:36:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:29,259 INFO L225 Difference]: With dead ends: 801 [2018-12-03 07:36:29,259 INFO L226 Difference]: Without dead ends: 695 [2018-12-03 07:36:29,260 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-03 07:36:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-03 07:36:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 145. [2018-12-03 07:36:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 07:36:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2018-12-03 07:36:29,269 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 42 [2018-12-03 07:36:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:29,270 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2018-12-03 07:36:29,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:36:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2018-12-03 07:36:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:36:29,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:29,271 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-03 07:36:29,271 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:29,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1156380785, now seen corresponding path program 1 times [2018-12-03 07:36:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:29,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:29,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:29,317 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-03 07:36:29,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:29,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:29,317 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-03 07:36:29,317 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-03 07:36:29,318 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:29,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:29,325 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:29,325 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-03 07:36:29,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:29,327 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:29,339 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 63.62% of their original sizes. [2018-12-03 07:36:29,339 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:29,353 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-03 07:36:29,353 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:29,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:29,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-03 07:36:29,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:29,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:36:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:36:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:36:29,354 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand 8 states. [2018-12-03 07:36:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:29,729 INFO L93 Difference]: Finished difference Result 804 states and 1229 transitions. [2018-12-03 07:36:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:36:29,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-12-03 07:36:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:29,732 INFO L225 Difference]: With dead ends: 804 [2018-12-03 07:36:29,732 INFO L226 Difference]: Without dead ends: 698 [2018-12-03 07:36:29,732 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-03 07:36:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-03 07:36:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 142. [2018-12-03 07:36:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 07:36:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 210 transitions. [2018-12-03 07:36:29,742 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 210 transitions. Word has length 42 [2018-12-03 07:36:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:29,742 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 210 transitions. [2018-12-03 07:36:29,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:36:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 210 transitions. [2018-12-03 07:36:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:36:29,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:29,743 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-03 07:36:29,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:29,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -258689098, now seen corresponding path program 1 times [2018-12-03 07:36:29,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:29,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:29,786 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-03 07:36:29,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:29,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:29,787 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-03 07:36:29,787 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-03 07:36:29,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:29,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:29,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:29,794 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-03 07:36:29,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:29,796 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:29,806 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 60.05% of their original sizes. [2018-12-03 07:36:29,806 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:29,824 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-03 07:36:29,824 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:29,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:29,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-03 07:36:29,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:29,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:36:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:36:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:36:29,825 INFO L87 Difference]: Start difference. First operand 142 states and 210 transitions. Second operand 9 states. [2018-12-03 07:36:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:30,167 INFO L93 Difference]: Finished difference Result 791 states and 1210 transitions. [2018-12-03 07:36:30,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:36:30,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-03 07:36:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:30,169 INFO L225 Difference]: With dead ends: 791 [2018-12-03 07:36:30,169 INFO L226 Difference]: Without dead ends: 685 [2018-12-03 07:36:30,170 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-03 07:36:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-12-03 07:36:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 146. [2018-12-03 07:36:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 07:36:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-03 07:36:30,177 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 42 [2018-12-03 07:36:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:30,177 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-03 07:36:30,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:36:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-03 07:36:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:36:30,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:30,178 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-03 07:36:30,178 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:30,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -236056844, now seen corresponding path program 1 times [2018-12-03 07:36:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:30,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:30,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:30,208 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-03 07:36:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:30,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:30,208 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-03 07:36:30,208 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-03 07:36:30,210 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:30,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:30,214 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:30,214 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-03 07:36:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:30,215 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:30,224 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 60.05% of their original sizes. [2018-12-03 07:36:30,224 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:30,251 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-03 07:36:30,251 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:30,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:30,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-12-03 07:36:30,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:30,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:36:30,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:36:30,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:36:30,252 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 8 states. [2018-12-03 07:36:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:30,583 INFO L93 Difference]: Finished difference Result 793 states and 1210 transitions. [2018-12-03 07:36:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:36:30,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-12-03 07:36:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:30,585 INFO L225 Difference]: With dead ends: 793 [2018-12-03 07:36:30,585 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 07:36:30,585 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-03 07:36:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 07:36:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 146. [2018-12-03 07:36:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 07:36:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-03 07:36:30,591 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 42 [2018-12-03 07:36:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:30,591 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-03 07:36:30,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:36:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-03 07:36:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:36:30,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:30,592 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-03 07:36:30,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1395467255, now seen corresponding path program 1 times [2018-12-03 07:36:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:30,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:30,622 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-03 07:36:30,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:30,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:30,622 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 07:36:30,623 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-03 07:36:30,624 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:30,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:30,628 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:30,628 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-03 07:36:30,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:30,636 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:30,643 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-03 07:36:30,643 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:30,678 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 07:36:30,678 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:30,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:30,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-03 07:36:30,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:30,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:36:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:36:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:36:30,679 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 11 states. [2018-12-03 07:36:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:31,154 INFO L93 Difference]: Finished difference Result 904 states and 1384 transitions. [2018-12-03 07:36:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:36:31,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-12-03 07:36:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:31,156 INFO L225 Difference]: With dead ends: 904 [2018-12-03 07:36:31,156 INFO L226 Difference]: Without dead ends: 798 [2018-12-03 07:36:31,157 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-03 07:36:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-12-03 07:36:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 150. [2018-12-03 07:36:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 07:36:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2018-12-03 07:36:31,169 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 43 [2018-12-03 07:36:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:31,169 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2018-12-03 07:36:31,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:36:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2018-12-03 07:36:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:36:31,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:31,170 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-03 07:36:31,170 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:31,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1418099509, now seen corresponding path program 1 times [2018-12-03 07:36:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:31,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:31,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:31,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:31,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:31,211 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-03 07:36:31,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:31,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:31,212 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 07:36:31,212 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-03 07:36:31,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:31,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:31,217 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:31,217 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-03 07:36:31,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:31,218 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:31,224 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-03 07:36:31,225 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:31,256 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 07:36:31,257 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 07:36:31,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:31,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:36:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:36:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:36:31,257 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand 10 states. [2018-12-03 07:36:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:31,630 INFO L93 Difference]: Finished difference Result 906 states and 1384 transitions. [2018-12-03 07:36:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:36:31,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-03 07:36:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:31,632 INFO L225 Difference]: With dead ends: 906 [2018-12-03 07:36:31,632 INFO L226 Difference]: Without dead ends: 800 [2018-12-03 07:36:31,633 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-03 07:36:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-03 07:36:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 146. [2018-12-03 07:36:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 07:36:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-03 07:36:31,657 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 43 [2018-12-03 07:36:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:31,657 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-03 07:36:31,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:36:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-03 07:36:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:36:31,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:31,658 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-03 07:36:31,658 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:31,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash -848516043, now seen corresponding path program 1 times [2018-12-03 07:36:31,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:31,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:31,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:31,688 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-03 07:36:31,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:31,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:31,688 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 07:36:31,688 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-03 07:36:31,689 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:31,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:31,692 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:31,692 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-03 07:36:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:31,694 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:31,700 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-03 07:36:31,700 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:31,749 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 07:36:31,749 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:31,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 07:36:31,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:31,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:36:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:36:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:36:31,750 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 10 states. [2018-12-03 07:36:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:32,091 INFO L93 Difference]: Finished difference Result 898 states and 1376 transitions. [2018-12-03 07:36:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:36:32,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-03 07:36:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:32,093 INFO L225 Difference]: With dead ends: 898 [2018-12-03 07:36:32,093 INFO L226 Difference]: Without dead ends: 792 [2018-12-03 07:36:32,093 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-03 07:36:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-12-03 07:36:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 146. [2018-12-03 07:36:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 07:36:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2018-12-03 07:36:32,101 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 43 [2018-12-03 07:36:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:32,102 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2018-12-03 07:36:32,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:36:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2018-12-03 07:36:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:36:32,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:32,102 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-03 07:36:32,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:32,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -825883789, now seen corresponding path program 1 times [2018-12-03 07:36:32,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:32,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:32,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:32,130 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-03 07:36:32,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:32,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:32,130 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 07:36:32,131 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-03 07:36:32,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:32,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:32,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:32,135 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-03 07:36:32,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,136 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:32,142 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 65.6% of their original sizes. [2018-12-03 07:36:32,142 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:32,160 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 07:36:32,160 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:32,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-03 07:36:32,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:32,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:36:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:36:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:36:32,161 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand 9 states. [2018-12-03 07:36:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:32,422 INFO L93 Difference]: Finished difference Result 900 states and 1376 transitions. [2018-12-03 07:36:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:36:32,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-12-03 07:36:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:32,423 INFO L225 Difference]: With dead ends: 900 [2018-12-03 07:36:32,423 INFO L226 Difference]: Without dead ends: 794 [2018-12-03 07:36:32,424 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-03 07:36:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-12-03 07:36:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 137. [2018-12-03 07:36:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 07:36:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2018-12-03 07:36:32,435 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 43 [2018-12-03 07:36:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:32,436 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2018-12-03 07:36:32,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:36:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2018-12-03 07:36:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 07:36:32,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:32,436 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-03 07:36:32,436 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1835951532, now seen corresponding path program 1 times [2018-12-03 07:36:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:32,474 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-03 07:36:32,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:32,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:32,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:32,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:32,475 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand 4 states. [2018-12-03 07:36:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:32,557 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2018-12-03 07:36:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:32,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-03 07:36:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:32,558 INFO L225 Difference]: With dead ends: 368 [2018-12-03 07:36:32,558 INFO L226 Difference]: Without dead ends: 256 [2018-12-03 07:36:32,558 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-03 07:36:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-03 07:36:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2018-12-03 07:36:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-03 07:36:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2018-12-03 07:36:32,566 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 47 [2018-12-03 07:36:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:32,567 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2018-12-03 07:36:32,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2018-12-03 07:36:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 07:36:32,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:32,567 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-03 07:36:32,567 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:32,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1306744213, now seen corresponding path program 1 times [2018-12-03 07:36:32,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:32,639 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-03 07:36:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:32,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:32,640 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-12-03 07:36:32,640 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-03 07:36:32,641 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:32,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:32,645 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:32,646 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-03 07:36:32,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,647 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:32,652 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 49.98% of their original sizes. [2018-12-03 07:36:32,653 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:32,665 INFO L418 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-12-03 07:36:32,665 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-12-03 07:36:32,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:32,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:36:32,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:36:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:36:32,666 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand 7 states. [2018-12-03 07:36:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:32,946 INFO L93 Difference]: Finished difference Result 574 states and 865 transitions. [2018-12-03 07:36:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:36:32,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-12-03 07:36:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:32,947 INFO L225 Difference]: With dead ends: 574 [2018-12-03 07:36:32,947 INFO L226 Difference]: Without dead ends: 469 [2018-12-03 07:36:32,948 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-03 07:36:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-03 07:36:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 242. [2018-12-03 07:36:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-03 07:36:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2018-12-03 07:36:32,956 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 47 [2018-12-03 07:36:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:32,956 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2018-12-03 07:36:32,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:36:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2018-12-03 07:36:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 07:36:32,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:32,956 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-03 07:36:32,957 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:32,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -388841782, now seen corresponding path program 1 times [2018-12-03 07:36:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:32,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:32,990 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-03 07:36:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:32,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:32,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:32,990 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 4 states. [2018-12-03 07:36:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:33,058 INFO L93 Difference]: Finished difference Result 681 states and 1036 transitions. [2018-12-03 07:36:33,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:33,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-03 07:36:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:33,059 INFO L225 Difference]: With dead ends: 681 [2018-12-03 07:36:33,059 INFO L226 Difference]: Without dead ends: 476 [2018-12-03 07:36:33,059 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-03 07:36:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-03 07:36:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 419. [2018-12-03 07:36:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 07:36:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 632 transitions. [2018-12-03 07:36:33,072 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 632 transitions. Word has length 48 [2018-12-03 07:36:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:33,073 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 632 transitions. [2018-12-03 07:36:33,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-12-03 07:36:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:36:33,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:33,073 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-03 07:36:33,073 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:33,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:33,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1897999666, now seen corresponding path program 1 times [2018-12-03 07:36:33,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:33,112 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-03 07:36:33,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:33,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:33,112 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 07:36:33,112 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-03 07:36:33,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:33,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:33,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:33,126 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-03 07:36:33,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:33,129 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:33,149 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 51.4% of their original sizes. [2018-12-03 07:36:33,150 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:33,183 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-03 07:36:33,183 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-12-03 07:36:33,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:33,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:36:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:36:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:36:33,184 INFO L87 Difference]: Start difference. First operand 419 states and 632 transitions. Second operand 9 states. [2018-12-03 07:36:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:33,533 INFO L93 Difference]: Finished difference Result 864 states and 1309 transitions. [2018-12-03 07:36:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:36:33,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-12-03 07:36:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:33,535 INFO L225 Difference]: With dead ends: 864 [2018-12-03 07:36:33,535 INFO L226 Difference]: Without dead ends: 760 [2018-12-03 07:36:33,535 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-03 07:36:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-12-03 07:36:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 452. [2018-12-03 07:36:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-03 07:36:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 674 transitions. [2018-12-03 07:36:33,554 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 674 transitions. Word has length 52 [2018-12-03 07:36:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:33,554 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 674 transitions. [2018-12-03 07:36:33,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:36:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 674 transitions. [2018-12-03 07:36:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:36:33,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:33,554 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-03 07:36:33,554 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:33,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1887494540, now seen corresponding path program 1 times [2018-12-03 07:36:33,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:33,585 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-03 07:36:33,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:33,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:36:33,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:33,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:36:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:36:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:36:33,586 INFO L87 Difference]: Start difference. First operand 452 states and 674 transitions. Second operand 3 states. [2018-12-03 07:36:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:33,609 INFO L93 Difference]: Finished difference Result 597 states and 878 transitions. [2018-12-03 07:36:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:36:33,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 07:36:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:33,611 INFO L225 Difference]: With dead ends: 597 [2018-12-03 07:36:33,611 INFO L226 Difference]: Without dead ends: 566 [2018-12-03 07:36:33,611 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-03 07:36:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-12-03 07:36:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 515. [2018-12-03 07:36:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-12-03 07:36:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 769 transitions. [2018-12-03 07:36:33,631 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 769 transitions. Word has length 52 [2018-12-03 07:36:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:33,632 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 769 transitions. [2018-12-03 07:36:33,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:36:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 769 transitions. [2018-12-03 07:36:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:36:33,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:33,632 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-03 07:36:33,632 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:33,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1087112141, now seen corresponding path program 1 times [2018-12-03 07:36:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:33,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:33,665 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-03 07:36:33,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:33,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:33,666 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-03 07:36:33,666 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-03 07:36:33,666 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:33,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:33,673 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:33,673 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-03 07:36:33,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:33,677 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:33,692 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.44% of their original sizes. [2018-12-03 07:36:33,693 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:33,734 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-03 07:36:33,734 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:33,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:33,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-12-03 07:36:33,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:33,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 07:36:33,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 07:36:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:36:33,735 INFO L87 Difference]: Start difference. First operand 515 states and 769 transitions. Second operand 12 states. [2018-12-03 07:36:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:34,701 INFO L93 Difference]: Finished difference Result 1281 states and 1932 transitions. [2018-12-03 07:36:34,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:36:34,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-03 07:36:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:34,704 INFO L225 Difference]: With dead ends: 1281 [2018-12-03 07:36:34,704 INFO L226 Difference]: Without dead ends: 1153 [2018-12-03 07:36:34,705 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-03 07:36:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-12-03 07:36:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 549. [2018-12-03 07:36:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-12-03 07:36:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 812 transitions. [2018-12-03 07:36:34,733 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 812 transitions. Word has length 53 [2018-12-03 07:36:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:34,734 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 812 transitions. [2018-12-03 07:36:34,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 07:36:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 812 transitions. [2018-12-03 07:36:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:36:34,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:34,735 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-03 07:36:34,735 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1158467313, now seen corresponding path program 1 times [2018-12-03 07:36:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:34,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:34,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:34,763 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-03 07:36:34,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:34,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:34,764 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-03 07:36:34,764 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-03 07:36:34,765 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:34,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:34,772 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:34,772 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-03 07:36:34,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:34,776 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:34,792 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.44% of their original sizes. [2018-12-03 07:36:34,792 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:34,821 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-03 07:36:34,821 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:34,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 07:36:34,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:34,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:36:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:36:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:36:34,822 INFO L87 Difference]: Start difference. First operand 549 states and 812 transitions. Second operand 10 states. [2018-12-03 07:36:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:35,217 INFO L93 Difference]: Finished difference Result 1310 states and 1968 transitions. [2018-12-03 07:36:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:36:35,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-03 07:36:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:35,219 INFO L225 Difference]: With dead ends: 1310 [2018-12-03 07:36:35,219 INFO L226 Difference]: Without dead ends: 1182 [2018-12-03 07:36:35,219 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-03 07:36:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-12-03 07:36:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 548. [2018-12-03 07:36:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-12-03 07:36:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 810 transitions. [2018-12-03 07:36:35,241 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 810 transitions. Word has length 53 [2018-12-03 07:36:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:35,241 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 810 transitions. [2018-12-03 07:36:35,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:36:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 810 transitions. [2018-12-03 07:36:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:36:35,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:35,242 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-03 07:36:35,242 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:35,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash 944325260, now seen corresponding path program 1 times [2018-12-03 07:36:35,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:35,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:35,271 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-03 07:36:35,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:35,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:35,271 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-03 07:36:35,271 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-03 07:36:35,272 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:35,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:35,283 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:35,283 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-03 07:36:35,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:35,284 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:35,299 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 56.4% of their original sizes. [2018-12-03 07:36:35,299 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:35,330 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-03 07:36:35,330 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:35,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:35,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-03 07:36:35,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:35,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:36:35,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:36:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:36:35,331 INFO L87 Difference]: Start difference. First operand 548 states and 810 transitions. Second operand 11 states. [2018-12-03 07:36:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:35,840 INFO L93 Difference]: Finished difference Result 1229 states and 1838 transitions. [2018-12-03 07:36:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:36:35,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2018-12-03 07:36:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:35,842 INFO L225 Difference]: With dead ends: 1229 [2018-12-03 07:36:35,842 INFO L226 Difference]: Without dead ends: 1101 [2018-12-03 07:36:35,842 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-03 07:36:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-12-03 07:36:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 578. [2018-12-03 07:36:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-03 07:36:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 849 transitions. [2018-12-03 07:36:35,865 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 849 transitions. Word has length 53 [2018-12-03 07:36:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:35,865 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 849 transitions. [2018-12-03 07:36:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:36:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 849 transitions. [2018-12-03 07:36:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:36:35,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:35,866 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-03 07:36:35,866 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:35,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1367971982, now seen corresponding path program 1 times [2018-12-03 07:36:35,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:35,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:35,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:35,889 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-03 07:36:35,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:35,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:35,890 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-03 07:36:35,890 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-03 07:36:35,891 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:35,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:35,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:36:35,897 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-03 07:36:35,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:35,899 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:36:35,908 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 56.4% of their original sizes. [2018-12-03 07:36:35,908 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:36:35,931 INFO L418 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-12-03 07:36:35,932 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:36:35,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 07:36:35,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:36:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:36:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:36:35,932 INFO L87 Difference]: Start difference. First operand 578 states and 849 transitions. Second operand 10 states. [2018-12-03 07:36:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:36,304 INFO L93 Difference]: Finished difference Result 1252 states and 1869 transitions. [2018-12-03 07:36:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:36:36,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-12-03 07:36:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:36,307 INFO L225 Difference]: With dead ends: 1252 [2018-12-03 07:36:36,307 INFO L226 Difference]: Without dead ends: 1124 [2018-12-03 07:36:36,307 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-03 07:36:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-12-03 07:36:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 578. [2018-12-03 07:36:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-03 07:36:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 849 transitions. [2018-12-03 07:36:36,345 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 849 transitions. Word has length 53 [2018-12-03 07:36:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:36,346 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 849 transitions. [2018-12-03 07:36:36,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:36:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 849 transitions. [2018-12-03 07:36:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 07:36:36,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:36,347 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-03 07:36:36,347 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:36,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1399827541, now seen corresponding path program 1 times [2018-12-03 07:36:36,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:36,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:36,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:36,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:36,378 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-03 07:36:36,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:36,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:36:36,378 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-12-03 07:36:36,379 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-03 07:36:36,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:36:36,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:36:36,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:36:36,402 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-03 07:36:36,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:36,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:36:36,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:36,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:36,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:36,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:36:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:36,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:36,482 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-03 07:36:36,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:36,502 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-03 07:36:36,517 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:36:36,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-12-03 07:36:36,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:36:36,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:36:36,518 INFO L87 Difference]: Start difference. First operand 578 states and 849 transitions. Second operand 4 states. [2018-12-03 07:36:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:37,090 INFO L93 Difference]: Finished difference Result 1266 states and 1941 transitions. [2018-12-03 07:36:37,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:36:37,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 07:36:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:37,092 INFO L225 Difference]: With dead ends: 1266 [2018-12-03 07:36:37,092 INFO L226 Difference]: Without dead ends: 767 [2018-12-03 07:36:37,093 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-03 07:36:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-12-03 07:36:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 679. [2018-12-03 07:36:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-12-03 07:36:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 936 transitions. [2018-12-03 07:36:37,122 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 936 transitions. Word has length 54 [2018-12-03 07:36:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:37,123 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 936 transitions. [2018-12-03 07:36:37,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 936 transitions. [2018-12-03 07:36:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:36:37,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:37,123 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-03 07:36:37,124 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:37,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-03 07:36:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:36:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:36:37,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:36:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:36:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:36:37,155 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:36:37,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:36:37 BoogieIcfgContainer [2018-12-03 07:36:37,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:36:37,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:36:37,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:36:37,196 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:36:37,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:26" (3/4) ... [2018-12-03 07:36:37,199 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 07:36:37,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:36:37,200 INFO L168 Benchmark]: Toolchain (without parser) took 11016.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 953.3 MB in the beginning and 919.2 MB in the end (delta: 34.1 MB). Peak memory consumption was 323.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:36:37,201 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:36:37,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.50 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:36:37,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:36:37,202 INFO L168 Benchmark]: Boogie Preprocessor took 50.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:36:37,202 INFO L168 Benchmark]: RCFGBuilder took 228.14 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:36:37,202 INFO L168 Benchmark]: TraceAbstraction took 10563.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 919.2 MB in the end (delta: 143.5 MB). Peak memory consumption was 340.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:36:37,203 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 919.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:36:37,205 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.50 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 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 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.14 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10563.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 919.2 MB in the end (delta: 143.5 MB). Peak memory consumption was 340.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 919.2 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.5s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 7.9s 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.6s 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-03 07:36:38,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:36:38,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:36:38,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:36:38,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:36:38,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:36:38,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:36:38,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:36:38,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:36:38,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:36:38,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:36:38,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:36:38,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:36:38,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:36:38,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:36:38,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:36:38,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:36:38,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:36:38,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:36:38,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:36:38,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:36:38,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:36:38,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:36:38,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:36:38,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:36:38,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:36:38,575 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:36:38,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:36:38,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:36:38,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:36:38,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:36:38,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:36:38,577 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:36:38,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:36:38,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:36:38,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:36:38,578 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 07:36:38,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:36:38,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:36:38,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:36:38,586 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:36:38,586 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:36:38,586 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:36:38,586 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:36:38,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:36:38,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:36:38,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:36:38,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:36:38,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:36:38,589 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 07:36:38,589 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_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:38,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:36:38,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:36:38,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:36:38,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:36:38,622 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:36:38,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:38,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/c42773199/d8580e00b36f4e66a3c52fe62271b272/FLAGf65c9997f [2018-12-03 07:36:39,117 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:36:39,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:39,122 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/c42773199/d8580e00b36f4e66a3c52fe62271b272/FLAGf65c9997f [2018-12-03 07:36:39,129 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/data/c42773199/d8580e00b36f4e66a3c52fe62271b272 [2018-12-03 07:36:39,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:36:39,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:36:39,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:36:39,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:36:39,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:36:39,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5a08fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39, skipping insertion in model container [2018-12-03 07:36:39,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:36:39,153 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:36:39,254 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:36:39,256 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:36:39,280 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:36:39,289 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:36:39,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39 WrapperNode [2018-12-03 07:36:39,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:36:39,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:36:39,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:36:39,290 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:36:39,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:36:39,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:36:39,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:36:39,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:36:39,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... [2018-12-03 07:36:39,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:36:39,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:36:39,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:36:39,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:36:39,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-12-03 07:36:39,401 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-12-03 07:36:39,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:36:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:36:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:36:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:36:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:36:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:36:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-03 07:36:39,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-03 07:36:39,599 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:36:39,600 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 07:36:39,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:39 BoogieIcfgContainer [2018-12-03 07:36:39,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:36:39,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:36:39,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:36:39,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:36:39,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:36:39" (1/3) ... [2018-12-03 07:36:39,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685d197f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:39, skipping insertion in model container [2018-12-03 07:36:39,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:36:39" (2/3) ... [2018-12-03 07:36:39,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685d197f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:39, skipping insertion in model container [2018-12-03 07:36:39,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:39" (3/3) ... [2018-12-03 07:36:39,604 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-12-03 07:36:39,611 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:36:39,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:36:39,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:36:39,641 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:36:39,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:36:39,642 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:36:39,642 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:36:39,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:36:39,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:36:39,642 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:36:39,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:36:39,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:36:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-03 07:36:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:36:39,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:39,656 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-03 07:36:39,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:39,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2018-12-03 07:36:39,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:39,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:39,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:39,808 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-03 07:36:39,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:39,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:39,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:36:39,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 07:36:39,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 07:36:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 07:36:39,822 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-12-03 07:36:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:39,838 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2018-12-03 07:36:39,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 07:36:39,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-12-03 07:36:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:39,846 INFO L225 Difference]: With dead ends: 76 [2018-12-03 07:36:39,846 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 07:36:39,847 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-03 07:36:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 07:36:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 07:36:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 07:36:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2018-12-03 07:36:39,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2018-12-03 07:36:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:39,871 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2018-12-03 07:36:39,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 07:36:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2018-12-03 07:36:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 07:36:39,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:39,873 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-03 07:36:39,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:39,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2018-12-03 07:36:39,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:39,874 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:39,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:39,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:39,938 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-03 07:36:39,938 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:39,940 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 4 states. [2018-12-03 07:36:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:40,042 INFO L93 Difference]: Finished difference Result 127 states and 213 transitions. [2018-12-03 07:36:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:36:40,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-03 07:36:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:40,044 INFO L225 Difference]: With dead ends: 127 [2018-12-03 07:36:40,044 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 07:36:40,045 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-03 07:36:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 07:36:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2018-12-03 07:36:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 07:36:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-03 07:36:40,053 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 21 [2018-12-03 07:36:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:40,053 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-03 07:36:40,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-03 07:36:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:36:40,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:40,054 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-03 07:36:40,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:40,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1988705185, now seen corresponding path program 1 times [2018-12-03 07:36:40,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:40,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:40,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:40,121 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-03 07:36:40,121 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:40,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:36:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:36:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:36:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:36:40,123 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 5 states. [2018-12-03 07:36:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:40,293 INFO L93 Difference]: Finished difference Result 173 states and 282 transitions. [2018-12-03 07:36:40,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:40,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-03 07:36:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:40,295 INFO L225 Difference]: With dead ends: 173 [2018-12-03 07:36:40,295 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 07:36:40,295 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-03 07:36:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 07:36:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2018-12-03 07:36:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 07:36:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2018-12-03 07:36:40,302 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 22 [2018-12-03 07:36:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:40,302 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2018-12-03 07:36:40,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:36:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-12-03 07:36:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:36:40,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:40,303 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-03 07:36:40,303 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:40,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1386022735, now seen corresponding path program 1 times [2018-12-03 07:36:40,304 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:40,304 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:40,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:40,368 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-03 07:36:40,368 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:40,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:40,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:36:40,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:36:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:36:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:36:40,371 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand 7 states. [2018-12-03 07:36:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:40,519 INFO L93 Difference]: Finished difference Result 215 states and 343 transitions. [2018-12-03 07:36:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:36:40,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-03 07:36:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:40,521 INFO L225 Difference]: With dead ends: 215 [2018-12-03 07:36:40,521 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 07:36:40,521 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-03 07:36:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 07:36:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2018-12-03 07:36:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 07:36:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 183 transitions. [2018-12-03 07:36:40,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 183 transitions. Word has length 23 [2018-12-03 07:36:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 183 transitions. [2018-12-03 07:36:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:36:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 183 transitions. [2018-12-03 07:36:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:36:40,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:40,530 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-03 07:36:40,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:40,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1127857297, now seen corresponding path program 1 times [2018-12-03 07:36:40,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:40,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:40,598 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-03 07:36:40,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:40,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:36:40,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:36:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:36:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:36:40,600 INFO L87 Difference]: Start difference. First operand 120 states and 183 transitions. Second operand 6 states. [2018-12-03 07:36:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:40,804 INFO L93 Difference]: Finished difference Result 234 states and 364 transitions. [2018-12-03 07:36:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:36:40,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-03 07:36:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:40,805 INFO L225 Difference]: With dead ends: 234 [2018-12-03 07:36:40,805 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 07:36:40,806 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-03 07:36:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 07:36:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 96. [2018-12-03 07:36:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 07:36:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-12-03 07:36:40,812 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 23 [2018-12-03 07:36:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:40,812 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-12-03 07:36:40,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:36:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-12-03 07:36:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 07:36:40,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:40,813 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-03 07:36:40,814 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:40,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash 214387631, now seen corresponding path program 1 times [2018-12-03 07:36:40,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:40,814 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:40,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:40,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:40,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-03 07:36:40,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:36:40,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:36:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:36:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:36:40,861 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 4 states. [2018-12-03 07:36:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:40,948 INFO L93 Difference]: Finished difference Result 254 states and 370 transitions. [2018-12-03 07:36:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:36:40,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-03 07:36:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:40,949 INFO L225 Difference]: With dead ends: 254 [2018-12-03 07:36:40,949 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 07:36:40,950 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-03 07:36:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 07:36:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2018-12-03 07:36:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 07:36:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-03 07:36:40,955 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 34 [2018-12-03 07:36:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:40,956 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-03 07:36:40,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:36:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-03 07:36:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 07:36:40,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:40,957 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-03 07:36:40,957 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:40,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1041972219, now seen corresponding path program 1 times [2018-12-03 07:36:40,957 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:40,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:41,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:41,021 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-03 07:36:41,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:41,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:41,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:36:41,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:36:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:36:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:36:41,023 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 5 states. [2018-12-03 07:36:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:41,113 INFO L93 Difference]: Finished difference Result 334 states and 488 transitions. [2018-12-03 07:36:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:36:41,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-03 07:36:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:41,114 INFO L225 Difference]: With dead ends: 334 [2018-12-03 07:36:41,114 INFO L226 Difference]: Without dead ends: 260 [2018-12-03 07:36:41,114 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-03 07:36:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-03 07:36:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2018-12-03 07:36:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 07:36:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-12-03 07:36:41,120 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 35 [2018-12-03 07:36:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:41,120 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-12-03 07:36:41,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:36:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-12-03 07:36:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:36:41,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:41,121 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-03 07:36:41,121 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:41,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash 919023332, now seen corresponding path program 1 times [2018-12-03 07:36:41,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:41,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:41,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:41,183 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-03 07:36:41,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:41,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:36:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:36:41,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:36:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:36:41,185 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 7 states. [2018-12-03 07:36:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:41,300 INFO L93 Difference]: Finished difference Result 408 states and 594 transitions. [2018-12-03 07:36:41,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:36:41,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-03 07:36:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:41,302 INFO L225 Difference]: With dead ends: 408 [2018-12-03 07:36:41,302 INFO L226 Difference]: Without dead ends: 334 [2018-12-03 07:36:41,303 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-03 07:36:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-03 07:36:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2018-12-03 07:36:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 07:36:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2018-12-03 07:36:41,313 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 36 [2018-12-03 07:36:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:41,314 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2018-12-03 07:36:41,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:36:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2018-12-03 07:36:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 07:36:41,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:41,315 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-03 07:36:41,315 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:41,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1452715930, now seen corresponding path program 1 times [2018-12-03 07:36:41,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:41,316 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:41,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:41,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:41,370 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-03 07:36:41,370 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:41,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:36:41,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:36:41,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:36:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:36:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:36:41,372 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand 6 states. [2018-12-03 07:36:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:41,516 INFO L93 Difference]: Finished difference Result 406 states and 588 transitions. [2018-12-03 07:36:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:36:41,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-12-03 07:36:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:41,517 INFO L225 Difference]: With dead ends: 406 [2018-12-03 07:36:41,517 INFO L226 Difference]: Without dead ends: 332 [2018-12-03 07:36:41,518 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-03 07:36:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-03 07:36:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 156. [2018-12-03 07:36:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 07:36:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2018-12-03 07:36:41,523 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 36 [2018-12-03 07:36:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:41,523 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2018-12-03 07:36:41,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:36:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2018-12-03 07:36:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 07:36:41,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:41,524 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-03 07:36:41,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:41,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 617124283, now seen corresponding path program 1 times [2018-12-03 07:36:41,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:41,579 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-03 07:36:41,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:41,606 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-03 07:36:41,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:41,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:41,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:41,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:41,633 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-03 07:36:41,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:41,654 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-03 07:36:41,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:36:41,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4, 4] total 12 [2018-12-03 07:36:41,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 07:36:41,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 07:36:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:36:41,669 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand 12 states. [2018-12-03 07:36:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:42,434 INFO L93 Difference]: Finished difference Result 864 states and 1399 transitions. [2018-12-03 07:36:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 07:36:42,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-03 07:36:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:42,436 INFO L225 Difference]: With dead ends: 864 [2018-12-03 07:36:42,436 INFO L226 Difference]: Without dead ends: 734 [2018-12-03 07:36:42,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2018-12-03 07:36:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-03 07:36:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 602. [2018-12-03 07:36:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 07:36:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 906 transitions. [2018-12-03 07:36:42,469 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 906 transitions. Word has length 38 [2018-12-03 07:36:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:42,470 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 906 transitions. [2018-12-03 07:36:42,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 07:36:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 906 transitions. [2018-12-03 07:36:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 07:36:42,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:42,471 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-03 07:36:42,471 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:42,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -569962265, now seen corresponding path program 1 times [2018-12-03 07:36:42,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:42,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:42,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:42,536 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-03 07:36:42,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:42,562 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-03 07:36:42,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:42,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:42,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:42,591 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-03 07:36:42,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:36:42,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:36:42,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2018-12-03 07:36:42,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:36:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:36:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:36:42,607 INFO L87 Difference]: Start difference. First operand 602 states and 906 transitions. Second operand 9 states. [2018-12-03 07:36:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:36:43,024 INFO L93 Difference]: Finished difference Result 1777 states and 2720 transitions. [2018-12-03 07:36:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:36:43,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-12-03 07:36:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:36:43,027 INFO L225 Difference]: With dead ends: 1777 [2018-12-03 07:36:43,027 INFO L226 Difference]: Without dead ends: 1451 [2018-12-03 07:36:43,027 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-03 07:36:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2018-12-03 07:36:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1184. [2018-12-03 07:36:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-12-03 07:36:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1745 transitions. [2018-12-03 07:36:43,063 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1745 transitions. Word has length 58 [2018-12-03 07:36:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:36:43,064 INFO L480 AbstractCegarLoop]: Abstraction has 1184 states and 1745 transitions. [2018-12-03 07:36:43,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:36:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1745 transitions. [2018-12-03 07:36:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:36:43,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:36:43,065 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-03 07:36:43,065 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:36:43,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:36:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2018-12-03 07:36:43,066 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:36:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:43,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:44,160 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-03 07:36:44,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:46,689 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-03 07:36:46,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:36:46,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:36:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:36:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:36:46,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:36:46,989 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-03 07:36:46,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:36:47,538 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-03 07:36:47,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:36:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23] total 48 [2018-12-03 07:36:47,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 07:36:47,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 07:36:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2052, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 07:36:47,554 INFO L87 Difference]: Start difference. First operand 1184 states and 1745 transitions. Second operand 48 states. [2018-12-03 07:37:07,390 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-12-03 07:37:09,478 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2018-12-03 07:37:10,956 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-12-03 07:37:11,589 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-03 07:37:13,616 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-03 07:37:14,558 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-03 07:37:15,192 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-03 07:37:21,785 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-12-03 07:37:23,223 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-03 07:37:23,524 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-03 07:37:24,190 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-12-03 07:37:24,512 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-12-03 07:37:25,847 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-12-03 07:37:26,354 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2018-12-03 07:37:26,820 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-03 07:37:27,106 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-03 07:37:27,600 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-03 07:37:28,519 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-12-03 07:37:29,459 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-12-03 07:37:29,806 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-03 07:37:31,232 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-03 07:37:31,770 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-12-03 07:37:32,878 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-12-03 07:37:34,968 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-12-03 07:37:35,507 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-12-03 07:37:36,053 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-12-03 07:37:36,571 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2018-12-03 07:37:38,244 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-03 07:37:38,513 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-03 07:37:39,167 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-12-03 07:37:39,664 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-03 07:37:40,430 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2018-12-03 07:37:41,014 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2018-12-03 07:37:41,615 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-12-03 07:37:42,807 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2018-12-03 07:37:43,140 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2018-12-03 07:37:44,086 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-03 07:37:44,459 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2018-12-03 07:37:45,920 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-03 07:37:47,805 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-12-03 07:37:48,218 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2018-12-03 07:37:48,775 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-03 07:37:49,141 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2018-12-03 07:37:49,665 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-12-03 07:37:50,748 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-03 07:37:51,956 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-03 07:37:53,577 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-03 07:37:54,110 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-12-03 07:37:54,527 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-03 07:37:54,988 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2018-12-03 07:37:56,579 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-12-03 07:37:57,444 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-03 07:37:57,917 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-03 07:37:58,795 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-12-03 07:37:59,437 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2018-12-03 07:38:00,351 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2018-12-03 07:38:00,800 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-03 07:38:01,503 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-03 07:38:02,047 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-03 07:38:02,666 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2018-12-03 07:38:04,417 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-03 07:38:04,914 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-03 07:38:06,035 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 118 [2018-12-03 07:38:06,697 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-03 07:38:07,147 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-03 07:38:08,204 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-03 07:38:08,768 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-12-03 07:38:09,851 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2018-12-03 07:38:10,907 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-12-03 07:38:11,538 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-12-03 07:38:14,310 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-12-03 07:38:15,306 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 121 [2018-12-03 07:38:15,911 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-03 07:38:16,572 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-03 07:38:17,050 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-12-03 07:38:18,684 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2018-12-03 07:38:19,400 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2018-12-03 07:38:20,372 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2018-12-03 07:38:20,956 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-12-03 07:38:21,522 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2018-12-03 07:38:22,540 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-12-03 07:38:23,087 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-12-03 07:38:23,694 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-03 07:38:24,910 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-12-03 07:38:25,419 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2018-12-03 07:38:25,961 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2018-12-03 07:38:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:26,013 INFO L93 Difference]: Finished difference Result 10102 states and 15163 transitions. [2018-12-03 07:38:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2018-12-03 07:38:26,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-12-03 07:38:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:26,029 INFO L225 Difference]: With dead ends: 10102 [2018-12-03 07:38:26,029 INFO L226 Difference]: Without dead ends: 9749 [2018-12-03 07:38:26,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31832 ImplicationChecksByTransitivity, 81.9s TimeCoverageRelationStatistics Valid=18544, Invalid=72358, Unknown=0, NotChecked=0, Total=90902 [2018-12-03 07:38:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2018-12-03 07:38:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 3517. [2018-12-03 07:38:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3517 states. [2018-12-03 07:38:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 5422 transitions. [2018-12-03 07:38:26,217 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 5422 transitions. Word has length 60 [2018-12-03 07:38:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:26,217 INFO L480 AbstractCegarLoop]: Abstraction has 3517 states and 5422 transitions. [2018-12-03 07:38:26,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 07:38:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 5422 transitions. [2018-12-03 07:38:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:38:26,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:26,219 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-03 07:38:26,219 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:38:26,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1987160410, now seen corresponding path program 1 times [2018-12-03 07:38:26,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:26,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:26,291 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-03 07:38:26,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:26,318 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-03 07:38:26,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:38:26,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:26,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:26,346 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-03 07:38:26,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:26,385 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-03 07:38:26,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:38:26,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5, 4] total 10 [2018-12-03 07:38:26,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:38:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:38:26,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:38:26,402 INFO L87 Difference]: Start difference. First operand 3517 states and 5422 transitions. Second operand 10 states. [2018-12-03 07:38:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:27,200 INFO L93 Difference]: Finished difference Result 8531 states and 13372 transitions. [2018-12-03 07:38:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 07:38:27,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-12-03 07:38:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:27,207 INFO L225 Difference]: With dead ends: 8531 [2018-12-03 07:38:27,207 INFO L226 Difference]: Without dead ends: 5047 [2018-12-03 07:38:27,210 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-03 07:38:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2018-12-03 07:38:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 4331. [2018-12-03 07:38:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2018-12-03 07:38:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6202 transitions. [2018-12-03 07:38:27,362 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6202 transitions. Word has length 60 [2018-12-03 07:38:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:27,362 INFO L480 AbstractCegarLoop]: Abstraction has 4331 states and 6202 transitions. [2018-12-03 07:38:27,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:38:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6202 transitions. [2018-12-03 07:38:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:38:27,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:27,363 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-03 07:38:27,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:38:27,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1930321118, now seen corresponding path program 1 times [2018-12-03 07:38:27,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:27,363 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:27,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:27,396 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-03 07:38:27,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:38:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:38:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:38:27,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:38:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:38:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:38:27,398 INFO L87 Difference]: Start difference. First operand 4331 states and 6202 transitions. Second operand 3 states. [2018-12-03 07:38:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:27,559 INFO L93 Difference]: Finished difference Result 5190 states and 7268 transitions. [2018-12-03 07:38:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:38:27,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 07:38:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:27,566 INFO L225 Difference]: With dead ends: 5190 [2018-12-03 07:38:27,566 INFO L226 Difference]: Without dead ends: 5102 [2018-12-03 07:38:27,567 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-03 07:38:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2018-12-03 07:38:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4686. [2018-12-03 07:38:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-12-03 07:38:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6625 transitions. [2018-12-03 07:38:27,727 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6625 transitions. Word has length 60 [2018-12-03 07:38:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:27,727 INFO L480 AbstractCegarLoop]: Abstraction has 4686 states and 6625 transitions. [2018-12-03 07:38:27,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:38:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6625 transitions. [2018-12-03 07:38:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:38:27,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:27,729 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-03 07:38:27,729 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:38:27,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash -666750562, now seen corresponding path program 1 times [2018-12-03 07:38:27,729 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:27,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:27,802 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-03 07:38:27,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:38:27,845 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-03 07:38:27,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:38:27,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:38:27,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:38:27,892 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-03 07:38:27,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:38:27,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:38:27,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2018-12-03 07:38:27,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 07:38:27,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 07:38:27,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:38:27,907 INFO L87 Difference]: Start difference. First operand 4686 states and 6625 transitions. Second operand 14 states. [2018-12-03 07:38:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:38:29,294 INFO L93 Difference]: Finished difference Result 10771 states and 15360 transitions. [2018-12-03 07:38:29,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 07:38:29,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-12-03 07:38:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:38:29,302 INFO L225 Difference]: With dead ends: 10771 [2018-12-03 07:38:29,302 INFO L226 Difference]: Without dead ends: 5824 [2018-12-03 07:38:29,307 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-03 07:38:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2018-12-03 07:38:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 3172. [2018-12-03 07:38:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3172 states. [2018-12-03 07:38:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 3985 transitions. [2018-12-03 07:38:29,477 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 3985 transitions. Word has length 60 [2018-12-03 07:38:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:38:29,477 INFO L480 AbstractCegarLoop]: Abstraction has 3172 states and 3985 transitions. [2018-12-03 07:38:29,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 07:38:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 3985 transitions. [2018-12-03 07:38:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 07:38:29,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:38:29,478 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-03 07:38:29,479 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:38:29,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:38:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1543067804, now seen corresponding path program 1 times [2018-12-03 07:38:29,479 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:38:29,479 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/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-03 07:38:29,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:38:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:38:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:38:29,585 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:38:29,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:38:29 BoogieIcfgContainer [2018-12-03 07:38:29,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:38:29,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:38:29,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:38:29,630 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:38:29,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:39" (3/4) ... [2018-12-03 07:38:29,632 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 07:38:29,706 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_847182e4-96d9-4c20-8271-e64e8a108c14/bin-2019/utaipan/witness.graphml [2018-12-03 07:38:29,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:38:29,707 INFO L168 Benchmark]: Toolchain (without parser) took 110575.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -115.5 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:38:29,708 INFO L168 Benchmark]: CDTParser took 0.16 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-03 07:38:29,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.21 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:38:29,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.62 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:38:29,708 INFO L168 Benchmark]: Boogie Preprocessor took 20.85 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:38:29,708 INFO L168 Benchmark]: RCFGBuilder took 273.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-03 07:38:29,709 INFO L168 Benchmark]: TraceAbstraction took 110029.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:38:29,709 INFO L168 Benchmark]: Witness Printer took 76.89 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:38:29,710 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.21 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.62 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.85 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110029.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.3 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. * Witness Printer took 76.89 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 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.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 103.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1847 SDtfs, 6936 SDslu, 11502 SDs, 0 SdLazy, 18175 SolverSat, 1342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1606 GetRequests, 1175 SyntacticMatches, 9 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32370 ImplicationChecksByTransitivity, 82.7s 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 11212 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s 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...