./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f5127d70955803df41127d215928a4ef91e235c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 11:02:46,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:02:46,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:02:46,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:02:46,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:02:46,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:02:46,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:02:46,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:02:46,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:02:46,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:02:46,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:02:46,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:02:46,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:02:46,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:02:46,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:02:46,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:02:46,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:02:46,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:02:46,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:02:46,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:02:46,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:02:46,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:02:46,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:02:46,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:02:46,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:02:46,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:02:46,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:02:46,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:02:46,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:02:46,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:02:46,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:02:46,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:02:46,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:02:46,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:02:46,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:02:46,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:02:46,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:02:46,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:02:46,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:02:46,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:02:46,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:02:46,474 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:02:46,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:02:46,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:02:46,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:02:46,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:02:46,488 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:02:46,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:02:46,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:02:46,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:02:46,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:02:46,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:02:46,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:02:46,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:02:46,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:02:46,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:02:46,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:02:46,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:02:46,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:02:46,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:02:46,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:02:46,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f5127d70955803df41127d215928a4ef91e235c [2019-12-07 11:02:46,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:02:46,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:02:46,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:02:46,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:02:46,609 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:02:46,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-12-07 11:02:46,650 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/data/46418955b/d0a447cc4f1542a7b0d0673126a4f1f4/FLAGf316c9002 [2019-12-07 11:02:47,049 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:02:47,049 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-12-07 11:02:47,054 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/data/46418955b/d0a447cc4f1542a7b0d0673126a4f1f4/FLAGf316c9002 [2019-12-07 11:02:47,435 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/data/46418955b/d0a447cc4f1542a7b0d0673126a4f1f4 [2019-12-07 11:02:47,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:02:47,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:02:47,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:47,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:02:47,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:02:47,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b211215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47, skipping insertion in model container [2019-12-07 11:02:47,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:02:47,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:02:47,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:47,642 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:02:47,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:47,680 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:02:47,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47 WrapperNode [2019-12-07 11:02:47,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:47,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:47,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:02:47,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:02:47,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:47,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:02:47,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:02:47,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:02:47,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... [2019-12-07 11:02:47,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:02:47,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:02:47,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:02:47,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:02:47,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:02:47,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:02:47,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:02:48,025 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:02:48,026 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:02:48,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:48 BoogieIcfgContainer [2019-12-07 11:02:48,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:02:48,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:02:48,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:02:48,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:02:48,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:02:47" (1/3) ... [2019-12-07 11:02:48,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abf818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:48, skipping insertion in model container [2019-12-07 11:02:48,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:47" (2/3) ... [2019-12-07 11:02:48,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abf818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:48, skipping insertion in model container [2019-12-07 11:02:48,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:48" (3/3) ... [2019-12-07 11:02:48,031 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-12-07 11:02:48,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:02:48,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:02:48,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:02:48,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:02:48,065 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:02:48,065 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:02:48,065 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:02:48,065 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:02:48,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:02:48,066 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:02:48,066 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:02:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-12-07 11:02:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:02:48,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:48,081 INFO L410 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] [2019-12-07 11:02:48,082 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash -976687966, now seen corresponding path program 1 times [2019-12-07 11:02:48,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:48,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725596717] [2019-12-07 11:02:48,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:48,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725596717] [2019-12-07 11:02:48,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:48,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:48,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194601027] [2019-12-07 11:02:48,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:48,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:48,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:48,265 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-12-07 11:02:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:48,302 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2019-12-07 11:02:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:48,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 11:02:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:48,311 INFO L225 Difference]: With dead ends: 146 [2019-12-07 11:02:48,311 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 11:02:48,313 INFO L630 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 [2019-12-07 11:02:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 11:02:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-12-07 11:02:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 11:02:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2019-12-07 11:02:48,342 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2019-12-07 11:02:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2019-12-07 11:02:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2019-12-07 11:02:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 11:02:48,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:48,343 INFO L410 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] [2019-12-07 11:02:48,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1572742836, now seen corresponding path program 1 times [2019-12-07 11:02:48,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:48,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423954567] [2019-12-07 11:02:48,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:48,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423954567] [2019-12-07 11:02:48,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:48,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:48,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569334117] [2019-12-07 11:02:48,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:48,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:48,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:48,406 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand 3 states. [2019-12-07 11:02:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:48,430 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2019-12-07 11:02:48,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:48,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 11:02:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:48,432 INFO L225 Difference]: With dead ends: 225 [2019-12-07 11:02:48,432 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 11:02:48,432 INFO L630 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 [2019-12-07 11:02:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 11:02:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2019-12-07 11:02:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:02:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-12-07 11:02:48,446 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2019-12-07 11:02:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:48,446 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-12-07 11:02:48,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-12-07 11:02:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:02:48,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:48,448 INFO L410 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, 1] [2019-12-07 11:02:48,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1624580866, now seen corresponding path program 1 times [2019-12-07 11:02:48,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:48,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480928947] [2019-12-07 11:02:48,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:48,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480928947] [2019-12-07 11:02:48,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:48,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:02:48,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234697936] [2019-12-07 11:02:48,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:02:48,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:02:48,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:02:48,550 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 9 states. [2019-12-07 11:02:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:48,863 INFO L93 Difference]: Finished difference Result 661 states and 1028 transitions. [2019-12-07 11:02:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:02:48,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-07 11:02:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:48,869 INFO L225 Difference]: With dead ends: 661 [2019-12-07 11:02:48,869 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 11:02:48,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:02:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 11:02:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2019-12-07 11:02:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-07 11:02:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 816 transitions. [2019-12-07 11:02:48,924 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 816 transitions. Word has length 39 [2019-12-07 11:02:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 816 transitions. [2019-12-07 11:02:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:02:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 816 transitions. [2019-12-07 11:02:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:02:48,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:48,927 INFO L410 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, 1] [2019-12-07 11:02:48,927 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:48,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash 828355897, now seen corresponding path program 1 times [2019-12-07 11:02:48,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:48,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125054753] [2019-12-07 11:02:48,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125054753] [2019-12-07 11:02:48,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:48,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:48,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370301336] [2019-12-07 11:02:48,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:02:48,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:02:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:48,996 INFO L87 Difference]: Start difference. First operand 525 states and 816 transitions. Second operand 6 states. [2019-12-07 11:02:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,087 INFO L93 Difference]: Finished difference Result 781 states and 1218 transitions. [2019-12-07 11:02:49,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:49,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 11:02:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,089 INFO L225 Difference]: With dead ends: 781 [2019-12-07 11:02:49,089 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 11:02:49,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 11:02:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-12-07 11:02:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 11:02:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 416 transitions. [2019-12-07 11:02:49,106 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 416 transitions. Word has length 39 [2019-12-07 11:02:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:49,106 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 416 transitions. [2019-12-07 11:02:49,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:02:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 416 transitions. [2019-12-07 11:02:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:02:49,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:49,108 INFO L410 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, 1] [2019-12-07 11:02:49,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1223356835, now seen corresponding path program 1 times [2019-12-07 11:02:49,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:49,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288106488] [2019-12-07 11:02:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:49,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288106488] [2019-12-07 11:02:49,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:49,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:02:49,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819212344] [2019-12-07 11:02:49,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:49,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,160 INFO L87 Difference]: Start difference. First operand 273 states and 416 transitions. Second operand 5 states. [2019-12-07 11:02:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,223 INFO L93 Difference]: Finished difference Result 527 states and 813 transitions. [2019-12-07 11:02:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:49,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 11:02:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,225 INFO L225 Difference]: With dead ends: 527 [2019-12-07 11:02:49,225 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 11:02:49,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:02:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 11:02:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-12-07 11:02:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 11:02:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 412 transitions. [2019-12-07 11:02:49,239 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 412 transitions. Word has length 39 [2019-12-07 11:02:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:49,240 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 412 transitions. [2019-12-07 11:02:49,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 412 transitions. [2019-12-07 11:02:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:02:49,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:49,241 INFO L410 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, 1] [2019-12-07 11:02:49,241 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash -618673698, now seen corresponding path program 1 times [2019-12-07 11:02:49,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:49,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256582999] [2019-12-07 11:02:49,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:49,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256582999] [2019-12-07 11:02:49,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:49,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:49,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631909083] [2019-12-07 11:02:49,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:49,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,296 INFO L87 Difference]: Start difference. First operand 273 states and 412 transitions. Second operand 5 states. [2019-12-07 11:02:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,372 INFO L93 Difference]: Finished difference Result 1289 states and 1984 transitions. [2019-12-07 11:02:49,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:49,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 11:02:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,379 INFO L225 Difference]: With dead ends: 1289 [2019-12-07 11:02:49,379 INFO L226 Difference]: Without dead ends: 1035 [2019-12-07 11:02:49,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-07 11:02:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 777. [2019-12-07 11:02:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 11:02:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2019-12-07 11:02:49,412 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 39 [2019-12-07 11:02:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:49,412 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2019-12-07 11:02:49,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2019-12-07 11:02:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:02:49,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:49,413 INFO L410 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, 1, 1, 1] [2019-12-07 11:02:49,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1533207258, now seen corresponding path program 1 times [2019-12-07 11:02:49,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:49,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752566023] [2019-12-07 11:02:49,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:49,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752566023] [2019-12-07 11:02:49,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:49,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:49,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744387699] [2019-12-07 11:02:49,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:49,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:49,442 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 3 states. [2019-12-07 11:02:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,520 INFO L93 Difference]: Finished difference Result 1857 states and 2816 transitions. [2019-12-07 11:02:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:49,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:02:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,527 INFO L225 Difference]: With dead ends: 1857 [2019-12-07 11:02:49,527 INFO L226 Difference]: Without dead ends: 1099 [2019-12-07 11:02:49,528 INFO L630 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 [2019-12-07 11:02:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-12-07 11:02:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1085. [2019-12-07 11:02:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2019-12-07 11:02:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1610 transitions. [2019-12-07 11:02:49,582 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1610 transitions. Word has length 41 [2019-12-07 11:02:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:49,583 INFO L462 AbstractCegarLoop]: Abstraction has 1085 states and 1610 transitions. [2019-12-07 11:02:49,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1610 transitions. [2019-12-07 11:02:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:02:49,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:49,584 INFO L410 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, 1, 1, 1] [2019-12-07 11:02:49,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1554209913, now seen corresponding path program 1 times [2019-12-07 11:02:49,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:49,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320902301] [2019-12-07 11:02:49,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:49,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320902301] [2019-12-07 11:02:49,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:49,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:49,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385372845] [2019-12-07 11:02:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:49,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:49,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,649 INFO L87 Difference]: Start difference. First operand 1085 states and 1610 transitions. Second operand 5 states. [2019-12-07 11:02:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,740 INFO L93 Difference]: Finished difference Result 2409 states and 3596 transitions. [2019-12-07 11:02:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:49,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 11:02:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,745 INFO L225 Difference]: With dead ends: 2409 [2019-12-07 11:02:49,745 INFO L226 Difference]: Without dead ends: 1343 [2019-12-07 11:02:49,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-12-07 11:02:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1085. [2019-12-07 11:02:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2019-12-07 11:02:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1598 transitions. [2019-12-07 11:02:49,800 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1598 transitions. Word has length 41 [2019-12-07 11:02:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:49,800 INFO L462 AbstractCegarLoop]: Abstraction has 1085 states and 1598 transitions. [2019-12-07 11:02:49,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1598 transitions. [2019-12-07 11:02:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:02:49,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:49,801 INFO L410 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, 1, 1, 1, 1] [2019-12-07 11:02:49,801 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:49,801 INFO L82 PathProgramCache]: Analyzing trace with hash 933957624, now seen corresponding path program 1 times [2019-12-07 11:02:49,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:49,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187521172] [2019-12-07 11:02:49,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:49,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187521172] [2019-12-07 11:02:49,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:49,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:49,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986320682] [2019-12-07 11:02:49,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:49,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:49,843 INFO L87 Difference]: Start difference. First operand 1085 states and 1598 transitions. Second operand 5 states. [2019-12-07 11:02:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:49,967 INFO L93 Difference]: Finished difference Result 2046 states and 3005 transitions. [2019-12-07 11:02:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:02:49,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 11:02:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:49,975 INFO L225 Difference]: With dead ends: 2046 [2019-12-07 11:02:49,976 INFO L226 Difference]: Without dead ends: 2044 [2019-12-07 11:02:49,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:02:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-12-07 11:02:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1141. [2019-12-07 11:02:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2019-12-07 11:02:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1650 transitions. [2019-12-07 11:02:50,041 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1650 transitions. Word has length 42 [2019-12-07 11:02:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:50,042 INFO L462 AbstractCegarLoop]: Abstraction has 1141 states and 1650 transitions. [2019-12-07 11:02:50,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1650 transitions. [2019-12-07 11:02:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:02:50,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:50,042 INFO L410 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, 1, 1, 1, 1] [2019-12-07 11:02:50,043 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash 883353381, now seen corresponding path program 1 times [2019-12-07 11:02:50,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:50,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075180313] [2019-12-07 11:02:50,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:50,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075180313] [2019-12-07 11:02:50,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:50,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:50,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108364832] [2019-12-07 11:02:50,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:50,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:50,065 INFO L87 Difference]: Start difference. First operand 1141 states and 1650 transitions. Second operand 3 states. [2019-12-07 11:02:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:50,158 INFO L93 Difference]: Finished difference Result 2528 states and 3708 transitions. [2019-12-07 11:02:50,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:50,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 11:02:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:50,168 INFO L225 Difference]: With dead ends: 2528 [2019-12-07 11:02:50,168 INFO L226 Difference]: Without dead ends: 1721 [2019-12-07 11:02:50,170 INFO L630 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 [2019-12-07 11:02:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-12-07 11:02:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-12-07 11:02:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 11:02:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2480 transitions. [2019-12-07 11:02:50,262 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2480 transitions. Word has length 42 [2019-12-07 11:02:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:50,262 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2480 transitions. [2019-12-07 11:02:50,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2480 transitions. [2019-12-07 11:02:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:02:50,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:50,264 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-12-07 11:02:50,264 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1515661308, now seen corresponding path program 1 times [2019-12-07 11:02:50,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:50,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932606971] [2019-12-07 11:02:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:50,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932606971] [2019-12-07 11:02:50,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:50,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:02:50,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553395420] [2019-12-07 11:02:50,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:02:50,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:50,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:02:50,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:02:50,302 INFO L87 Difference]: Start difference. First operand 1719 states and 2480 transitions. Second operand 3 states. [2019-12-07 11:02:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:50,384 INFO L93 Difference]: Finished difference Result 3129 states and 4541 transitions. [2019-12-07 11:02:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:02:50,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 11:02:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:50,393 INFO L225 Difference]: With dead ends: 3129 [2019-12-07 11:02:50,393 INFO L226 Difference]: Without dead ends: 1431 [2019-12-07 11:02:50,395 INFO L630 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 [2019-12-07 11:02:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-07 11:02:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1429. [2019-12-07 11:02:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-12-07 11:02:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2056 transitions. [2019-12-07 11:02:50,484 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2056 transitions. Word has length 61 [2019-12-07 11:02:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:50,484 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 2056 transitions. [2019-12-07 11:02:50,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:02:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2056 transitions. [2019-12-07 11:02:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:02:50,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:50,486 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 11:02:50,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1884623893, now seen corresponding path program 1 times [2019-12-07 11:02:50,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:50,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229844825] [2019-12-07 11:02:50,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:50,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229844825] [2019-12-07 11:02:50,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423834916] [2019-12-07 11:02:50,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:50,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:02:50,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:02:50,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:02:50,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-12-07 11:02:50,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491462818] [2019-12-07 11:02:50,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:50,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:50,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:50,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:50,664 INFO L87 Difference]: Start difference. First operand 1429 states and 2056 transitions. Second operand 5 states. [2019-12-07 11:02:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:50,816 INFO L93 Difference]: Finished difference Result 3275 states and 4747 transitions. [2019-12-07 11:02:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:50,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 11:02:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:50,826 INFO L225 Difference]: With dead ends: 3275 [2019-12-07 11:02:50,826 INFO L226 Difference]: Without dead ends: 1893 [2019-12-07 11:02:50,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-12-07 11:02:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1429. [2019-12-07 11:02:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-12-07 11:02:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2040 transitions. [2019-12-07 11:02:50,921 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2040 transitions. Word has length 62 [2019-12-07 11:02:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:50,921 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 2040 transitions. [2019-12-07 11:02:50,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2040 transitions. [2019-12-07 11:02:50,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:02:50,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:50,922 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 11:02:51,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:51,123 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:51,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1256397297, now seen corresponding path program 1 times [2019-12-07 11:02:51,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:51,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412673407] [2019-12-07 11:02:51,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:51,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412673407] [2019-12-07 11:02:51,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272349102] [2019-12-07 11:02:51,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:51,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:02:51,221 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:02:51,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:02:51,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-12-07 11:02:51,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117094999] [2019-12-07 11:02:51,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:51,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:51,253 INFO L87 Difference]: Start difference. First operand 1429 states and 2040 transitions. Second operand 5 states. [2019-12-07 11:02:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:51,425 INFO L93 Difference]: Finished difference Result 3277 states and 4732 transitions. [2019-12-07 11:02:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:51,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 11:02:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:51,437 INFO L225 Difference]: With dead ends: 3277 [2019-12-07 11:02:51,437 INFO L226 Difference]: Without dead ends: 2815 [2019-12-07 11:02:51,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:02:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-07 11:02:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2349. [2019-12-07 11:02:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-12-07 11:02:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3344 transitions. [2019-12-07 11:02:51,552 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3344 transitions. Word has length 62 [2019-12-07 11:02:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:51,552 INFO L462 AbstractCegarLoop]: Abstraction has 2349 states and 3344 transitions. [2019-12-07 11:02:51,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3344 transitions. [2019-12-07 11:02:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:02:51,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:51,553 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 11:02:51,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:51,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2114297975, now seen corresponding path program 1 times [2019-12-07 11:02:51,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:51,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919106904] [2019-12-07 11:02:51,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:02:51,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919106904] [2019-12-07 11:02:51,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:02:51,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:02:51,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896823948] [2019-12-07 11:02:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:02:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:02:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:51,803 INFO L87 Difference]: Start difference. First operand 2349 states and 3344 transitions. Second operand 5 states. [2019-12-07 11:02:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:51,975 INFO L93 Difference]: Finished difference Result 3737 states and 5400 transitions. [2019-12-07 11:02:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:02:51,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 11:02:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:51,988 INFO L225 Difference]: With dead ends: 3737 [2019-12-07 11:02:51,988 INFO L226 Difference]: Without dead ends: 3275 [2019-12-07 11:02:51,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:02:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2019-12-07 11:02:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2809. [2019-12-07 11:02:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2019-12-07 11:02:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 4012 transitions. [2019-12-07 11:02:52,143 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 4012 transitions. Word has length 62 [2019-12-07 11:02:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:52,144 INFO L462 AbstractCegarLoop]: Abstraction has 2809 states and 4012 transitions. [2019-12-07 11:02:52,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:02:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 4012 transitions. [2019-12-07 11:02:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:02:52,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:52,145 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 11:02:52,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2058333971, now seen corresponding path program 1 times [2019-12-07 11:02:52,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:52,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155858401] [2019-12-07 11:02:52,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:52,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155858401] [2019-12-07 11:02:52,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763123378] [2019-12-07 11:02:52,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:52,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:02:52,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:02:52,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:02:52,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2019-12-07 11:02:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110441572] [2019-12-07 11:02:52,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:02:52,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:02:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:02:52,433 INFO L87 Difference]: Start difference. First operand 2809 states and 4012 transitions. Second operand 12 states. [2019-12-07 11:02:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:02:55,605 INFO L93 Difference]: Finished difference Result 21092 states and 29443 transitions. [2019-12-07 11:02:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-07 11:02:55,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 11:02:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:02:55,649 INFO L225 Difference]: With dead ends: 21092 [2019-12-07 11:02:55,649 INFO L226 Difference]: Without dead ends: 18330 [2019-12-07 11:02:55,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=875, Invalid=3681, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 11:02:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18330 states. [2019-12-07 11:02:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18330 to 9254. [2019-12-07 11:02:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9254 states. [2019-12-07 11:02:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9254 states to 9254 states and 12732 transitions. [2019-12-07 11:02:56,261 INFO L78 Accepts]: Start accepts. Automaton has 9254 states and 12732 transitions. Word has length 63 [2019-12-07 11:02:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:02:56,261 INFO L462 AbstractCegarLoop]: Abstraction has 9254 states and 12732 transitions. [2019-12-07 11:02:56,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:02:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9254 states and 12732 transitions. [2019-12-07 11:02:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 11:02:56,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:02:56,262 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 11:02:56,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:56,464 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:02:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:02:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2041509104, now seen corresponding path program 1 times [2019-12-07 11:02:56,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:02:56,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273785892] [2019-12-07 11:02:56,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:02:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273785892] [2019-12-07 11:02:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040044519] [2019-12-07 11:02:56,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:02:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:02:56,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:02:56,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:02:56,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:02:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:02:56,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:02:56,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 11:02:56,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533079605] [2019-12-07 11:02:56,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:02:56,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:02:56,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:02:56,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:02:56,840 INFO L87 Difference]: Start difference. First operand 9254 states and 12732 transitions. Second operand 17 states. [2019-12-07 11:03:05,216 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-12-07 11:03:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:14,582 INFO L93 Difference]: Finished difference Result 96980 states and 133173 transitions. [2019-12-07 11:03:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-12-07 11:03:14,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2019-12-07 11:03:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:14,681 INFO L225 Difference]: With dead ends: 96980 [2019-12-07 11:03:14,681 INFO L226 Difference]: Without dead ends: 87766 [2019-12-07 11:03:14,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15433 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4644, Invalid=30885, Unknown=3, NotChecked=0, Total=35532 [2019-12-07 11:03:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87766 states. [2019-12-07 11:03:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87766 to 30905. [2019-12-07 11:03:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30905 states. [2019-12-07 11:03:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30905 states to 30905 states and 42008 transitions. [2019-12-07 11:03:17,570 INFO L78 Accepts]: Start accepts. Automaton has 30905 states and 42008 transitions. Word has length 64 [2019-12-07 11:03:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:17,571 INFO L462 AbstractCegarLoop]: Abstraction has 30905 states and 42008 transitions. [2019-12-07 11:03:17,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:03:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30905 states and 42008 transitions. [2019-12-07 11:03:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 11:03:17,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:17,572 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:17,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:17,773 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2097941597, now seen corresponding path program 1 times [2019-12-07 11:03:17,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:03:17,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961647920] [2019-12-07 11:03:17,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:18,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961647920] [2019-12-07 11:03:18,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374134171] [2019-12-07 11:03:18,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:18,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 11:03:18,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:03:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:03:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:18,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:03:18,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 33 [2019-12-07 11:03:18,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2499905] [2019-12-07 11:03:18,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 11:03:18,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:03:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 11:03:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:03:18,832 INFO L87 Difference]: Start difference. First operand 30905 states and 42008 transitions. Second operand 33 states. [2019-12-07 11:03:18,999 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-07 11:03:23,473 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-12-07 11:03:24,255 WARN L192 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-12-07 11:03:24,869 WARN L192 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-12-07 11:03:27,204 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2019-12-07 11:03:27,815 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-12-07 11:03:28,663 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 11:03:29,203 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-07 11:03:31,208 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 11:03:31,695 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-12-07 11:03:32,876 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-07 11:03:33,611 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-07 11:03:33,825 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-07 11:03:35,104 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-07 11:03:35,360 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-07 11:03:35,598 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-07 11:03:38,156 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-12-07 11:03:38,411 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-12-07 11:03:38,899 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-07 11:03:40,109 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 11:03:41,057 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-12-07 11:03:46,577 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-07 11:03:47,067 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-07 11:03:48,456 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-12-07 11:03:48,759 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-12-07 11:03:49,004 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-07 11:03:50,060 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-12-07 11:03:50,350 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-12-07 11:03:53,473 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-12-07 11:03:54,464 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-07 11:03:55,752 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-12-07 11:03:56,010 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-12-07 11:03:57,111 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2019-12-07 11:03:57,714 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2019-12-07 11:04:03,125 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-07 11:04:03,952 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-07 11:04:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:14,258 INFO L93 Difference]: Finished difference Result 115762 states and 158339 transitions. [2019-12-07 11:04:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-12-07 11:04:14,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2019-12-07 11:04:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:14,357 INFO L225 Difference]: With dead ends: 115762 [2019-12-07 11:04:14,357 INFO L226 Difference]: Without dead ends: 100275 [2019-12-07 11:04:14,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15625 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=7510, Invalid=34719, Unknown=1, NotChecked=0, Total=42230 [2019-12-07 11:04:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100275 states. [2019-12-07 11:04:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100275 to 31485. [2019-12-07 11:04:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31485 states. [2019-12-07 11:04:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31485 states to 31485 states and 42877 transitions. [2019-12-07 11:04:18,093 INFO L78 Accepts]: Start accepts. Automaton has 31485 states and 42877 transitions. Word has length 65 [2019-12-07 11:04:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:18,093 INFO L462 AbstractCegarLoop]: Abstraction has 31485 states and 42877 transitions. [2019-12-07 11:04:18,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 11:04:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 31485 states and 42877 transitions. [2019-12-07 11:04:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 11:04:18,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:18,095 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-12-07 11:04:18,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:18,295 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1793780567, now seen corresponding path program 1 times [2019-12-07 11:04:18,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:18,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391309805] [2019-12-07 11:04:18,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:18,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391309805] [2019-12-07 11:04:18,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:18,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:18,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937412848] [2019-12-07 11:04:18,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:18,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:18,324 INFO L87 Difference]: Start difference. First operand 31485 states and 42877 transitions. Second operand 3 states. [2019-12-07 11:04:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:20,235 INFO L93 Difference]: Finished difference Result 46139 states and 63133 transitions. [2019-12-07 11:04:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:20,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 11:04:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:20,252 INFO L225 Difference]: With dead ends: 46139 [2019-12-07 11:04:20,252 INFO L226 Difference]: Without dead ends: 18189 [2019-12-07 11:04:20,275 INFO L630 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 [2019-12-07 11:04:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18189 states. [2019-12-07 11:04:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18189 to 17953. [2019-12-07 11:04:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-07 11:04:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 23869 transitions. [2019-12-07 11:04:22,232 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 23869 transitions. Word has length 65 [2019-12-07 11:04:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:22,232 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 23869 transitions. [2019-12-07 11:04:22,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 23869 transitions. [2019-12-07 11:04:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 11:04:22,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:22,234 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:22,234 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1355053399, now seen corresponding path program 1 times [2019-12-07 11:04:22,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:22,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810571685] [2019-12-07 11:04:22,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:22,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810571685] [2019-12-07 11:04:22,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230829811] [2019-12-07 11:04:22,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:22,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 11:04:22,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:04:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:23,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:04:23,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 36 [2019-12-07 11:04:23,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933419949] [2019-12-07 11:04:23,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 11:04:23,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 11:04:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:04:23,822 INFO L87 Difference]: Start difference. First operand 17953 states and 23869 transitions. Second operand 36 states. [2019-12-07 11:04:24,218 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 11:04:25,645 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-07 11:04:25,925 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-12-07 11:04:26,218 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2019-12-07 11:04:26,628 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89 [2019-12-07 11:04:27,121 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2019-12-07 11:04:27,561 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-12-07 11:04:27,739 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 11:04:27,960 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-12-07 11:04:28,179 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-12-07 11:04:28,384 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-12-07 11:04:28,626 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-12-07 11:04:28,875 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-07 11:04:29,518 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 11:04:29,792 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-12-07 11:04:30,057 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-12-07 11:04:30,483 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 11:04:30,660 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 11:04:31,084 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-12-07 11:04:32,512 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-12-07 11:04:34,174 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-12-07 11:04:34,465 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-07 11:04:35,139 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-12-07 11:04:35,461 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-12-07 11:04:35,860 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2019-12-07 11:04:37,439 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 11:04:42,721 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-07 11:04:43,081 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-12-07 11:04:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:44,516 INFO L93 Difference]: Finished difference Result 39184 states and 52500 transitions. [2019-12-07 11:04:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 11:04:44,517 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-12-07 11:04:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:44,544 INFO L225 Difference]: With dead ends: 39184 [2019-12-07 11:04:44,544 INFO L226 Difference]: Without dead ends: 33495 [2019-12-07 11:04:44,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2422 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1842, Invalid=8869, Unknown=1, NotChecked=0, Total=10712 [2019-12-07 11:04:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33495 states. [2019-12-07 11:04:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33495 to 17987. [2019-12-07 11:04:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17987 states. [2019-12-07 11:04:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17987 states to 17987 states and 23922 transitions. [2019-12-07 11:04:46,833 INFO L78 Accepts]: Start accepts. Automaton has 17987 states and 23922 transitions. Word has length 65 [2019-12-07 11:04:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:46,833 INFO L462 AbstractCegarLoop]: Abstraction has 17987 states and 23922 transitions. [2019-12-07 11:04:46,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 11:04:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17987 states and 23922 transitions. [2019-12-07 11:04:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 11:04:46,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:46,834 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:47,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:47,036 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1613623303, now seen corresponding path program 1 times [2019-12-07 11:04:47,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:47,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267565042] [2019-12-07 11:04:47,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:04:47,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267565042] [2019-12-07 11:04:47,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:47,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:47,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867273073] [2019-12-07 11:04:47,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:47,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:47,075 INFO L87 Difference]: Start difference. First operand 17987 states and 23922 transitions. Second operand 3 states. [2019-12-07 11:04:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:48,715 INFO L93 Difference]: Finished difference Result 31085 states and 41605 transitions. [2019-12-07 11:04:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:48,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 11:04:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:48,726 INFO L225 Difference]: With dead ends: 31085 [2019-12-07 11:04:48,726 INFO L226 Difference]: Without dead ends: 13308 [2019-12-07 11:04:48,735 INFO L630 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 [2019-12-07 11:04:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13308 states. [2019-12-07 11:04:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13308 to 13308. [2019-12-07 11:04:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13308 states. [2019-12-07 11:04:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13308 states to 13308 states and 17693 transitions. [2019-12-07 11:04:50,347 INFO L78 Accepts]: Start accepts. Automaton has 13308 states and 17693 transitions. Word has length 65 [2019-12-07 11:04:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:50,348 INFO L462 AbstractCegarLoop]: Abstraction has 13308 states and 17693 transitions. [2019-12-07 11:04:50,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 13308 states and 17693 transitions. [2019-12-07 11:04:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:04:50,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:50,348 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-12-07 11:04:50,349 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:50,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2027711877, now seen corresponding path program 1 times [2019-12-07 11:04:50,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:50,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131831956] [2019-12-07 11:04:50,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:50,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131831956] [2019-12-07 11:04:50,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:50,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:50,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318202608] [2019-12-07 11:04:50,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:50,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:50,369 INFO L87 Difference]: Start difference. First operand 13308 states and 17693 transitions. Second operand 3 states. [2019-12-07 11:04:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:51,269 INFO L93 Difference]: Finished difference Result 18602 states and 24847 transitions. [2019-12-07 11:04:51,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:51,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 11:04:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:51,306 INFO L225 Difference]: With dead ends: 18602 [2019-12-07 11:04:51,306 INFO L226 Difference]: Without dead ends: 6502 [2019-12-07 11:04:51,311 INFO L630 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 [2019-12-07 11:04:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6502 states. [2019-12-07 11:04:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6502 to 6500. [2019-12-07 11:04:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6500 states. [2019-12-07 11:04:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 8428 transitions. [2019-12-07 11:04:52,074 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 8428 transitions. Word has length 66 [2019-12-07 11:04:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:52,074 INFO L462 AbstractCegarLoop]: Abstraction has 6500 states and 8428 transitions. [2019-12-07 11:04:52,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 8428 transitions. [2019-12-07 11:04:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:04:52,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:52,075 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 11:04:52,075 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 114193107, now seen corresponding path program 1 times [2019-12-07 11:04:52,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:52,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611856070] [2019-12-07 11:04:52,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 11:04:52,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611856070] [2019-12-07 11:04:52,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:52,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:52,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484196274] [2019-12-07 11:04:52,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:52,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:52,093 INFO L87 Difference]: Start difference. First operand 6500 states and 8428 transitions. Second operand 3 states. [2019-12-07 11:04:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:52,650 INFO L93 Difference]: Finished difference Result 10936 states and 14261 transitions. [2019-12-07 11:04:52,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:52,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 11:04:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:52,654 INFO L225 Difference]: With dead ends: 10936 [2019-12-07 11:04:52,654 INFO L226 Difference]: Without dead ends: 4528 [2019-12-07 11:04:52,657 INFO L630 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 [2019-12-07 11:04:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2019-12-07 11:04:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4528. [2019-12-07 11:04:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4528 states. [2019-12-07 11:04:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 5887 transitions. [2019-12-07 11:04:53,172 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 5887 transitions. Word has length 66 [2019-12-07 11:04:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:53,172 INFO L462 AbstractCegarLoop]: Abstraction has 4528 states and 5887 transitions. [2019-12-07 11:04:53,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 5887 transitions. [2019-12-07 11:04:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:04:53,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:53,173 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:53,173 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1080711952, now seen corresponding path program 1 times [2019-12-07 11:04:53,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:04:53,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976199620] [2019-12-07 11:04:53,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:53,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976199620] [2019-12-07 11:04:53,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435239897] [2019-12-07 11:04:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:04:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:53,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 11:04:53,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:04:54,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:04:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:54,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:04:54,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 35 [2019-12-07 11:04:54,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97670210] [2019-12-07 11:04:54,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 11:04:54,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:04:54,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 11:04:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:04:54,501 INFO L87 Difference]: Start difference. First operand 4528 states and 5887 transitions. Second operand 35 states. [2019-12-07 11:04:55,469 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2019-12-07 11:04:55,674 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 76 [2019-12-07 11:04:55,887 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 76 [2019-12-07 11:04:56,149 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-12-07 11:04:56,501 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-12-07 11:04:56,978 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-07 11:04:57,214 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 11:04:57,972 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-07 11:04:58,663 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-07 11:04:59,222 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-07 11:04:59,854 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-12-07 11:05:00,163 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-12-07 11:05:00,941 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-07 11:05:01,292 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 20 [2019-12-07 11:05:01,767 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-07 11:05:02,044 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-12-07 11:05:02,594 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-12-07 11:05:02,927 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-07 11:05:03,984 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-12-07 11:05:04,327 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 18 [2019-12-07 11:05:04,675 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 11:05:05,547 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 11:05:06,047 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-07 11:05:06,296 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 24 [2019-12-07 11:05:06,660 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-07 11:05:07,521 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-07 11:05:08,540 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 11:05:08,802 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 38 [2019-12-07 11:05:09,007 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 11:05:09,219 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-12-07 11:05:09,400 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2019-12-07 11:05:09,634 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 11:05:09,822 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-12-07 11:05:10,010 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-12-07 11:05:10,175 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 11:05:10,557 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-12-07 11:05:10,824 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 11:05:11,588 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-12-07 11:05:11,944 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-12-07 11:05:12,654 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 11:05:12,876 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-12-07 11:05:13,258 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-12-07 11:05:13,537 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-07 11:05:15,159 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-12-07 11:05:15,918 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-12-07 11:05:16,111 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-07 11:05:16,615 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 11:05:17,806 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 11:05:18,236 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 11:05:18,697 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-12-07 11:05:20,268 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 11:05:21,059 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 11:05:21,337 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 11:05:22,441 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-12-07 11:05:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:23,884 INFO L93 Difference]: Finished difference Result 14196 states and 18750 transitions. [2019-12-07 11:05:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-12-07 11:05:23,884 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-12-07 11:05:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:23,893 INFO L225 Difference]: With dead ends: 14196 [2019-12-07 11:05:23,893 INFO L226 Difference]: Without dead ends: 12528 [2019-12-07 11:05:23,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=3217, Invalid=21589, Unknown=0, NotChecked=0, Total=24806 [2019-12-07 11:05:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12528 states. [2019-12-07 11:05:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12528 to 6284. [2019-12-07 11:05:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6284 states. [2019-12-07 11:05:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 8207 transitions. [2019-12-07 11:05:24,732 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 8207 transitions. Word has length 67 [2019-12-07 11:05:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:24,732 INFO L462 AbstractCegarLoop]: Abstraction has 6284 states and 8207 transitions. [2019-12-07 11:05:24,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 11:05:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 8207 transitions. [2019-12-07 11:05:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:05:24,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:24,733 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:24,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:24,934 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash 142443222, now seen corresponding path program 1 times [2019-12-07 11:05:24,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:24,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343070387] [2019-12-07 11:05:24,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:05:24,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343070387] [2019-12-07 11:05:24,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:24,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:05:24,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484083457] [2019-12-07 11:05:24,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:05:24,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:05:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:05:24,960 INFO L87 Difference]: Start difference. First operand 6284 states and 8207 transitions. Second operand 3 states. [2019-12-07 11:05:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:25,401 INFO L93 Difference]: Finished difference Result 9176 states and 12049 transitions. [2019-12-07 11:05:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:05:25,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 11:05:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:25,403 INFO L225 Difference]: With dead ends: 9176 [2019-12-07 11:05:25,403 INFO L226 Difference]: Without dead ends: 3068 [2019-12-07 11:05:25,406 INFO L630 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 [2019-12-07 11:05:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-12-07 11:05:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2019-12-07 11:05:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3068 states. [2019-12-07 11:05:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 3968 transitions. [2019-12-07 11:05:25,803 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 3968 transitions. Word has length 67 [2019-12-07 11:05:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:25,803 INFO L462 AbstractCegarLoop]: Abstraction has 3068 states and 3968 transitions. [2019-12-07 11:05:25,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:05:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3968 transitions. [2019-12-07 11:05:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 11:05:25,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:25,804 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:05:25,805 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1029853143, now seen corresponding path program 1 times [2019-12-07 11:05:25,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:25,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005047641] [2019-12-07 11:05:25,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 11:05:25,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005047641] [2019-12-07 11:05:25,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:25,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:05:25,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445171862] [2019-12-07 11:05:25,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:05:25,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:25,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:05:25,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:05:25,845 INFO L87 Difference]: Start difference. First operand 3068 states and 3968 transitions. Second operand 4 states. [2019-12-07 11:05:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:26,182 INFO L93 Difference]: Finished difference Result 4990 states and 6554 transitions. [2019-12-07 11:05:26,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:05:26,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 11:05:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:26,184 INFO L225 Difference]: With dead ends: 4990 [2019-12-07 11:05:26,184 INFO L226 Difference]: Without dead ends: 2214 [2019-12-07 11:05:26,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:05:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2019-12-07 11:05:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1704. [2019-12-07 11:05:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-07 11:05:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2172 transitions. [2019-12-07 11:05:26,434 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2172 transitions. Word has length 109 [2019-12-07 11:05:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:26,434 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 2172 transitions. [2019-12-07 11:05:26,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:05:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2172 transitions. [2019-12-07 11:05:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 11:05:26,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:26,435 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:05:26,435 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 629368270, now seen corresponding path program 1 times [2019-12-07 11:05:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:26,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634647945] [2019-12-07 11:05:26,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:26,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634647945] [2019-12-07 11:05:26,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647586024] [2019-12-07 11:05:26,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:26,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 11:05:26,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:05:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 68 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 11:05:26,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:05:26,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2019-12-07 11:05:26,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214018334] [2019-12-07 11:05:26,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:05:26,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:05:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:05:26,805 INFO L87 Difference]: Start difference. First operand 1704 states and 2172 transitions. Second operand 17 states. [2019-12-07 11:05:27,525 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 11:05:27,775 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 11:05:27,941 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 11:05:28,567 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 11:05:28,883 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 11:05:29,286 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 11:05:29,655 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 11:05:29,817 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 11:05:30,100 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-07 11:05:30,342 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-12-07 11:05:30,767 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-12-07 11:05:31,316 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 11:05:31,560 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 11:05:31,829 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 11:05:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:33,258 INFO L93 Difference]: Finished difference Result 3420 states and 4408 transitions. [2019-12-07 11:05:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:05:33,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2019-12-07 11:05:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:33,260 INFO L225 Difference]: With dead ends: 3420 [2019-12-07 11:05:33,260 INFO L226 Difference]: Without dead ends: 2138 [2019-12-07 11:05:33,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:05:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-12-07 11:05:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1914. [2019-12-07 11:05:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-07 11:05:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2398 transitions. [2019-12-07 11:05:33,572 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2398 transitions. Word has length 109 [2019-12-07 11:05:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:33,572 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 2398 transitions. [2019-12-07 11:05:33,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:05:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2398 transitions. [2019-12-07 11:05:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 11:05:33,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:33,573 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:05:33,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:33,774 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash -539067345, now seen corresponding path program 1 times [2019-12-07 11:05:33,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:33,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785130534] [2019-12-07 11:05:33,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:33,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785130534] [2019-12-07 11:05:33,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762865787] [2019-12-07 11:05:33,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:34,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 11:05:34,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:05:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:34,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 40 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:34,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:05:34,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-12-07 11:05:34,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420358167] [2019-12-07 11:05:34,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:05:34,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:05:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:05:34,429 INFO L87 Difference]: Start difference. First operand 1914 states and 2398 transitions. Second operand 21 states. [2019-12-07 11:05:36,736 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 11:05:37,242 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 11:05:37,809 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 11:05:38,464 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-12-07 11:05:39,034 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 11:05:39,310 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-07 11:05:39,628 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-12-07 11:05:40,078 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 11:05:40,444 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-07 11:05:40,627 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 11:05:40,902 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-12-07 11:05:41,399 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-07 11:05:43,198 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-12-07 11:05:43,487 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 11:05:43,727 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-12-07 11:05:44,150 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-07 11:05:45,067 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-07 11:05:45,568 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-12-07 11:05:46,002 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 11:05:46,236 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-12-07 11:05:46,523 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 11:05:46,760 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 11:05:47,075 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-07 11:05:47,422 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 11:05:47,892 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 11:05:48,187 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 11:05:48,465 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 11:05:48,778 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-12-07 11:05:49,301 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-07 11:05:49,772 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-12-07 11:05:50,008 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 11:05:50,319 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-12-07 11:05:50,605 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 11:05:50,900 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-12-07 11:05:51,458 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-12-07 11:05:51,694 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-12-07 11:05:52,063 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-07 11:05:52,696 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-12-07 11:05:53,022 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-12-07 11:05:53,293 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-12-07 11:05:53,782 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-07 11:05:54,124 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-07 11:05:54,476 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-12-07 11:05:54,878 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-12-07 11:05:55,168 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-12-07 11:05:55,550 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 11:05:55,903 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-12-07 11:05:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:57,001 INFO L93 Difference]: Finished difference Result 7945 states and 10078 transitions. [2019-12-07 11:05:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 11:05:57,002 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2019-12-07 11:05:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:57,008 INFO L225 Difference]: With dead ends: 7945 [2019-12-07 11:05:57,008 INFO L226 Difference]: Without dead ends: 6325 [2019-12-07 11:05:57,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1196, Invalid=3916, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 11:05:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2019-12-07 11:05:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 3339. [2019-12-07 11:05:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-12-07 11:05:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4120 transitions. [2019-12-07 11:05:57,804 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4120 transitions. Word has length 110 [2019-12-07 11:05:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:57,805 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 4120 transitions. [2019-12-07 11:05:57,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:05:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4120 transitions. [2019-12-07 11:05:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 11:05:57,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:57,806 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:05:58,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:58,008 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -590516994, now seen corresponding path program 1 times [2019-12-07 11:05:58,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:05:58,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416788937] [2019-12-07 11:05:58,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:58,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416788937] [2019-12-07 11:05:58,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484629050] [2019-12-07 11:05:58,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:05:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:58,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 11:05:58,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:05:58,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:58,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:05:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 31 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:59,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:05:59,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2019-12-07 11:05:59,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183210545] [2019-12-07 11:05:59,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 11:05:59,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:05:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 11:05:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:05:59,644 INFO L87 Difference]: Start difference. First operand 3339 states and 4120 transitions. Second operand 36 states. [2019-12-07 11:06:03,282 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-07 11:06:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:09,353 INFO L93 Difference]: Finished difference Result 6103 states and 7509 transitions. [2019-12-07 11:06:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-07 11:06:09,353 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 111 [2019-12-07 11:06:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:09,357 INFO L225 Difference]: With dead ends: 6103 [2019-12-07 11:06:09,357 INFO L226 Difference]: Without dead ends: 5604 [2019-12-07 11:06:09,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1120, Invalid=9592, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 11:06:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2019-12-07 11:06:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 4336. [2019-12-07 11:06:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4336 states. [2019-12-07 11:06:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4336 states to 4336 states and 5338 transitions. [2019-12-07 11:06:10,434 INFO L78 Accepts]: Start accepts. Automaton has 4336 states and 5338 transitions. Word has length 111 [2019-12-07 11:06:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:10,435 INFO L462 AbstractCegarLoop]: Abstraction has 4336 states and 5338 transitions. [2019-12-07 11:06:10,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 11:06:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4336 states and 5338 transitions. [2019-12-07 11:06:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 11:06:10,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:10,436 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:06:10,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:10,638 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1181769735, now seen corresponding path program 1 times [2019-12-07 11:06:10,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:06:10,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831855129] [2019-12-07 11:06:10,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831855129] [2019-12-07 11:06:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781796382] [2019-12-07 11:06:10,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:10,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 11:06:10,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:11,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:12,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:06:12,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 42 [2019-12-07 11:06:12,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582427686] [2019-12-07 11:06:12,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 11:06:12,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:06:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 11:06:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:06:12,190 INFO L87 Difference]: Start difference. First operand 4336 states and 5338 transitions. Second operand 42 states. [2019-12-07 11:06:13,748 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 11:06:14,605 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 11:06:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:18,905 INFO L93 Difference]: Finished difference Result 8353 states and 10308 transitions. [2019-12-07 11:06:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 11:06:18,906 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 112 [2019-12-07 11:06:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:18,911 INFO L225 Difference]: With dead ends: 8353 [2019-12-07 11:06:18,911 INFO L226 Difference]: Without dead ends: 7419 [2019-12-07 11:06:18,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2422 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1156, Invalid=7400, Unknown=0, NotChecked=0, Total=8556 [2019-12-07 11:06:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2019-12-07 11:06:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 5517. [2019-12-07 11:06:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2019-12-07 11:06:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 6791 transitions. [2019-12-07 11:06:20,368 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 6791 transitions. Word has length 112 [2019-12-07 11:06:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:20,368 INFO L462 AbstractCegarLoop]: Abstraction has 5517 states and 6791 transitions. [2019-12-07 11:06:20,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 11:06:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 6791 transitions. [2019-12-07 11:06:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 11:06:20,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:20,369 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:06:20,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:20,570 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1237323942, now seen corresponding path program 1 times [2019-12-07 11:06:20,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:06:20,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809778683] [2019-12-07 11:06:20,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:20,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809778683] [2019-12-07 11:06:20,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574775316] [2019-12-07 11:06:20,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:06:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:21,007 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 11:06:21,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:06:21,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:21,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:21,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:06:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:21,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:06:21,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-12-07 11:06:21,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025825917] [2019-12-07 11:06:21,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 11:06:21,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:06:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 11:06:21,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:06:21,979 INFO L87 Difference]: Start difference. First operand 5517 states and 6791 transitions. Second operand 36 states. [2019-12-07 11:06:22,183 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-12-07 11:06:25,661 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 11:06:30,533 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 11:06:32,033 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 11:06:37,372 WARN L192 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-12-07 11:06:40,337 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-07 11:06:55,026 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 11:06:57,922 WARN L192 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 11:06:59,232 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 11:07:00,253 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 11:07:03,352 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 11:07:03,948 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 11:07:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:04,417 INFO L93 Difference]: Finished difference Result 9283 states and 11506 transitions. [2019-12-07 11:07:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-07 11:07:04,417 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2019-12-07 11:07:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:04,420 INFO L225 Difference]: With dead ends: 9283 [2019-12-07 11:07:04,421 INFO L226 Difference]: Without dead ends: 6603 [2019-12-07 11:07:04,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2747 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=1026, Invalid=9478, Unknown=2, NotChecked=0, Total=10506 [2019-12-07 11:07:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2019-12-07 11:07:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 5787. [2019-12-07 11:07:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-12-07 11:07:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7128 transitions. [2019-12-07 11:07:05,967 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7128 transitions. Word has length 112 [2019-12-07 11:07:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:05,967 INFO L462 AbstractCegarLoop]: Abstraction has 5787 states and 7128 transitions. [2019-12-07 11:07:05,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 11:07:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7128 transitions. [2019-12-07 11:07:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 11:07:05,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:05,968 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:07:06,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:06,169 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1439478472, now seen corresponding path program 1 times [2019-12-07 11:07:06,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:07:06,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316675458] [2019-12-07 11:07:06,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:06,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316675458] [2019-12-07 11:07:06,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9266112] [2019-12-07 11:07:06,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:07:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:06,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:07:06,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:07:06,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:07:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:07:06,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:07:06,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-12-07 11:07:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399073255] [2019-12-07 11:07:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:07:06,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:07:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:07:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:07:06,984 INFO L87 Difference]: Start difference. First operand 5787 states and 7128 transitions. Second operand 26 states. [2019-12-07 11:07:09,982 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-12-07 11:07:10,252 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-12-07 11:07:18,555 WARN L192 SmtUtils]: Spent 8.22 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-12-07 11:07:25,263 WARN L192 SmtUtils]: Spent 6.65 s on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 11:07:25,430 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-12-07 11:07:35,995 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 11:07:36,513 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-07 11:07:37,141 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-12-07 11:07:37,427 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-12-07 11:07:38,034 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 11:07:38,282 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-12-07 11:07:38,520 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 11:07:38,924 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-07 11:07:39,115 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 11:07:39,576 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-12-07 11:07:39,758 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-07 11:07:40,463 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 11:07:40,764 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-07 11:07:41,116 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 11:07:41,512 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-12-07 11:07:41,784 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-12-07 11:07:42,007 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 11:07:46,670 WARN L192 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-12-07 11:07:46,975 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-07 11:07:47,365 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 11:07:47,636 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-12-07 11:07:47,888 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 11:07:48,061 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2019-12-07 11:07:48,322 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-07 11:07:48,638 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 11:07:48,870 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-07 11:07:49,081 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2019-12-07 11:07:49,401 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-07 11:07:49,747 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-12-07 11:07:50,038 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-07 11:07:50,354 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 11:07:50,532 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2019-12-07 11:07:50,947 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 11:07:51,163 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2019-12-07 11:07:51,770 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 11:07:52,015 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-12-07 11:07:52,284 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-12-07 11:07:52,870 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-07 11:07:53,826 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-12-07 11:07:54,224 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-12-07 11:07:54,541 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-07 11:07:54,949 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-07 11:07:55,338 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-12-07 11:07:55,576 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 11:07:56,213 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-12-07 11:07:56,614 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-12-07 11:07:57,216 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 11:07:58,526 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 11:07:58,745 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 11:08:00,098 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-12-07 11:08:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:03,862 INFO L93 Difference]: Finished difference Result 17793 states and 22354 transitions. [2019-12-07 11:08:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-07 11:08:03,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2019-12-07 11:08:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:03,872 INFO L225 Difference]: With dead ends: 17793 [2019-12-07 11:08:03,872 INFO L226 Difference]: Without dead ends: 13114 [2019-12-07 11:08:03,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5030 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=2039, Invalid=13209, Unknown=4, NotChecked=0, Total=15252 [2019-12-07 11:08:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2019-12-07 11:08:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 4621. [2019-12-07 11:08:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4621 states. [2019-12-07 11:08:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 5654 transitions. [2019-12-07 11:08:05,498 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 5654 transitions. Word has length 112 [2019-12-07 11:08:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:05,498 INFO L462 AbstractCegarLoop]: Abstraction has 4621 states and 5654 transitions. [2019-12-07 11:08:05,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:08:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 5654 transitions. [2019-12-07 11:08:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 11:08:05,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:05,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:08:05,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:05,700 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 900167615, now seen corresponding path program 1 times [2019-12-07 11:08:05,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:05,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646072782] [2019-12-07 11:08:05,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:08:05,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646072782] [2019-12-07 11:08:05,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273853500] [2019-12-07 11:08:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:05,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:08:05,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:05,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:05,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:06,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:08:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:08:06,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-12-07 11:08:06,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466959566] [2019-12-07 11:08:06,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:08:06,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:08:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:08:06,186 INFO L87 Difference]: Start difference. First operand 4621 states and 5654 transitions. Second operand 22 states. [2019-12-07 11:08:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:08,552 INFO L93 Difference]: Finished difference Result 8213 states and 10094 transitions. [2019-12-07 11:08:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:08:08,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2019-12-07 11:08:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:08,556 INFO L225 Difference]: With dead ends: 8213 [2019-12-07 11:08:08,556 INFO L226 Difference]: Without dead ends: 5162 [2019-12-07 11:08:08,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:08:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2019-12-07 11:08:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 3867. [2019-12-07 11:08:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3867 states. [2019-12-07 11:08:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 4661 transitions. [2019-12-07 11:08:09,955 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 4661 transitions. Word has length 113 [2019-12-07 11:08:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:09,955 INFO L462 AbstractCegarLoop]: Abstraction has 3867 states and 4661 transitions. [2019-12-07 11:08:09,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:08:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 4661 transitions. [2019-12-07 11:08:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 11:08:09,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:09,956 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:08:10,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:10,158 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2042226134, now seen corresponding path program 1 times [2019-12-07 11:08:10,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:10,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51241433] [2019-12-07 11:08:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:11,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51241433] [2019-12-07 11:08:11,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587603831] [2019-12-07 11:08:11,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:11,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 11:08:11,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:13,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:13,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:14,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:08:14,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 54 [2019-12-07 11:08:14,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643394092] [2019-12-07 11:08:14,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 11:08:14,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 11:08:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2672, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 11:08:14,363 INFO L87 Difference]: Start difference. First operand 3867 states and 4661 transitions. Second operand 54 states. [2019-12-07 11:08:14,565 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-12-07 11:08:15,685 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-12-07 11:08:16,136 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-12-07 11:08:16,513 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-07 11:08:17,010 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-12-07 11:08:17,380 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2019-12-07 11:08:17,823 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-07 11:08:18,619 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-12-07 11:08:18,954 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-12-07 11:08:19,381 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-12-07 11:08:21,874 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-12-07 11:08:22,500 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2019-12-07 11:08:23,142 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 41 [2019-12-07 11:08:24,581 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-12-07 11:08:26,213 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-12-07 11:08:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:32,041 INFO L93 Difference]: Finished difference Result 6707 states and 8132 transitions. [2019-12-07 11:08:32,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 11:08:32,042 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 113 [2019-12-07 11:08:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:32,045 INFO L225 Difference]: With dead ends: 6707 [2019-12-07 11:08:32,045 INFO L226 Difference]: Without dead ends: 4545 [2019-12-07 11:08:32,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3145 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1266, Invalid=12540, Unknown=0, NotChecked=0, Total=13806 [2019-12-07 11:08:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2019-12-07 11:08:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 3986. [2019-12-07 11:08:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3986 states. [2019-12-07 11:08:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 4797 transitions. [2019-12-07 11:08:33,508 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 4797 transitions. Word has length 113 [2019-12-07 11:08:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:33,508 INFO L462 AbstractCegarLoop]: Abstraction has 3986 states and 4797 transitions. [2019-12-07 11:08:33,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 11:08:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 4797 transitions. [2019-12-07 11:08:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 11:08:33,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:33,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:08:33,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:33,711 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:33,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1804272689, now seen corresponding path program 1 times [2019-12-07 11:08:33,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:33,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826276624] [2019-12-07 11:08:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:34,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826276624] [2019-12-07 11:08:34,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706237567] [2019-12-07 11:08:34,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:08:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:34,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 11:08:34,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:08:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:08:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:35,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:08:35,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-12-07 11:08:35,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182272682] [2019-12-07 11:08:35,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 11:08:35,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 11:08:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:08:35,727 INFO L87 Difference]: Start difference. First operand 3986 states and 4797 transitions. Second operand 44 states. [2019-12-07 11:08:37,072 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 11:08:37,238 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-07 11:08:38,045 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-07 11:08:38,422 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-07 11:08:38,886 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-12-07 11:08:39,642 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-07 11:08:40,281 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-07 11:08:40,973 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-12-07 11:08:41,800 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-07 11:08:42,888 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-07 11:08:43,869 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-07 11:08:44,711 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 11:08:52,568 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 11:08:52,902 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-07 11:09:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:03,576 INFO L93 Difference]: Finished difference Result 12041 states and 14822 transitions. [2019-12-07 11:09:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-12-07 11:09:03,577 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 113 [2019-12-07 11:09:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:03,583 INFO L225 Difference]: With dead ends: 12041 [2019-12-07 11:09:03,583 INFO L226 Difference]: Without dead ends: 9578 [2019-12-07 11:09:03,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17437 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=4326, Invalid=43854, Unknown=0, NotChecked=0, Total=48180 [2019-12-07 11:09:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2019-12-07 11:09:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 4808. [2019-12-07 11:09:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2019-12-07 11:09:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 5807 transitions. [2019-12-07 11:09:05,448 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 5807 transitions. Word has length 113 [2019-12-07 11:09:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:05,448 INFO L462 AbstractCegarLoop]: Abstraction has 4808 states and 5807 transitions. [2019-12-07 11:09:05,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 11:09:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 5807 transitions. [2019-12-07 11:09:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 11:09:05,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:05,449 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:09:05,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:09:05,650 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2137192752, now seen corresponding path program 1 times [2019-12-07 11:09:05,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:09:05,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028583827] [2019-12-07 11:09:05,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:05,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028583827] [2019-12-07 11:09:05,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471768508] [2019-12-07 11:09:05,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:09:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:05,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:09:05,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:09:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:08,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:08,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:10,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:09:10,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2019-12-07 11:09:10,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040174743] [2019-12-07 11:09:10,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:09:10,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:09:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:09:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:09:10,082 INFO L87 Difference]: Start difference. First operand 4808 states and 5807 transitions. Second operand 18 states. [2019-12-07 11:09:12,178 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-12-07 11:09:16,845 WARN L192 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-12-07 11:09:19,036 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-12-07 11:09:21,996 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-07 11:09:24,810 WARN L192 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-12-07 11:09:25,156 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 11:09:30,523 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-07 11:09:30,726 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-07 11:09:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:44,104 INFO L93 Difference]: Finished difference Result 11359 states and 13926 transitions. [2019-12-07 11:09:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:09:44,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 114 [2019-12-07 11:09:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:44,109 INFO L225 Difference]: With dead ends: 11359 [2019-12-07 11:09:44,109 INFO L226 Difference]: Without dead ends: 7861 [2019-12-07 11:09:44,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=450, Invalid=1706, Unknown=6, NotChecked=0, Total=2162 [2019-12-07 11:09:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2019-12-07 11:09:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 4837. [2019-12-07 11:09:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4837 states. [2019-12-07 11:09:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 5837 transitions. [2019-12-07 11:09:46,201 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 5837 transitions. Word has length 114 [2019-12-07 11:09:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:46,202 INFO L462 AbstractCegarLoop]: Abstraction has 4837 states and 5837 transitions. [2019-12-07 11:09:46,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:09:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 5837 transitions. [2019-12-07 11:09:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 11:09:46,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:46,203 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:09:46,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:09:46,404 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash 98993860, now seen corresponding path program 1 times [2019-12-07 11:09:46,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:09:46,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812742494] [2019-12-07 11:09:46,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:47,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812742494] [2019-12-07 11:09:47,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469405551] [2019-12-07 11:09:47,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:09:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:47,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 11:09:47,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:09:47,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:48,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:09:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:49,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:09:49,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 41 [2019-12-07 11:09:49,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613748716] [2019-12-07 11:09:49,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 11:09:49,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:09:49,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 11:09:49,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1549, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:09:49,358 INFO L87 Difference]: Start difference. First operand 4837 states and 5837 transitions. Second operand 41 states. [2019-12-07 11:09:49,677 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2019-12-07 11:09:51,180 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-07 11:09:51,631 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-07 11:09:51,916 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-12-07 11:09:52,277 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-12-07 11:09:52,625 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-12-07 11:09:52,836 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-12-07 11:09:53,045 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-12-07 11:09:53,425 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-12-07 11:09:53,727 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-07 11:09:53,981 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-07 11:09:54,537 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-12-07 11:09:54,771 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-07 11:09:55,298 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 11:09:55,681 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-12-07 11:09:55,957 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-12-07 11:09:56,592 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-12-07 11:09:56,825 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-12-07 11:09:57,108 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-12-07 11:09:58,109 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-12-07 11:09:58,637 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-12-07 11:09:59,135 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-12-07 11:09:59,718 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2019-12-07 11:10:00,065 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-12-07 11:10:00,959 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-12-07 11:10:01,555 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-12-07 11:10:01,908 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-12-07 11:10:02,414 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-12-07 11:10:03,012 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-12-07 11:10:03,604 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-12-07 11:10:04,160 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-12-07 11:10:06,045 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-12-07 11:10:06,526 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-12-07 11:10:07,712 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-07 11:10:11,506 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-12-07 11:10:12,608 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-07 11:10:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:23,331 INFO L93 Difference]: Finished difference Result 14043 states and 17219 transitions. [2019-12-07 11:10:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-12-07 11:10:23,331 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2019-12-07 11:10:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:23,339 INFO L225 Difference]: With dead ends: 14043 [2019-12-07 11:10:23,339 INFO L226 Difference]: Without dead ends: 12840 [2019-12-07 11:10:23,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 90 SyntacticMatches, 10 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10719 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=2701, Invalid=30605, Unknown=0, NotChecked=0, Total=33306 [2019-12-07 11:10:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12840 states. [2019-12-07 11:10:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12840 to 5037. [2019-12-07 11:10:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5037 states. [2019-12-07 11:10:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 6073 transitions. [2019-12-07 11:10:25,750 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 6073 transitions. Word has length 114 [2019-12-07 11:10:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:25,750 INFO L462 AbstractCegarLoop]: Abstraction has 5037 states and 6073 transitions. [2019-12-07 11:10:25,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 11:10:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 6073 transitions. [2019-12-07 11:10:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 11:10:25,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:25,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:10:25,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:10:25,952 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1792090718, now seen corresponding path program 1 times [2019-12-07 11:10:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:25,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863963423] [2019-12-07 11:10:25,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 29 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:26,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863963423] [2019-12-07 11:10:26,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248481255] [2019-12-07 11:10:26,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:26,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 11:10:26,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:10:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 31 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:28,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:10:28,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2019-12-07 11:10:28,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30038064] [2019-12-07 11:10:28,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 11:10:28,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:28,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 11:10:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1686, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 11:10:28,452 INFO L87 Difference]: Start difference. First operand 5037 states and 6073 transitions. Second operand 43 states. [2019-12-07 11:10:28,598 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 11:10:30,316 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 11:10:30,934 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-07 11:10:31,131 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2019-12-07 11:10:31,808 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-07 11:10:32,324 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 11:10:32,774 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-07 11:10:35,553 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-07 11:10:35,813 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-12-07 11:10:36,538 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 39 [2019-12-07 11:10:37,552 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-12-07 11:10:38,088 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-07 11:10:38,345 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-12-07 11:10:38,655 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-12-07 11:10:39,589 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-07 11:10:39,971 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-07 11:10:40,686 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-07 11:10:41,057 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-12-07 11:10:41,842 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-12-07 11:10:42,180 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 11:10:42,937 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2019-12-07 11:10:43,503 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-12-07 11:10:45,041 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-12-07 11:10:45,271 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-07 11:10:46,585 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-12-07 11:10:48,438 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-12-07 11:10:48,963 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2019-12-07 11:10:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:53,397 INFO L93 Difference]: Finished difference Result 8840 states and 10714 transitions. [2019-12-07 11:10:53,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-12-07 11:10:53,398 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 115 [2019-12-07 11:10:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:53,402 INFO L225 Difference]: With dead ends: 8840 [2019-12-07 11:10:53,402 INFO L226 Difference]: Without dead ends: 7819 [2019-12-07 11:10:53,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11274 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4094, Invalid=29578, Unknown=0, NotChecked=0, Total=33672 [2019-12-07 11:10:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-12-07 11:10:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 5203. [2019-12-07 11:10:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5203 states. [2019-12-07 11:10:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 6229 transitions. [2019-12-07 11:10:55,904 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 6229 transitions. Word has length 115 [2019-12-07 11:10:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:55,904 INFO L462 AbstractCegarLoop]: Abstraction has 5203 states and 6229 transitions. [2019-12-07 11:10:55,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 11:10:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 6229 transitions. [2019-12-07 11:10:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 11:10:55,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:55,905 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:10:56,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:10:56,107 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 654781138, now seen corresponding path program 1 times [2019-12-07 11:10:56,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:56,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467939410] [2019-12-07 11:10:56,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 29 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:56,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467939410] [2019-12-07 11:10:56,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557737528] [2019-12-07 11:10:56,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:10:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:56,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 11:10:56,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:10:57,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:57,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:58,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:59,020 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-12-07 11:10:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:59,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:10:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:59,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:10:59,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31] total 51 [2019-12-07 11:10:59,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917403252] [2019-12-07 11:10:59,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-07 11:10:59,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-07 11:10:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2347, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 11:10:59,428 INFO L87 Difference]: Start difference. First operand 5203 states and 6229 transitions. Second operand 51 states. [2019-12-07 11:11:00,221 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-12-07 11:11:00,543 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-12-07 11:11:00,936 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-12-07 11:11:01,290 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-12-07 11:11:01,621 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 11:11:02,380 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-12-07 11:11:02,617 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-12-07 11:11:02,875 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-07 11:11:03,875 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-12-07 11:11:05,414 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 11:11:05,690 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-12-07 11:11:06,215 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-12-07 11:11:07,300 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-12-07 11:11:07,684 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-12-07 11:11:07,997 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-07 11:11:08,380 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-12-07 11:11:08,767 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-12-07 11:11:09,199 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-12-07 11:11:09,495 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-12-07 11:11:10,219 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-07 11:11:10,475 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 11:11:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:15,002 INFO L93 Difference]: Finished difference Result 9206 states and 11204 transitions. [2019-12-07 11:11:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-07 11:11:15,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 117 [2019-12-07 11:11:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:15,007 INFO L225 Difference]: With dead ends: 9206 [2019-12-07 11:11:15,007 INFO L226 Difference]: Without dead ends: 6410 [2019-12-07 11:11:15,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5428 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1776, Invalid=15780, Unknown=0, NotChecked=0, Total=17556 [2019-12-07 11:11:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6410 states. [2019-12-07 11:11:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6410 to 4768. [2019-12-07 11:11:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4768 states. [2019-12-07 11:11:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 5741 transitions. [2019-12-07 11:11:17,291 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 5741 transitions. Word has length 117 [2019-12-07 11:11:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:17,291 INFO L462 AbstractCegarLoop]: Abstraction has 4768 states and 5741 transitions. [2019-12-07 11:11:17,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-07 11:11:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 5741 transitions. [2019-12-07 11:11:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 11:11:17,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:17,293 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:11:17,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:17,494 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -152086137, now seen corresponding path program 1 times [2019-12-07 11:11:17,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:11:17,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53562126] [2019-12-07 11:11:17,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 55 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53562126] [2019-12-07 11:11:17,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141646190] [2019-12-07 11:11:17,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:17,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 11:11:17,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:11:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 55 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:18,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:11:18,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-12-07 11:11:18,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760811951] [2019-12-07 11:11:18,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 11:11:18,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:11:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 11:11:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:11:18,647 INFO L87 Difference]: Start difference. First operand 4768 states and 5741 transitions. Second operand 38 states. [2019-12-07 11:11:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:25,004 INFO L93 Difference]: Finished difference Result 9888 states and 12095 transitions. [2019-12-07 11:11:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 11:11:25,005 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 158 [2019-12-07 11:11:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:25,008 INFO L225 Difference]: With dead ends: 9888 [2019-12-07 11:11:25,008 INFO L226 Difference]: Without dead ends: 7108 [2019-12-07 11:11:25,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=911, Invalid=6745, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 11:11:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7108 states. [2019-12-07 11:11:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7108 to 5484. [2019-12-07 11:11:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2019-12-07 11:11:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6645 transitions. [2019-12-07 11:11:27,685 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6645 transitions. Word has length 158 [2019-12-07 11:11:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:27,686 INFO L462 AbstractCegarLoop]: Abstraction has 5484 states and 6645 transitions. [2019-12-07 11:11:27,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 11:11:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6645 transitions. [2019-12-07 11:11:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 11:11:27,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:27,687 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:11:27,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:27,889 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1403398423, now seen corresponding path program 2 times [2019-12-07 11:11:27,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:11:27,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914532983] [2019-12-07 11:11:27,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 80 proven. 161 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 11:11:28,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914532983] [2019-12-07 11:11:28,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384788778] [2019-12-07 11:11:28,158 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:28,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:11:28,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:11:28,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 11:11:28,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:11:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 77 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:28,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:11:28,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40 [2019-12-07 11:11:28,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101857157] [2019-12-07 11:11:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 11:11:28,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:11:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 11:11:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:11:28,953 INFO L87 Difference]: Start difference. First operand 5484 states and 6645 transitions. Second operand 40 states. [2019-12-07 11:11:31,420 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-12-07 11:11:31,636 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2019-12-07 11:11:31,948 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 11:11:32,194 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-12-07 11:11:33,815 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-12-07 11:11:34,473 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2019-12-07 11:11:35,063 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-12-07 11:11:38,291 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-12-07 11:11:38,941 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-07 11:11:39,430 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-12-07 11:11:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:48,261 INFO L93 Difference]: Finished difference Result 14751 states and 17959 transitions. [2019-12-07 11:11:48,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-12-07 11:11:48,262 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2019-12-07 11:11:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:48,268 INFO L225 Difference]: With dead ends: 14751 [2019-12-07 11:11:48,268 INFO L226 Difference]: Without dead ends: 11639 [2019-12-07 11:11:48,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12277 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3389, Invalid=31767, Unknown=0, NotChecked=0, Total=35156 [2019-12-07 11:11:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2019-12-07 11:11:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 7122. [2019-12-07 11:11:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7122 states. [2019-12-07 11:11:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 8628 transitions. [2019-12-07 11:11:51,890 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 8628 transitions. Word has length 159 [2019-12-07 11:11:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:51,890 INFO L462 AbstractCegarLoop]: Abstraction has 7122 states and 8628 transitions. [2019-12-07 11:11:51,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 11:11:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 8628 transitions. [2019-12-07 11:11:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 11:11:51,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:51,892 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:11:52,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:52,093 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1898919739, now seen corresponding path program 1 times [2019-12-07 11:11:52,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:11:52,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378759415] [2019-12-07 11:11:52,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 143 proven. 76 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:11:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378759415] [2019-12-07 11:11:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146143156] [2019-12-07 11:11:52,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:11:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:52,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 11:11:52,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:11:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:11:53,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:11:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 41 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:53,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:11:53,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2019-12-07 11:11:53,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934446488] [2019-12-07 11:11:53,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 11:11:53,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:11:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 11:11:53,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1452, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:11:53,446 INFO L87 Difference]: Start difference. First operand 7122 states and 8628 transitions. Second operand 40 states. [2019-12-07 11:11:55,516 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-07 11:12:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:08,554 INFO L93 Difference]: Finished difference Result 13628 states and 16710 transitions. [2019-12-07 11:12:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-07 11:12:08,554 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2019-12-07 11:12:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:08,559 INFO L225 Difference]: With dead ends: 13628 [2019-12-07 11:12:08,559 INFO L226 Difference]: Without dead ends: 9480 [2019-12-07 11:12:08,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4404 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1595, Invalid=15175, Unknown=0, NotChecked=0, Total=16770 [2019-12-07 11:12:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9480 states. [2019-12-07 11:12:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9480 to 7424. [2019-12-07 11:12:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7424 states. [2019-12-07 11:12:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7424 states to 7424 states and 9035 transitions. [2019-12-07 11:12:12,503 INFO L78 Accepts]: Start accepts. Automaton has 7424 states and 9035 transitions. Word has length 159 [2019-12-07 11:12:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:12,503 INFO L462 AbstractCegarLoop]: Abstraction has 7424 states and 9035 transitions. [2019-12-07 11:12:12,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 11:12:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 7424 states and 9035 transitions. [2019-12-07 11:12:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 11:12:12,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:12,505 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:12:12,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:12:12,706 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1016105134, now seen corresponding path program 1 times [2019-12-07 11:12:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:12:12,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132952668] [2019-12-07 11:12:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 56 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:13,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132952668] [2019-12-07 11:12:13,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655272217] [2019-12-07 11:12:13,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:12:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:13,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 11:12:13,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:12:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:12:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 73 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:14,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:12:14,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2019-12-07 11:12:14,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152288799] [2019-12-07 11:12:14,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 11:12:14,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:12:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 11:12:14,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:12:14,350 INFO L87 Difference]: Start difference. First operand 7424 states and 9035 transitions. Second operand 41 states. [2019-12-07 11:12:14,627 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-12-07 11:12:18,590 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-12-07 11:12:18,922 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-12-07 11:12:19,635 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-12-07 11:12:19,940 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-07 11:12:20,513 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-12-07 11:12:20,846 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-07 11:12:21,397 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-12-07 11:12:26,680 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2019-12-07 11:12:29,145 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-07 11:12:31,958 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 11:12:36,179 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 11:12:36,838 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-12-07 11:12:58,283 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-12-07 11:12:58,604 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-12-07 11:13:00,400 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 11:13:01,038 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-07 11:13:01,248 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 11:13:02,179 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-07 11:13:02,747 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-12-07 11:13:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:13:10,432 INFO L93 Difference]: Finished difference Result 34166 states and 42387 transitions. [2019-12-07 11:13:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2019-12-07 11:13:10,432 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 159 [2019-12-07 11:13:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:13:10,452 INFO L225 Difference]: With dead ends: 34166 [2019-12-07 11:13:10,452 INFO L226 Difference]: Without dead ends: 28305 [2019-12-07 11:13:10,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35515 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=6231, Invalid=88941, Unknown=0, NotChecked=0, Total=95172 [2019-12-07 11:13:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28305 states. [2019-12-07 11:13:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28305 to 13168. [2019-12-07 11:13:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13168 states. [2019-12-07 11:13:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13168 states to 13168 states and 16194 transitions. [2019-12-07 11:13:17,731 INFO L78 Accepts]: Start accepts. Automaton has 13168 states and 16194 transitions. Word has length 159 [2019-12-07 11:13:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:13:17,731 INFO L462 AbstractCegarLoop]: Abstraction has 13168 states and 16194 transitions. [2019-12-07 11:13:17,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 11:13:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 13168 states and 16194 transitions. [2019-12-07 11:13:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 11:13:17,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:13:17,733 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:13:17,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:13:17,934 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:13:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:13:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1738030647, now seen corresponding path program 1 times [2019-12-07 11:13:17,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:13:17,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938975709] [2019-12-07 11:13:17,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:13:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:13:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 22 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:13:18,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938975709] [2019-12-07 11:13:18,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133053990] [2019-12-07 11:13:18,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:13:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:13:18,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 11:13:18,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:13:18,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:13:18,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:13:18,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:13:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:13:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 146 proven. 68 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 11:13:19,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:13:19,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2019-12-07 11:13:19,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210252182] [2019-12-07 11:13:19,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 11:13:19,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:13:19,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 11:13:19,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 11:13:19,382 INFO L87 Difference]: Start difference. First operand 13168 states and 16194 transitions. Second operand 39 states. [2019-12-07 11:13:19,553 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-12-07 11:13:23,205 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-07 11:13:24,080 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-12-07 11:13:24,432 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-12-07 11:13:26,784 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-12-07 11:13:27,529 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-12-07 11:13:29,523 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-12-07 11:13:31,761 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-07 11:13:33,820 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-12-07 11:13:34,551 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-07 11:13:34,758 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-12-07 11:13:35,006 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-07 11:13:36,045 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-07 11:13:36,280 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-12-07 11:13:36,823 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-07 11:13:37,190 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-12-07 11:13:38,007 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2019-12-07 11:13:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:13:54,398 INFO L93 Difference]: Finished difference Result 34631 states and 42790 transitions. [2019-12-07 11:13:54,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-12-07 11:13:54,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 159 [2019-12-07 11:13:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:13:54,413 INFO L225 Difference]: With dead ends: 34631 [2019-12-07 11:13:54,413 INFO L226 Difference]: Without dead ends: 23487 [2019-12-07 11:13:54,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13167 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=3703, Invalid=34127, Unknown=0, NotChecked=0, Total=37830 [2019-12-07 11:13:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23487 states. [2019-12-07 11:14:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23487 to 17091. [2019-12-07 11:14:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17091 states. [2019-12-07 11:14:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17091 states to 17091 states and 20980 transitions. [2019-12-07 11:14:04,017 INFO L78 Accepts]: Start accepts. Automaton has 17091 states and 20980 transitions. Word has length 159 [2019-12-07 11:14:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:04,017 INFO L462 AbstractCegarLoop]: Abstraction has 17091 states and 20980 transitions. [2019-12-07 11:14:04,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 11:14:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 17091 states and 20980 transitions. [2019-12-07 11:14:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 11:14:04,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:04,019 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:04,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:14:04,220 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash 578060408, now seen corresponding path program 2 times [2019-12-07 11:14:04,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:04,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800558563] [2019-12-07 11:14:04,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 11:14:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800558563] [2019-12-07 11:14:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319867646] [2019-12-07 11:14:04,342 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:14:04,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:14:04,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:14:04,411 INFO L264 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:14:04,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:14:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 28 proven. 210 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 11:14:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:14:04,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-12-07 11:14:04,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512891027] [2019-12-07 11:14:04,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:14:04,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:14:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:14:04,523 INFO L87 Difference]: Start difference. First operand 17091 states and 20980 transitions. Second operand 9 states. [2019-12-07 11:14:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:31,375 INFO L93 Difference]: Finished difference Result 62676 states and 76684 transitions. [2019-12-07 11:14:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:14:31,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-12-07 11:14:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:31,413 INFO L225 Difference]: With dead ends: 62676 [2019-12-07 11:14:31,413 INFO L226 Difference]: Without dead ends: 46376 [2019-12-07 11:14:31,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:14:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46376 states. [2019-12-07 11:14:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46376 to 44533. [2019-12-07 11:14:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44533 states. [2019-12-07 11:14:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44533 states to 44533 states and 51572 transitions. [2019-12-07 11:14:57,519 INFO L78 Accepts]: Start accepts. Automaton has 44533 states and 51572 transitions. Word has length 160 [2019-12-07 11:14:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:57,519 INFO L462 AbstractCegarLoop]: Abstraction has 44533 states and 51572 transitions. [2019-12-07 11:14:57,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:14:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44533 states and 51572 transitions. [2019-12-07 11:14:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 11:14:57,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:57,521 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:14:57,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:14:57,723 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash -36979272, now seen corresponding path program 1 times [2019-12-07 11:14:57,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:57,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012306618] [2019-12-07 11:14:57,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 48 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:58,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012306618] [2019-12-07 11:14:58,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163026574] [2019-12-07 11:14:58,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:14:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:58,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 11:14:58,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:14:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 52 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:59,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:14:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-12-07 11:14:59,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385275244] [2019-12-07 11:14:59,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 11:14:59,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 11:14:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 11:14:59,088 INFO L87 Difference]: Start difference. First operand 44533 states and 51572 transitions. Second operand 43 states. [2019-12-07 11:15:00,980 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-12-07 11:15:01,232 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 11:15:01,559 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 11:15:02,383 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-12-07 11:15:02,827 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-07 11:15:06,091 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-12-07 11:15:07,174 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 33 [2019-12-07 11:15:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:35,158 INFO L93 Difference]: Finished difference Result 76202 states and 88372 transitions. [2019-12-07 11:15:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-07 11:15:35,159 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2019-12-07 11:15:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:35,191 INFO L225 Difference]: With dead ends: 76202 [2019-12-07 11:15:35,191 INFO L226 Difference]: Without dead ends: 44797 [2019-12-07 11:15:35,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1740, Invalid=9390, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 11:15:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44797 states. [2019-12-07 11:15:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44797 to 38653. [2019-12-07 11:15:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38653 states. [2019-12-07 11:15:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38653 states to 38653 states and 44714 transitions. [2019-12-07 11:15:57,533 INFO L78 Accepts]: Start accepts. Automaton has 38653 states and 44714 transitions. Word has length 160 [2019-12-07 11:15:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:57,534 INFO L462 AbstractCegarLoop]: Abstraction has 38653 states and 44714 transitions. [2019-12-07 11:15:57,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 11:15:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38653 states and 44714 transitions. [2019-12-07 11:15:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 11:15:57,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:57,535 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:15:57,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:57,736 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -100240382, now seen corresponding path program 1 times [2019-12-07 11:15:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012839565] [2019-12-07 11:15:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:15:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:15:57,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:15:57,819 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:15:57,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:15:57 BoogieIcfgContainer [2019-12-07 11:15:57,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:15:57,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:15:57,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:15:57,922 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:15:57,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:48" (3/4) ... [2019-12-07 11:15:57,923 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:15:58,027 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d2cf9be5-8aea-4313-aa38-8e7f6cd98eeb/bin/uautomizer/witness.graphml [2019-12-07 11:15:58,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:15:58,028 INFO L168 Benchmark]: Toolchain (without parser) took 790590.37 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 944.8 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,028 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:58,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,029 INFO L168 Benchmark]: Boogie Preprocessor took 17.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:58,029 INFO L168 Benchmark]: RCFGBuilder took 299.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,029 INFO L168 Benchmark]: TraceAbstraction took 789894.03 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,029 INFO L168 Benchmark]: Witness Printer took 105.96 ms. Allocated memory is still 4.8 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 100.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:58,030 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 789894.03 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 105.96 ms. Allocated memory is still 4.8 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 100.2 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 187]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1] int __return_main; [L12] msg_t nomsg = (msg_t )-1; [L13] unsigned char r1 = '\x0'; [L14] port_t p1 = 0; [L15] char p1_old = '\x0'; [L16] char p1_new = '\x0'; [L17] char id1 = '\x0'; [L18] char st1 = '\x0'; [L19] msg_t send1 = '\x0'; [L20] _Bool mode1 = 0; [L21] port_t p2 = 0; [L22] char p2_old = '\x0'; [L23] char p2_new = '\x0'; [L24] char id2 = '\x0'; [L25] char st2 = '\x0'; [L26] msg_t send2 = '\x0'; [L27] _Bool mode2 = 0; [L28] port_t p3 = 0; [L29] char p3_old = '\x0'; [L30] char p3_new = '\x0'; [L31] char id3 = '\x0'; [L32] char st3 = '\x0'; [L33] msg_t send3 = '\x0'; [L34] _Bool mode3 = 0; [L38] void (*nodes[3])() = { &node1, &node2, &node3 }; [L42] int __return_1394; [L43] int __return_1470; VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L46] int main__c1; [L47] int main__i2; [L48] main__c1 = 0 [L49] r1 = __VERIFIER_nondet_uchar() [L50] id1 = __VERIFIER_nondet_char() [L51] st1 = __VERIFIER_nondet_char() [L52] send1 = __VERIFIER_nondet_char() [L53] mode1 = __VERIFIER_nondet_bool() [L54] id2 = __VERIFIER_nondet_char() [L55] st2 = __VERIFIER_nondet_char() [L56] send2 = __VERIFIER_nondet_char() [L57] mode2 = __VERIFIER_nondet_bool() [L58] id3 = __VERIFIER_nondet_char() [L59] st3 = __VERIFIER_nondet_char() [L60] send3 = __VERIFIER_nondet_char() [L61] mode3 = __VERIFIER_nondet_bool() [L63] int init__tmp; VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L64] COND TRUE ((int)r1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L66] COND TRUE ((int)id1) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L68] COND TRUE ((int)st1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L70] COND TRUE ((int)send1) == ((int)id1) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L72] COND TRUE ((int)mode1) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L74] COND TRUE ((int)id2) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L76] COND TRUE ((int)st2) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L78] COND TRUE ((int)send2) == ((int)id2) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L80] COND TRUE ((int)mode2) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L82] COND TRUE ((int)id3) >= 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L84] COND TRUE ((int)st3) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L86] COND TRUE ((int)send3) == ((int)id3) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L88] COND TRUE ((int)mode3) == 0 VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L90] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L92] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1394=0, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L94] COND TRUE ((int)id2) != ((int)id3) [L96] init__tmp = 1 [L97] __return_1394 = init__tmp [L98] main__i2 = __return_1394 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L99] COND TRUE main__i2 != 0 [L101] p1_old = nomsg [L102] p1_new = nomsg [L103] p2_old = nomsg [L104] p2_new = nomsg [L105] p3_old = nomsg [L106] p3_new = nomsg [L107] main__i2 = 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L112] COND FALSE !(!(mode1 == 0)) [L346] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L347] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L349] COND TRUE p1_new == nomsg [L351] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L353] p1_new = node1____CPAchecker_TMP_0 [L354] mode1 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(mode2 == 0)) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L296] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L298] COND TRUE p2_new == nomsg [L300] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L302] p2_new = node2____CPAchecker_TMP_0 [L303] mode2 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L147] COND FALSE !(!(mode3 == 0)) [L250] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L251] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L253] COND TRUE p3_new == nomsg [L255] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L257] p3_new = node3____CPAchecker_TMP_0 [L258] mode3 = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=2, p1_old=-1, p2=0, p2_new=0, p2_old=-1, p3=0, p3_new=1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L167] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L169] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L212] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) < 3 [L174] check__tmp = 1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L185] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L112] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L114] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L118] r1 = r1 + 1 [L119] node1__m1 = p3_old [L120] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L121] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L123] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L322] COND FALSE !(((int)node1__m1) == ((int)id1)) [L329] send1 = node1__m1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=0, send3=1, st1=0, st2=0, st3=0] [L127] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=0, send3=1, st1=0, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=0, send3=1, st1=0, st2=0, st3=0] [L132] COND TRUE !(mode2 == 0) [L134] node2__m2 = p1_old [L135] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=0, send3=1, st1=0, st2=0, st3=0] [L136] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=0, send3=1, st1=0, st2=0, st3=0] [L138] COND TRUE ((int)node2__m2) > ((int)id2) [L140] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L142] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L147] COND TRUE !(mode3 == 0) [L149] node3__m3 = p2_old [L150] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L151] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L153] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L232] COND FALSE !(((int)node3__m3) == ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L157] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L167] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L169] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L212] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) < 3 [L174] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L185] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L112] COND FALSE !(!(mode1 == 0)) [L346] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L347] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L349] COND TRUE p1_new == nomsg [L351] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L353] p1_new = node1____CPAchecker_TMP_0 [L354] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(mode2 == 0)) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L296] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L298] COND TRUE p2_new == nomsg [L300] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L302] p2_new = node2____CPAchecker_TMP_0 [L303] mode2 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L147] COND FALSE !(!(mode3 == 0)) [L250] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L251] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L253] COND TRUE p3_new == nomsg [L255] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L257] p3_new = node3____CPAchecker_TMP_0 [L258] mode3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=2, p2_old=-1, p3=0, p3_new=1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L167] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L169] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L212] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) < 3 [L174] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L185] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L112] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L114] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L118] r1 = r1 + 1 [L119] node1__m1 = p3_old [L120] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L121] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L123] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L322] COND FALSE !(((int)node1__m1) == ((int)id1)) [L329] send1 = node1__m1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L127] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L132] COND TRUE !(mode2 == 0) [L134] node2__m2 = p1_old [L135] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L136] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L138] COND TRUE ((int)node2__m2) > ((int)id2) [L140] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=1, st1=0, st2=0, st3=0] [L142] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=1, st1=0, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=1, st1=0, st2=0, st3=0] [L147] COND TRUE !(mode3 == 0) [L149] node3__m3 = p2_old [L150] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=1, st1=0, st2=0, st3=0] [L151] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=1, st1=0, st2=0, st3=0] [L153] COND TRUE ((int)node3__m3) > ((int)id3) [L155] send3 = node3__m3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L157] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L167] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L169] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L212] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) < 3 [L174] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L185] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L112] COND FALSE !(!(mode1 == 0)) [L346] int node1____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L347] COND TRUE send1 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L349] COND TRUE p1_new == nomsg [L351] node1____CPAchecker_TMP_0 = send1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L353] p1_new = node1____CPAchecker_TMP_0 [L354] mode1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L132] COND FALSE !(!(mode2 == 0)) [L295] int node2____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L296] COND TRUE send2 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L298] COND TRUE p2_new == nomsg [L300] node2____CPAchecker_TMP_0 = send2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L302] p2_new = node2____CPAchecker_TMP_0 [L303] mode2 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L147] COND FALSE !(!(mode3 == 0)) [L250] int node3____CPAchecker_TMP_0; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L251] COND TRUE send3 != nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L253] COND TRUE p3_new == nomsg [L255] node3____CPAchecker_TMP_0 = send3 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L257] p3_new = node3____CPAchecker_TMP_0 [L258] mode3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=1, p1_old=-1, p2=0, p2_new=1, p2_old=-1, p3=0, p3_new=2, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L167] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L169] COND FALSE !(((int)r1) >= 3) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L212] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L172] COND TRUE ((int)r1) < 3 [L174] check__tmp = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L185] COND FALSE !(assert__arg == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L110] msg_t node1__m1; [L111] node1__m1 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L112] COND TRUE !(mode1 == 0) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L114] COND FALSE !(r1 == 255) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L118] r1 = r1 + 1 [L119] node1__m1 = p3_old [L120] p3_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L121] COND TRUE ((int)node1__m1) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L123] COND FALSE !(((int)node1__m1) > ((int)id1)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L322] COND TRUE ((int)node1__m1) == ((int)id1) [L324] st1 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L127] mode1 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L130] msg_t node2__m2; [L131] node2__m2 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L132] COND TRUE !(mode2 == 0) [L134] node2__m2 = p1_old [L135] p1_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L136] COND TRUE ((int)node2__m2) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L138] COND TRUE ((int)node2__m2) > ((int)id2) [L140] send2 = node2__m2 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L142] mode2 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L145] msg_t node3__m3; [L146] node3__m3 = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L147] COND TRUE !(mode3 == 0) [L149] node3__m3 = p2_old [L150] p2_old = nomsg VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L151] COND TRUE ((int)node3__m3) != ((int)nomsg) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L153] COND FALSE !(((int)node3__m3) > ((int)id3)) VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=0] [L232] COND TRUE ((int)node3__m3) == ((int)id3) [L234] st3 = 1 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L157] mode3 = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L159] p1_old = p1_new [L160] p1_new = nomsg [L161] p2_old = p2_new [L162] p2_new = nomsg [L163] p3_old = p3_new [L164] p3_new = nomsg [L166] int check__tmp; VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L167] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) <= 1) [L225] check__tmp = 0 VAL [__return_1394=1, __return_1470=1, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L178] __return_1470 = check__tmp [L179] main__c1 = __return_1470 [L181] _Bool __tmp_1; [L182] __tmp_1 = main__c1 [L183] _Bool assert__arg; [L184] assert__arg = __tmp_1 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L185] COND TRUE assert__arg == 0 VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L187] __VERIFIER_error() VAL [__return_1394=1, __return_1470=0, __return_main=0, id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 1 error locations. Result: UNSAFE, OverallTime: 789.7s, OverallIterations: 46, TraceHistogramMax: 6, AutomataDifference: 630.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8091 SDtfs, 58857 SDslu, 143111 SDs, 0 SdLazy, 70711 SolverSat, 4083 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 103.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5948 GetRequests, 2678 SyntacticMatches, 45 SemanticMatches, 3225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176928 ImplicationChecksByTransitivity, 378.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44533occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 112.9s AutomataMinimizationTime, 45 MinimizatonAttempts, 235187 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 7172 NumberOfCodeBlocks, 7172 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 6940 ConstructedInterpolants, 875 QuantifiedInterpolants, 13000107 SizeOfPredicates, 243 NumberOfNonLiveVariables, 11422 ConjunctsInSsa, 803 ConjunctsInUnsatCore, 72 InterpolantComputations, 20 PerfectInterpolantSequences, 2036/6162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...