./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix045_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/mix045_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 4032d69e7bc0beba75950f230b471dd645321a69 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1-dev-20ed64e [2021-08-26 14:32:00,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:32:00,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:32:00,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:32:00,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:32:00,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:32:00,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:32:00,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:32:00,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:32:00,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:32:00,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:32:00,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:32:00,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:32:00,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:32:00,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:32:00,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:32:00,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:32:00,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:32:00,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:32:00,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:32:00,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:32:00,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:32:00,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:32:00,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:32:00,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:32:00,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:32:00,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:32:00,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:32:00,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:32:00,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:32:00,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:32:00,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:32:00,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:32:00,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:32:00,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:32:00,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:32:00,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:32:00,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:32:00,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:32:00,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:32:00,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:32:00,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:32:00,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:32:00,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:32:00,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:32:00,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:32:00,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:32:00,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:32:00,520 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:32:00,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:32:00,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:32:00,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:32:00,522 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:32:00,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:32:00,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:32:00,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:32:00,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:32:00,525 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 -> 4032d69e7bc0beba75950f230b471dd645321a69 [2021-08-26 14:32:00,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:32:00,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:32:00,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:32:00,820 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:32:00,820 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:32:00,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix045_pso.opt.i [2021-08-26 14:32:00,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef3adc57/ca98e62aa13640a69327eb7332ee846c/FLAGac2406217 [2021-08-26 14:32:01,203 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:32:01,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_pso.opt.i [2021-08-26 14:32:01,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef3adc57/ca98e62aa13640a69327eb7332ee846c/FLAGac2406217 [2021-08-26 14:32:01,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef3adc57/ca98e62aa13640a69327eb7332ee846c [2021-08-26 14:32:01,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:32:01,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:32:01,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:32:01,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:32:01,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:32:01,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7dfbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01, skipping insertion in model container [2021-08-26 14:32:01,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:32:01,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:32:01,751 WARN L228 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/mix045_pso.opt.i[948,961] [2021-08-26 14:32:01,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:32:01,916 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:32:01,927 WARN L228 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/mix045_pso.opt.i[948,961] [2021-08-26 14:32:01,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:32:02,015 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:32:02,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02 WrapperNode [2021-08-26 14:32:02,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:32:02,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:32:02,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:32:02,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:32:02,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:32:02,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:32:02,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:32:02,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:32:02,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:32:02,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:32:02,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:32:02,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:32:02,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (1/1) ... [2021-08-26 14:32:02,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:32:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:32:02,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:32:02,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:32:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:32:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:32:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-26 14:32:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-26 14:32:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-26 14:32:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:32:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:32:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:32:02,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:32:02,141 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:32:03,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:32:03,685 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 14:32:03,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03 BoogieIcfgContainer [2021-08-26 14:32:03,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:32:03,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:32:03,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:32:03,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:32:03,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:32:01" (1/3) ... [2021-08-26 14:32:03,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281ea57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:32:03, skipping insertion in model container [2021-08-26 14:32:03,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:02" (2/3) ... [2021-08-26 14:32:03,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281ea57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:32:03, skipping insertion in model container [2021-08-26 14:32:03,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03" (3/3) ... [2021-08-26 14:32:03,692 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2021-08-26 14:32:03,695 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:32:03,695 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:32:03,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 14:32:03,695 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:32:03,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,720 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,738 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,739 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-26 14:32:03,770 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:32:03,775 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 14:32:03,775 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-26 14:32:03,783 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:32:03,789 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 233 flow [2021-08-26 14:32:03,790 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 233 flow [2021-08-26 14:32:03,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2021-08-26 14:32:03,815 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2021-08-26 14:32:03,815 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-26 14:32:03,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-26 14:32:03,820 INFO L116 LiptonReduction]: Number of co-enabled transitions 1898 [2021-08-26 14:32:17,020 INFO L131 LiptonReduction]: Checked pairs total: 4834 [2021-08-26 14:32:17,020 INFO L133 LiptonReduction]: Total number of compositions: 96 [2021-08-26 14:32:17,025 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2021-08-26 14:32:17,050 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 14:32:17,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:17,058 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:17,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2097392372, now seen corresponding path program 1 times [2021-08-26 14:32:17,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:17,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599171460] [2021-08-26 14:32:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:17,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:17,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:17,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599171460] [2021-08-26 14:32:17,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599171460] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:17,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:17,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:32:17,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646903861] [2021-08-26 14:32:17,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:32:17,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:32:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,269 INFO L87 Difference]: Start difference. First operand has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:17,335 INFO L93 Difference]: Finished difference Result 550 states and 1673 transitions. [2021-08-26 14:32:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:32:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-26 14:32:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:17,354 INFO L225 Difference]: With dead ends: 550 [2021-08-26 14:32:17,355 INFO L226 Difference]: Without dead ends: 530 [2021-08-26 14:32:17,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-26 14:32:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-08-26 14:32:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.0661625708884688) internal successors, (1622), 529 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2021-08-26 14:32:17,414 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2021-08-26 14:32:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:17,419 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2021-08-26 14:32:17,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2021-08-26 14:32:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 14:32:17,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:17,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:17,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:32:17,423 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:17,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1254340074, now seen corresponding path program 1 times [2021-08-26 14:32:17,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:17,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115932932] [2021-08-26 14:32:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:17,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:17,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:17,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115932932] [2021-08-26 14:32:17,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115932932] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:17,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:17,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:32:17,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117361033] [2021-08-26 14:32:17,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:32:17,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:32:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,542 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:17,553 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2021-08-26 14:32:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:32:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-26 14:32:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:17,558 INFO L225 Difference]: With dead ends: 490 [2021-08-26 14:32:17,558 INFO L226 Difference]: Without dead ends: 490 [2021-08-26 14:32:17,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-08-26 14:32:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2021-08-26 14:32:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0265848670756648) internal successors, (1480), 489 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2021-08-26 14:32:17,581 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2021-08-26 14:32:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:17,581 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2021-08-26 14:32:17,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2021-08-26 14:32:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:32:17,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:17,586 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:17,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:32:17,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1430347617, now seen corresponding path program 1 times [2021-08-26 14:32:17,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:17,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518420651] [2021-08-26 14:32:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:17,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:17,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:17,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518420651] [2021-08-26 14:32:17,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518420651] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:17,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:17,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:32:17,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498944487] [2021-08-26 14:32:17,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:32:17,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:32:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,678 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:17,702 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2021-08-26 14:32:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:32:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:32:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:17,706 INFO L225 Difference]: With dead ends: 482 [2021-08-26 14:32:17,706 INFO L226 Difference]: Without dead ends: 482 [2021-08-26 14:32:17,706 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-08-26 14:32:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-08-26 14:32:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 3.0145530145530146) internal successors, (1450), 481 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2021-08-26 14:32:17,720 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 11 [2021-08-26 14:32:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:17,720 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2021-08-26 14:32:17,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2021-08-26 14:32:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:32:17,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:17,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:17,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:32:17,723 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 127716477, now seen corresponding path program 1 times [2021-08-26 14:32:17,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:17,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881623660] [2021-08-26 14:32:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:17,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:17,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:17,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881623660] [2021-08-26 14:32:17,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881623660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:17,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:17,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:17,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843585095] [2021-08-26 14:32:17,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:17,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:17,916 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:17,966 INFO L93 Difference]: Finished difference Result 470 states and 1406 transitions. [2021-08-26 14:32:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:32:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 14:32:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:17,969 INFO L225 Difference]: With dead ends: 470 [2021-08-26 14:32:17,969 INFO L226 Difference]: Without dead ends: 470 [2021-08-26 14:32:17,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-08-26 14:32:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2021-08-26 14:32:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.997867803837953) internal successors, (1406), 469 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1406 transitions. [2021-08-26 14:32:17,979 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1406 transitions. Word has length 12 [2021-08-26 14:32:17,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:17,979 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1406 transitions. [2021-08-26 14:32:17,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1406 transitions. [2021-08-26 14:32:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:32:17,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:17,980 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:17,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:32:17,981 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2075238682, now seen corresponding path program 1 times [2021-08-26 14:32:17,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:17,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617383741] [2021-08-26 14:32:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:17,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:18,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:18,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617383741] [2021-08-26 14:32:18,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617383741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:18,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:18,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:18,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653288447] [2021-08-26 14:32:18,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:18,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:18,082 INFO L87 Difference]: Start difference. First operand 470 states and 1406 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:18,131 INFO L93 Difference]: Finished difference Result 510 states and 1540 transitions. [2021-08-26 14:32:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 14:32:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:18,134 INFO L225 Difference]: With dead ends: 510 [2021-08-26 14:32:18,134 INFO L226 Difference]: Without dead ends: 510 [2021-08-26 14:32:18,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-08-26 14:32:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-08-26 14:32:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 3.025540275049116) internal successors, (1540), 509 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1540 transitions. [2021-08-26 14:32:18,145 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1540 transitions. Word has length 13 [2021-08-26 14:32:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:18,145 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1540 transitions. [2021-08-26 14:32:18,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1540 transitions. [2021-08-26 14:32:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:32:18,146 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:18,147 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:18,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:32:18,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2109863512, now seen corresponding path program 2 times [2021-08-26 14:32:18,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:18,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652332876] [2021-08-26 14:32:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:18,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:18,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:18,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652332876] [2021-08-26 14:32:18,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652332876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:18,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:18,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:32:18,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703471507] [2021-08-26 14:32:18,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:32:18,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:32:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:18,276 INFO L87 Difference]: Start difference. First operand 510 states and 1540 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:18,333 INFO L93 Difference]: Finished difference Result 502 states and 1510 transitions. [2021-08-26 14:32:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:32:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 14:32:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:18,336 INFO L225 Difference]: With dead ends: 502 [2021-08-26 14:32:18,336 INFO L226 Difference]: Without dead ends: 502 [2021-08-26 14:32:18,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:32:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-08-26 14:32:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 462. [2021-08-26 14:32:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.984815618221258) internal successors, (1376), 461 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1376 transitions. [2021-08-26 14:32:18,345 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1376 transitions. Word has length 13 [2021-08-26 14:32:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:18,346 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 1376 transitions. [2021-08-26 14:32:18,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1376 transitions. [2021-08-26 14:32:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:32:18,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:18,347 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:18,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:32:18,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:18,348 INFO L82 PathProgramCache]: Analyzing trace with hash -233272068, now seen corresponding path program 1 times [2021-08-26 14:32:18,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:18,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527019676] [2021-08-26 14:32:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:18,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:18,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:18,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527019676] [2021-08-26 14:32:18,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527019676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:18,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:18,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:18,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104837059] [2021-08-26 14:32:18,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:32:18,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:18,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:32:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:18,472 INFO L87 Difference]: Start difference. First operand 462 states and 1376 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:18,551 INFO L93 Difference]: Finished difference Result 534 states and 1586 transitions. [2021-08-26 14:32:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 14:32:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:18,556 INFO L225 Difference]: With dead ends: 534 [2021-08-26 14:32:18,556 INFO L226 Difference]: Without dead ends: 534 [2021-08-26 14:32:18,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 57.5ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-26 14:32:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-08-26 14:32:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2021-08-26 14:32:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.975609756097561) internal successors, (1586), 533 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1586 transitions. [2021-08-26 14:32:18,567 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1586 transitions. Word has length 14 [2021-08-26 14:32:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:18,567 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1586 transitions. [2021-08-26 14:32:18,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1586 transitions. [2021-08-26 14:32:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:32:18,568 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:18,568 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:18,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:32:18,569 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -168286026, now seen corresponding path program 2 times [2021-08-26 14:32:18,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:18,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172903904] [2021-08-26 14:32:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:18,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:18,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:18,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172903904] [2021-08-26 14:32:18,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172903904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:18,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:18,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:18,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296201364] [2021-08-26 14:32:18,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:32:18,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:32:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:18,748 INFO L87 Difference]: Start difference. First operand 534 states and 1586 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:18,800 INFO L93 Difference]: Finished difference Result 646 states and 1930 transitions. [2021-08-26 14:32:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:18,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 14:32:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:18,803 INFO L225 Difference]: With dead ends: 646 [2021-08-26 14:32:18,803 INFO L226 Difference]: Without dead ends: 646 [2021-08-26 14:32:18,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-08-26 14:32:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 574. [2021-08-26 14:32:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 3.0017452006980805) internal successors, (1720), 573 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1720 transitions. [2021-08-26 14:32:18,815 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1720 transitions. Word has length 14 [2021-08-26 14:32:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:18,815 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 1720 transitions. [2021-08-26 14:32:18,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1720 transitions. [2021-08-26 14:32:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:32:18,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:18,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:18,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:32:18,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 981223734, now seen corresponding path program 3 times [2021-08-26 14:32:18,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:18,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757936849] [2021-08-26 14:32:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:18,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:18,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:18,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757936849] [2021-08-26 14:32:18,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757936849] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:18,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:18,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:18,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473818547] [2021-08-26 14:32:18,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:32:18,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:32:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:18,981 INFO L87 Difference]: Start difference. First operand 574 states and 1720 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,058 INFO L93 Difference]: Finished difference Result 558 states and 1668 transitions. [2021-08-26 14:32:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:19,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 14:32:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,061 INFO L225 Difference]: With dead ends: 558 [2021-08-26 14:32:19,061 INFO L226 Difference]: Without dead ends: 558 [2021-08-26 14:32:19,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.5ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:32:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-08-26 14:32:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 446. [2021-08-26 14:32:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.9752808988764046) internal successors, (1324), 445 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1324 transitions. [2021-08-26 14:32:19,070 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1324 transitions. Word has length 14 [2021-08-26 14:32:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,071 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1324 transitions. [2021-08-26 14:32:19,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1324 transitions. [2021-08-26 14:32:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:32:19,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,072 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:32:19,072 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1818579204, now seen corresponding path program 1 times [2021-08-26 14:32:19,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762575357] [2021-08-26 14:32:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762575357] [2021-08-26 14:32:19,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762575357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:19,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272816990] [2021-08-26 14:32:19,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:19,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:19,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:19,111 INFO L87 Difference]: Start difference. First operand 446 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,128 INFO L93 Difference]: Finished difference Result 436 states and 1150 transitions. [2021-08-26 14:32:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 14:32:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,130 INFO L225 Difference]: With dead ends: 436 [2021-08-26 14:32:19,130 INFO L226 Difference]: Without dead ends: 316 [2021-08-26 14:32:19,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-26 14:32:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-08-26 14:32:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.552380952380952) internal successors, (804), 315 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 804 transitions. [2021-08-26 14:32:19,136 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 804 transitions. Word has length 14 [2021-08-26 14:32:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,136 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 804 transitions. [2021-08-26 14:32:19,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 804 transitions. [2021-08-26 14:32:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 14:32:19,137 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,137 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:32:19,137 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1015207610, now seen corresponding path program 1 times [2021-08-26 14:32:19,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805501922] [2021-08-26 14:32:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805501922] [2021-08-26 14:32:19,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805501922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:32:19,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286913221] [2021-08-26 14:32:19,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:19,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:19,182 INFO L87 Difference]: Start difference. First operand 316 states and 804 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,222 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2021-08-26 14:32:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:32:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 14:32:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,223 INFO L225 Difference]: With dead ends: 265 [2021-08-26 14:32:19,223 INFO L226 Difference]: Without dead ends: 205 [2021-08-26 14:32:19,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-26 14:32:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-08-26 14:32:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.3088235294117645) internal successors, (471), 204 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2021-08-26 14:32:19,227 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2021-08-26 14:32:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,227 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2021-08-26 14:32:19,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2021-08-26 14:32:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:32:19,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,228 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:32:19,228 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -907619327, now seen corresponding path program 1 times [2021-08-26 14:32:19,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867759707] [2021-08-26 14:32:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867759707] [2021-08-26 14:32:19,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867759707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:19,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980457959] [2021-08-26 14:32:19,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:19,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:19,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:19,264 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,275 INFO L93 Difference]: Finished difference Result 268 states and 601 transitions. [2021-08-26 14:32:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:32:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:32:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,276 INFO L225 Difference]: With dead ends: 268 [2021-08-26 14:32:19,276 INFO L226 Difference]: Without dead ends: 118 [2021-08-26 14:32:19,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-26 14:32:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-08-26 14:32:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.0256410256410255) internal successors, (237), 117 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 237 transitions. [2021-08-26 14:32:19,278 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 237 transitions. Word has length 17 [2021-08-26 14:32:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,279 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 237 transitions. [2021-08-26 14:32:19,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 237 transitions. [2021-08-26 14:32:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:32:19,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,279 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:32:19,280 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash -506246683, now seen corresponding path program 2 times [2021-08-26 14:32:19,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739680561] [2021-08-26 14:32:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739680561] [2021-08-26 14:32:19,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739680561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:32:19,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267180549] [2021-08-26 14:32:19,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:32:19,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:32:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:19,312 INFO L87 Difference]: Start difference. First operand 118 states and 237 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,319 INFO L93 Difference]: Finished difference Result 157 states and 308 transitions. [2021-08-26 14:32:19,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:32:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:32:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,320 INFO L225 Difference]: With dead ends: 157 [2021-08-26 14:32:19,320 INFO L226 Difference]: Without dead ends: 119 [2021-08-26 14:32:19,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-26 14:32:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2021-08-26 14:32:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.9051724137931034) internal successors, (221), 116 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 221 transitions. [2021-08-26 14:32:19,322 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 221 transitions. Word has length 17 [2021-08-26 14:32:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,323 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 221 transitions. [2021-08-26 14:32:19,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 221 transitions. [2021-08-26 14:32:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 14:32:19,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,323 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:32:19,324 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 830811033, now seen corresponding path program 1 times [2021-08-26 14:32:19,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892112001] [2021-08-26 14:32:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892112001] [2021-08-26 14:32:19,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892112001] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:19,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188186843] [2021-08-26 14:32:19,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:32:19,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:32:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:19,377 INFO L87 Difference]: Start difference. First operand 117 states and 221 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,403 INFO L93 Difference]: Finished difference Result 102 states and 190 transitions. [2021-08-26 14:32:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:32:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 14:32:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,404 INFO L225 Difference]: With dead ends: 102 [2021-08-26 14:32:19,404 INFO L226 Difference]: Without dead ends: 48 [2021-08-26 14:32:19,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-08-26 14:32:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-08-26 14:32:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2021-08-26 14:32:19,406 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2021-08-26 14:32:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,406 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2021-08-26 14:32:19,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2021-08-26 14:32:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:32:19,406 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,406 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 14:32:19,407 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1237618054, now seen corresponding path program 1 times [2021-08-26 14:32:19,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334082452] [2021-08-26 14:32:19,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:19,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:19,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334082452] [2021-08-26 14:32:19,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334082452] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:19,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:19,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:19,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449415283] [2021-08-26 14:32:19,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:32:19,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:32:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:19,542 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:19,601 INFO L93 Difference]: Finished difference Result 62 states and 103 transitions. [2021-08-26 14:32:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:32:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-26 14:32:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:19,602 INFO L225 Difference]: With dead ends: 62 [2021-08-26 14:32:19,602 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 14:32:19,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-26 14:32:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 14:32:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-26 14:32:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-08-26 14:32:19,603 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2021-08-26 14:32:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:19,613 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-08-26 14:32:19,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-08-26 14:32:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 14:32:19,614 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:19,614 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:19,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 14:32:19,614 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2056056656, now seen corresponding path program 2 times [2021-08-26 14:32:19,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:19,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103658857] [2021-08-26 14:32:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:19,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:32:19,648 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:32:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:32:19,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:32:19,730 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:32:19,731 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:19,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:19,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:32:19,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:32:19,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-26 14:32:19,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:19,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 14:32:19,737 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:32:19,737 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:32:19,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:32:19 BasicIcfg [2021-08-26 14:32:19,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:32:19,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:32:19,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:32:19,786 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:32:19,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03" (3/4) ... [2021-08-26 14:32:19,788 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:32:19,844 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:32:19,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:32:19,846 INFO L168 Benchmark]: Toolchain (without parser) took 18246.60 ms. Allocated memory was 58.7 MB in the beginning and 239.1 MB in the end (delta: 180.4 MB). Free memory was 36.7 MB in the beginning and 156.1 MB in the end (delta: -119.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,846 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:32:19,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.81 ms. Allocated memory was 58.7 MB in the beginning and 79.7 MB in the end (delta: 21.0 MB). Free memory was 36.3 MB in the beginning and 52.1 MB in the end (delta: -15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 79.7 MB. Free memory was 52.1 MB in the beginning and 49.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,846 INFO L168 Benchmark]: Boogie Preprocessor took 19.99 ms. Allocated memory is still 79.7 MB. Free memory was 49.0 MB in the beginning and 46.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,847 INFO L168 Benchmark]: RCFGBuilder took 1612.42 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 46.9 MB in the beginning and 71.8 MB in the end (delta: -24.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,847 INFO L168 Benchmark]: TraceAbstraction took 16097.82 ms. Allocated memory was 96.5 MB in the beginning and 239.1 MB in the end (delta: 142.6 MB). Free memory was 70.9 MB in the beginning and 169.7 MB in the end (delta: -98.8 MB). Peak memory consumption was 43.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,847 INFO L168 Benchmark]: Witness Printer took 58.54 ms. Allocated memory is still 239.1 MB. Free memory was 169.7 MB in the beginning and 156.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:19,848 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.16 ms. Allocated memory is still 58.7 MB. Free memory was 41.2 MB in the beginning and 41.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 416.81 ms. Allocated memory was 58.7 MB in the beginning and 79.7 MB in the end (delta: 21.0 MB). Free memory was 36.3 MB in the beginning and 52.1 MB in the end (delta: -15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.02 ms. Allocated memory is still 79.7 MB. Free memory was 52.1 MB in the beginning and 49.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.99 ms. Allocated memory is still 79.7 MB. Free memory was 49.0 MB in the beginning and 46.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1612.42 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 46.9 MB in the beginning and 71.8 MB in the end (delta: -24.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16097.82 ms. Allocated memory was 96.5 MB in the beginning and 239.1 MB in the end (delta: 142.6 MB). Free memory was 70.9 MB in the beginning and 169.7 MB in the end (delta: -98.8 MB). Peak memory consumption was 43.6 MB. Max. memory is 16.1 GB. * Witness Printer took 58.54 ms. Allocated memory is still 239.1 MB. Free memory was 169.7 MB in the beginning and 156.1 MB in the end (delta: 13.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 Lipton Reduction Statistics: ReductionTime: 13229.9ms, 117 PlacesBefore, 36 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1898 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 96 TotalNumberOfCompositions, 4834 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2575, positive: 2398, positive conditional: 0, positive unconditional: 2398, negative: 177, negative conditional: 0, negative unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1334, positive: 1280, positive conditional: 0, positive unconditional: 1280, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1334, positive: 1265, positive conditional: 0, positive unconditional: 1265, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 544, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 468, negative conditional: 0, negative unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2575, positive: 1118, positive conditional: 0, positive unconditional: 1118, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 1334, unknown conditional: 0, unknown unconditional: 1334] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1202; [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L825] 0 pthread_t t1203; [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L827] 0 pthread_t t1204; [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1] [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15965.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 22.5ms, AutomataDifference: 711.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13275.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 367 SDtfs, 385 SDslu, 561 SDs, 0 SdLazy, 314 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 331.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 405.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 153.3ms AutomataMinimizationTime, 15 MinimizatonAttempts, 226 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.5ms SsaConstructionTime, 315.3ms SatisfiabilityAnalysisTime, 1120.3ms InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 1814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2021-08-26 14:32:19,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...