./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96f16385 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67f75038da5597fb60fd0aa63a920af562c2c67b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-96f1638 [2020-12-02 12:12:17,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 12:12:17,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 12:12:17,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 12:12:17,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 12:12:17,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 12:12:17,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 12:12:17,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 12:12:17,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 12:12:17,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 12:12:17,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 12:12:17,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 12:12:17,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 12:12:17,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 12:12:17,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 12:12:17,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 12:12:17,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 12:12:17,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 12:12:17,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 12:12:17,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 12:12:17,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 12:12:17,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 12:12:17,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 12:12:17,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 12:12:17,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 12:12:17,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 12:12:17,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 12:12:17,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 12:12:17,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 12:12:17,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 12:12:17,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 12:12:17,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 12:12:17,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 12:12:17,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 12:12:17,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 12:12:17,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 12:12:17,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 12:12:17,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 12:12:17,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 12:12:17,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 12:12:17,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 12:12:17,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 12:12:17,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 12:12:17,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 12:12:17,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 12:12:17,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 12:12:17,562 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 12:12:17,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 12:12:17,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 12:12:17,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 12:12:17,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 12:12:17,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 12:12:17,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 12:12:17,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 12:12:17,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 12:12:17,566 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 12:12:17,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 12:12:17,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 12:12:17,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 12:12:17,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 12:12:17,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 12:12:17,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 12:12:17,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 12:12:17,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 12:12:17,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 12:12:17,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 12:12:17,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 12:12:17,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 12:12:17,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 12:12:17,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 12:12:17,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 12:12:17,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 67f75038da5597fb60fd0aa63a920af562c2c67b [2020-12-02 12:12:17,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 12:12:18,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 12:12:18,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 12:12:18,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 12:12:18,047 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 12:12:18,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-12-02 12:12:18,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268ece6c5/f5c3458e779744a8a6b3d551d40efdd8/FLAG37ffa6f45 [2020-12-02 12:12:18,888 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 12:12:18,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i [2020-12-02 12:12:18,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268ece6c5/f5c3458e779744a8a6b3d551d40efdd8/FLAG37ffa6f45 [2020-12-02 12:12:19,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268ece6c5/f5c3458e779744a8a6b3d551d40efdd8 [2020-12-02 12:12:19,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 12:12:19,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 12:12:19,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 12:12:19,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 12:12:19,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 12:12:19,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:12:19" (1/1) ... [2020-12-02 12:12:19,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432dcfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:19, skipping insertion in model container [2020-12-02 12:12:19,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:12:19" (1/1) ... [2020-12-02 12:12:19,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 12:12:19,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 12:12:19,475 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i[949,962] [2020-12-02 12:12:19,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:12:19,842 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 12:12:19,859 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_pso.opt.i[949,962] [2020-12-02 12:12:19,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 12:12:20,015 INFO L208 MainTranslator]: Completed translation [2020-12-02 12:12:20,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20 WrapperNode [2020-12-02 12:12:20,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 12:12:20,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 12:12:20,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 12:12:20,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 12:12:20,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 12:12:20,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 12:12:20,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 12:12:20,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 12:12:20,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... [2020-12-02 12:12:20,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 12:12:20,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 12:12:20,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 12:12:20,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 12:12:20,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-12-02 12:12:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 12:12:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 12:12:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 12:12:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 12:12:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-02 12:12:20,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-02 12:12:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-02 12:12:20,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-02 12:12:20,282 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-02 12:12:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-02 12:12:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 12:12:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 12:12:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 12:12:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 12:12:20,287 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 12:12:22,322 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 12:12:22,323 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-02 12:12:22,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:12:22 BoogieIcfgContainer [2020-12-02 12:12:22,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 12:12:22,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 12:12:22,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 12:12:22,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 12:12:22,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:12:19" (1/3) ... [2020-12-02 12:12:22,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed17d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:12:22, skipping insertion in model container [2020-12-02 12:12:22,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:12:20" (2/3) ... [2020-12-02 12:12:22,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed17d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:12:22, skipping insertion in model container [2020-12-02 12:12:22,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:12:22" (3/3) ... [2020-12-02 12:12:22,336 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2020-12-02 12:12:22,354 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 12:12:22,355 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 12:12:22,359 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-02 12:12:22,360 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 12:12:22,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,428 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,428 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,430 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,431 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,431 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,447 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 12:12:22,473 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-02 12:12:22,489 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-02 12:12:22,531 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 12:12:22,532 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 12:12:22,532 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 12:12:22,536 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 12:12:22,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 12:12:22,537 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 12:12:22,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 12:12:22,537 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 12:12:22,554 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 12:12:22,556 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-02 12:12:22,560 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-02 12:12:22,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-12-02 12:12:22,623 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-12-02 12:12:22,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-02 12:12:22,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-02 12:12:22,632 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-02 12:12:22,856 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-02 12:12:22,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:23,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-02 12:12:23,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:23,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:23,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:23,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:12:23,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:23,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:23,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:23,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:23,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:24,140 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-02 12:12:24,253 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 12:12:24,797 WARN L197 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-02 12:12:25,020 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-02 12:12:25,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:25,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:25,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:12:25,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-02 12:12:25,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-02 12:12:25,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:25,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:25,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:25,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:25,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:25,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:25,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:12:25,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:25,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:25,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:25,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:25,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:12:25,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:25,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:25,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:25,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:25,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:25,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:25,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:25,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:25,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:25,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:25,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:26,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:26,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:26,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:26,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-02 12:12:26,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:26,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:26,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:26,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:26,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:26,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:12:26,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:26,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:26,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:26,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:26,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:12:26,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:26,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:26,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:26,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:26,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:26,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:26,937 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:12:27,083 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-02 12:12:27,293 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:12:27,503 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-02 12:12:27,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-02 12:12:27,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:27,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:27,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:27,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:12:27,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:27,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-02 12:12:27,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:27,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:27,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:27,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:28,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-02 12:12:28,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:28,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:28,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-02 12:12:28,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-02 12:12:28,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:28,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:28,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:28,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:28,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 12:12:28,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:28,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:28,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-02 12:12:28,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-02 12:12:28,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-02 12:12:28,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:28,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-02 12:12:28,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-02 12:12:28,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:28,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:28,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,923 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:28,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,945 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:28,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:28,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:28,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:29,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:29,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:29,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:29,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:29,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:29,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 12:12:29,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 12:12:29,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:29,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-02 12:12:29,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 12:12:29,864 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-02 12:12:30,031 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-02 12:12:30,205 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-02 12:12:30,320 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-02 12:12:30,427 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-02 12:12:30,529 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-02 12:12:31,291 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-02 12:12:31,516 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-02 12:12:31,963 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-02 12:12:32,169 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-02 12:12:32,185 INFO L131 LiptonReduction]: Checked pairs total: 3915 [2020-12-02 12:12:32,185 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-02 12:12:32,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-12-02 12:12:32,244 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-12-02 12:12:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-12-02 12:12:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-02 12:12:32,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:32,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:32,255 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1491491518, now seen corresponding path program 1 times [2020-12-02 12:12:32,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:32,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751313674] [2020-12-02 12:12:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:32,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751313674] [2020-12-02 12:12:32,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:32,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-02 12:12:32,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357100156] [2020-12-02 12:12:32,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 12:12:32,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:32,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 12:12:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:12:32,565 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-12-02 12:12:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:32,668 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-02 12:12:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 12:12:32,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-02 12:12:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:32,694 INFO L225 Difference]: With dead ends: 650 [2020-12-02 12:12:32,694 INFO L226 Difference]: Without dead ends: 550 [2020-12-02 12:12:32,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 12:12:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-02 12:12:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-12-02 12:12:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-02 12:12:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-12-02 12:12:32,824 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-12-02 12:12:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:32,826 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-12-02 12:12:32,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 12:12:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-12-02 12:12:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 12:12:32,830 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:32,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:32,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 12:12:32,831 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1589045551, now seen corresponding path program 1 times [2020-12-02 12:12:32,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:32,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949990536] [2020-12-02 12:12:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:33,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949990536] [2020-12-02 12:12:33,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:33,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:12:33,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872877026] [2020-12-02 12:12:33,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:12:33,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:33,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:12:33,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:12:33,086 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-12-02 12:12:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:33,153 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-12-02 12:12:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:33,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-02 12:12:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:33,160 INFO L225 Difference]: With dead ends: 630 [2020-12-02 12:12:33,161 INFO L226 Difference]: Without dead ends: 530 [2020-12-02 12:12:33,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-02 12:12:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-02 12:12:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-02 12:12:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-12-02 12:12:33,187 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-12-02 12:12:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:33,188 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-12-02 12:12:33,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:12:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-12-02 12:12:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 12:12:33,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:33,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:33,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 12:12:33,191 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:33,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2015868599, now seen corresponding path program 1 times [2020-12-02 12:12:33,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:33,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389722715] [2020-12-02 12:12:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:33,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389722715] [2020-12-02 12:12:33,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:33,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 12:12:33,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749927259] [2020-12-02 12:12:33,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:12:33,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:12:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:12:33,344 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-12-02 12:12:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:33,392 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-12-02 12:12:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 12:12:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:33,397 INFO L225 Difference]: With dead ends: 604 [2020-12-02 12:12:33,397 INFO L226 Difference]: Without dead ends: 514 [2020-12-02 12:12:33,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-02 12:12:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-12-02 12:12:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-12-02 12:12:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-12-02 12:12:33,418 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2020-12-02 12:12:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:33,418 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-12-02 12:12:33,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:12:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-12-02 12:12:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:12:33,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:33,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:33,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 12:12:33,422 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1932541835, now seen corresponding path program 1 times [2020-12-02 12:12:33,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:33,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524952229] [2020-12-02 12:12:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:33,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524952229] [2020-12-02 12:12:33,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:33,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:12:33,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10033460] [2020-12-02 12:12:33,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:12:33,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:33,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:12:33,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:12:33,514 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 4 states. [2020-12-02 12:12:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:33,560 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2020-12-02 12:12:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:33,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 12:12:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:33,566 INFO L225 Difference]: With dead ends: 800 [2020-12-02 12:12:33,566 INFO L226 Difference]: Without dead ends: 574 [2020-12-02 12:12:33,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-02 12:12:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2020-12-02 12:12:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-12-02 12:12:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2020-12-02 12:12:33,587 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2020-12-02 12:12:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:33,587 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2020-12-02 12:12:33,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:12:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2020-12-02 12:12:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 12:12:33,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:33,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:33,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 12:12:33,589 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1932500512, now seen corresponding path program 1 times [2020-12-02 12:12:33,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:33,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205891788] [2020-12-02 12:12:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:33,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205891788] [2020-12-02 12:12:33,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:33,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:12:33,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874950357] [2020-12-02 12:12:33,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:12:33,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:33,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:12:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:33,745 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand 5 states. [2020-12-02 12:12:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:33,847 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2020-12-02 12:12:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:33,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-02 12:12:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:33,852 INFO L225 Difference]: With dead ends: 548 [2020-12-02 12:12:33,853 INFO L226 Difference]: Without dead ends: 488 [2020-12-02 12:12:33,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-02 12:12:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-12-02 12:12:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-12-02 12:12:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2020-12-02 12:12:33,878 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2020-12-02 12:12:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:33,879 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2020-12-02 12:12:33,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:12:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2020-12-02 12:12:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:12:33,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:33,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:33,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 12:12:33,881 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1901119999, now seen corresponding path program 1 times [2020-12-02 12:12:33,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:33,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467028345] [2020-12-02 12:12:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:33,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467028345] [2020-12-02 12:12:33,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:33,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:12:33,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167528380] [2020-12-02 12:12:33,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:12:33,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:34,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:12:34,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:12:34,000 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand 4 states. [2020-12-02 12:12:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:34,071 INFO L93 Difference]: Finished difference Result 755 states and 2074 transitions. [2020-12-02 12:12:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:34,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 12:12:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:34,077 INFO L225 Difference]: With dead ends: 755 [2020-12-02 12:12:34,077 INFO L226 Difference]: Without dead ends: 536 [2020-12-02 12:12:34,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-02 12:12:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 464. [2020-12-02 12:12:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-02 12:12:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1274 transitions. [2020-12-02 12:12:34,100 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1274 transitions. Word has length 13 [2020-12-02 12:12:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:34,101 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1274 transitions. [2020-12-02 12:12:34,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:12:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1274 transitions. [2020-12-02 12:12:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:12:34,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:34,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:34,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 12:12:34,103 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash -734667343, now seen corresponding path program 1 times [2020-12-02 12:12:34,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:34,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29956131] [2020-12-02 12:12:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:34,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29956131] [2020-12-02 12:12:34,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:34,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:34,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864042647] [2020-12-02 12:12:34,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:34,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:34,315 INFO L87 Difference]: Start difference. First operand 464 states and 1274 transitions. Second operand 6 states. [2020-12-02 12:12:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:34,450 INFO L93 Difference]: Finished difference Result 528 states and 1420 transitions. [2020-12-02 12:12:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:12:34,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-02 12:12:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:34,456 INFO L225 Difference]: With dead ends: 528 [2020-12-02 12:12:34,456 INFO L226 Difference]: Without dead ends: 480 [2020-12-02 12:12:34,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:12:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-02 12:12:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2020-12-02 12:12:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-12-02 12:12:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1310 transitions. [2020-12-02 12:12:34,476 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1310 transitions. Word has length 13 [2020-12-02 12:12:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:34,477 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 1310 transitions. [2020-12-02 12:12:34,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1310 transitions. [2020-12-02 12:12:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:12:34,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:34,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:34,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 12:12:34,479 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash 203161555, now seen corresponding path program 2 times [2020-12-02 12:12:34,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:34,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196813782] [2020-12-02 12:12:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:34,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196813782] [2020-12-02 12:12:34,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:34,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:34,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325886950] [2020-12-02 12:12:34,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:34,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:34,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:34,606 INFO L87 Difference]: Start difference. First operand 480 states and 1310 transitions. Second operand 6 states. [2020-12-02 12:12:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:34,719 INFO L93 Difference]: Finished difference Result 516 states and 1376 transitions. [2020-12-02 12:12:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:12:34,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-02 12:12:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:34,724 INFO L225 Difference]: With dead ends: 516 [2020-12-02 12:12:34,724 INFO L226 Difference]: Without dead ends: 468 [2020-12-02 12:12:34,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:12:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-12-02 12:12:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 452. [2020-12-02 12:12:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-12-02 12:12:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1230 transitions. [2020-12-02 12:12:34,741 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1230 transitions. Word has length 13 [2020-12-02 12:12:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:34,741 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1230 transitions. [2020-12-02 12:12:34,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1230 transitions. [2020-12-02 12:12:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:12:34,743 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:34,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:34,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 12:12:34,744 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash 222073074, now seen corresponding path program 1 times [2020-12-02 12:12:34,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:34,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902039386] [2020-12-02 12:12:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:34,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902039386] [2020-12-02 12:12:34,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:34,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:12:34,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228770404] [2020-12-02 12:12:34,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:12:34,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:12:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:34,861 INFO L87 Difference]: Start difference. First operand 452 states and 1230 transitions. Second operand 5 states. [2020-12-02 12:12:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:34,964 INFO L93 Difference]: Finished difference Result 501 states and 1339 transitions. [2020-12-02 12:12:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:12:34,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-02 12:12:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:34,972 INFO L225 Difference]: With dead ends: 501 [2020-12-02 12:12:34,972 INFO L226 Difference]: Without dead ends: 456 [2020-12-02 12:12:34,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-02 12:12:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2020-12-02 12:12:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-12-02 12:12:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1240 transitions. [2020-12-02 12:12:34,989 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1240 transitions. Word has length 13 [2020-12-02 12:12:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:34,990 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1240 transitions. [2020-12-02 12:12:34,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:12:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1240 transitions. [2020-12-02 12:12:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 12:12:34,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:34,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:34,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 12:12:34,992 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -164998506, now seen corresponding path program 2 times [2020-12-02 12:12:34,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:34,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543510003] [2020-12-02 12:12:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:35,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543510003] [2020-12-02 12:12:35,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:35,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:35,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477989354] [2020-12-02 12:12:35,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:35,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:35,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:35,168 INFO L87 Difference]: Start difference. First operand 456 states and 1240 transitions. Second operand 6 states. [2020-12-02 12:12:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:35,408 INFO L93 Difference]: Finished difference Result 495 states and 1317 transitions. [2020-12-02 12:12:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 12:12:35,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-02 12:12:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:35,412 INFO L225 Difference]: With dead ends: 495 [2020-12-02 12:12:35,413 INFO L226 Difference]: Without dead ends: 450 [2020-12-02 12:12:35,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-02 12:12:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-02 12:12:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2020-12-02 12:12:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-02 12:12:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1208 transitions. [2020-12-02 12:12:35,436 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1208 transitions. Word has length 13 [2020-12-02 12:12:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:35,436 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1208 transitions. [2020-12-02 12:12:35,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1208 transitions. [2020-12-02 12:12:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:12:35,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:35,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:35,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 12:12:35,442 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1299804351, now seen corresponding path program 1 times [2020-12-02 12:12:35,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:35,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031948682] [2020-12-02 12:12:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:35,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031948682] [2020-12-02 12:12:35,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:35,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:35,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351896562] [2020-12-02 12:12:35,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:35,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:35,593 INFO L87 Difference]: Start difference. First operand 446 states and 1208 transitions. Second operand 6 states. [2020-12-02 12:12:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:35,723 INFO L93 Difference]: Finished difference Result 512 states and 1360 transitions. [2020-12-02 12:12:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:12:35,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 12:12:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:35,727 INFO L225 Difference]: With dead ends: 512 [2020-12-02 12:12:35,728 INFO L226 Difference]: Without dead ends: 470 [2020-12-02 12:12:35,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:12:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-12-02 12:12:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2020-12-02 12:12:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-12-02 12:12:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1228 transitions. [2020-12-02 12:12:35,747 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1228 transitions. Word has length 14 [2020-12-02 12:12:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:35,747 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1228 transitions. [2020-12-02 12:12:35,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1228 transitions. [2020-12-02 12:12:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 12:12:35,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:35,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:35,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 12:12:35,750 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1705621535, now seen corresponding path program 1 times [2020-12-02 12:12:35,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:35,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564407075] [2020-12-02 12:12:35,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:35,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564407075] [2020-12-02 12:12:35,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:35,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:35,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469782342] [2020-12-02 12:12:35,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:35,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:35,886 INFO L87 Difference]: Start difference. First operand 458 states and 1228 transitions. Second operand 6 states. [2020-12-02 12:12:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:36,068 INFO L93 Difference]: Finished difference Result 480 states and 1265 transitions. [2020-12-02 12:12:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:12:36,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-02 12:12:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:36,074 INFO L225 Difference]: With dead ends: 480 [2020-12-02 12:12:36,074 INFO L226 Difference]: Without dead ends: 450 [2020-12-02 12:12:36,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:12:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-02 12:12:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2020-12-02 12:12:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-02 12:12:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1190 transitions. [2020-12-02 12:12:36,093 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1190 transitions. Word has length 14 [2020-12-02 12:12:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:36,093 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1190 transitions. [2020-12-02 12:12:36,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1190 transitions. [2020-12-02 12:12:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 12:12:36,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:36,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:36,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 12:12:36,096 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1670281230, now seen corresponding path program 1 times [2020-12-02 12:12:36,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:36,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292088309] [2020-12-02 12:12:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:36,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292088309] [2020-12-02 12:12:36,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:36,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-02 12:12:36,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791122056] [2020-12-02 12:12:36,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 12:12:36,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 12:12:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 12:12:36,179 INFO L87 Difference]: Start difference. First operand 446 states and 1190 transitions. Second operand 4 states. [2020-12-02 12:12:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:36,212 INFO L93 Difference]: Finished difference Result 432 states and 1011 transitions. [2020-12-02 12:12:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 12:12:36,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-02 12:12:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:36,216 INFO L225 Difference]: With dead ends: 432 [2020-12-02 12:12:36,216 INFO L226 Difference]: Without dead ends: 324 [2020-12-02 12:12:36,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-02 12:12:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2020-12-02 12:12:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-02 12:12:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 744 transitions. [2020-12-02 12:12:36,229 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 744 transitions. Word has length 15 [2020-12-02 12:12:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:36,229 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 744 transitions. [2020-12-02 12:12:36,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 12:12:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 744 transitions. [2020-12-02 12:12:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 12:12:36,231 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:36,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:36,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 12:12:36,231 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash -942899002, now seen corresponding path program 1 times [2020-12-02 12:12:36,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:36,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8459984] [2020-12-02 12:12:36,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:36,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8459984] [2020-12-02 12:12:36,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:36,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 12:12:36,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799506063] [2020-12-02 12:12:36,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-02 12:12:36,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-02 12:12:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-02 12:12:36,316 INFO L87 Difference]: Start difference. First operand 324 states and 744 transitions. Second operand 5 states. [2020-12-02 12:12:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:36,361 INFO L93 Difference]: Finished difference Result 259 states and 534 transitions. [2020-12-02 12:12:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 12:12:36,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-02 12:12:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:36,364 INFO L225 Difference]: With dead ends: 259 [2020-12-02 12:12:36,364 INFO L226 Difference]: Without dead ends: 186 [2020-12-02 12:12:36,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-02 12:12:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2020-12-02 12:12:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-02 12:12:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 354 transitions. [2020-12-02 12:12:36,371 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 354 transitions. Word has length 16 [2020-12-02 12:12:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:36,372 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 354 transitions. [2020-12-02 12:12:36,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-02 12:12:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 354 transitions. [2020-12-02 12:12:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 12:12:36,373 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:36,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:36,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 12:12:36,374 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959845, now seen corresponding path program 1 times [2020-12-02 12:12:36,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:36,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046428238] [2020-12-02 12:12:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:36,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046428238] [2020-12-02 12:12:36,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:36,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 12:12:36,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703255652] [2020-12-02 12:12:36,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 12:12:36,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 12:12:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-02 12:12:36,462 INFO L87 Difference]: Start difference. First operand 182 states and 354 transitions. Second operand 6 states. [2020-12-02 12:12:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:36,528 INFO L93 Difference]: Finished difference Result 155 states and 300 transitions. [2020-12-02 12:12:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 12:12:36,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 12:12:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:36,530 INFO L225 Difference]: With dead ends: 155 [2020-12-02 12:12:36,530 INFO L226 Difference]: Without dead ends: 52 [2020-12-02 12:12:36,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-02 12:12:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-02 12:12:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-12-02 12:12:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-02 12:12:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-02 12:12:36,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-12-02 12:12:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:36,536 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-02 12:12:36,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 12:12:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-02 12:12:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 12:12:36,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:36,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:36,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 12:12:36,538 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1886722460, now seen corresponding path program 1 times [2020-12-02 12:12:36,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:36,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785679275] [2020-12-02 12:12:36,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 12:12:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 12:12:36,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785679275] [2020-12-02 12:12:36,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 12:12:36,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 12:12:36,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193768500] [2020-12-02 12:12:36,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 12:12:36,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 12:12:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 12:12:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 12:12:36,826 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 8 states. [2020-12-02 12:12:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 12:12:37,072 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2020-12-02 12:12:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 12:12:37,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-02 12:12:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 12:12:37,074 INFO L225 Difference]: With dead ends: 75 [2020-12-02 12:12:37,074 INFO L226 Difference]: Without dead ends: 48 [2020-12-02 12:12:37,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 12:12:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-02 12:12:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-12-02 12:12:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-02 12:12:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-02 12:12:37,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-02 12:12:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 12:12:37,077 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-02 12:12:37,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 12:12:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-02 12:12:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 12:12:37,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 12:12:37,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 12:12:37,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 12:12:37,078 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 12:12:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 12:12:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1747085148, now seen corresponding path program 2 times [2020-12-02 12:12:37,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 12:12:37,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527174163] [2020-12-02 12:12:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 12:12:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:12:37,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:12:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 12:12:37,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 12:12:37,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 12:12:37,235 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 12:12:37,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 12:12:37,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:12:37 BasicIcfg [2020-12-02 12:12:37,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 12:12:37,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 12:12:37,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 12:12:37,328 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 12:12:37,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:12:22" (3/4) ... [2020-12-02 12:12:37,333 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 12:12:37,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 12:12:37,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 12:12:37,507 INFO L168 Benchmark]: Toolchain (without parser) took 18310.47 ms. Allocated memory was 44.0 MB in the beginning and 287.3 MB in the end (delta: 243.3 MB). Free memory was 28.6 MB in the beginning and 149.2 MB in the end (delta: -120.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,508 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 26.7 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 12:12:37,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.80 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.3 MB in the beginning and 25.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.38 ms. Allocated memory is still 54.5 MB. Free memory was 25.1 MB in the beginning and 22.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,509 INFO L168 Benchmark]: Boogie Preprocessor took 70.90 ms. Allocated memory is still 54.5 MB. Free memory was 22.3 MB in the beginning and 34.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,510 INFO L168 Benchmark]: RCFGBuilder took 2162.90 ms. Allocated memory was 54.5 MB in the beginning and 83.9 MB in the end (delta: 29.4 MB). Free memory was 34.1 MB in the beginning and 39.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,510 INFO L168 Benchmark]: TraceAbstraction took 14999.73 ms. Allocated memory was 83.9 MB in the beginning and 287.3 MB in the end (delta: 203.4 MB). Free memory was 39.3 MB in the beginning and 161.8 MB in the end (delta: -122.5 MB). Peak memory consumption was 80.9 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,511 INFO L168 Benchmark]: Witness Printer took 178.91 ms. Allocated memory is still 287.3 MB. Free memory was 161.8 MB in the beginning and 149.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-02 12:12:37,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 44.0 MB. Free memory was 26.7 MB in the beginning and 26.7 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 803.80 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 28.3 MB in the beginning and 25.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.38 ms. Allocated memory is still 54.5 MB. Free memory was 25.1 MB in the beginning and 22.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.90 ms. Allocated memory is still 54.5 MB. Free memory was 22.3 MB in the beginning and 34.1 MB in the end (delta: -11.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2162.90 ms. Allocated memory was 54.5 MB in the beginning and 83.9 MB in the end (delta: 29.4 MB). Free memory was 34.1 MB in the beginning and 39.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14999.73 ms. Allocated memory was 83.9 MB in the beginning and 287.3 MB in the end (delta: 203.4 MB). Free memory was 39.3 MB in the beginning and 161.8 MB in the end (delta: -122.5 MB). Peak memory consumption was 80.9 MB. Max. memory is 16.1 GB. * Witness Printer took 178.91 ms. Allocated memory is still 287.3 MB. Free memory was 161.8 MB in the beginning and 149.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1011 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3915 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2498; [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 454 SDtfs, 489 SDslu, 849 SDs, 0 SdLazy, 410 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 208 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 19893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...