./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe015_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 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/safe015_rmo.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 6fc0780c5e7aaaab3fd23cf7f8fd26c5d01fd3e8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-wip.dd.multireach-323-8d31f38 [2021-07-05 15:54:50,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 15:54:50,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 15:54:50,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 15:54:50,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 15:54:50,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 15:54:50,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 15:54:50,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 15:54:50,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 15:54:50,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 15:54:50,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 15:54:50,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 15:54:50,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 15:54:50,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 15:54:50,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 15:54:50,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 15:54:50,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 15:54:50,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 15:54:50,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 15:54:50,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 15:54:50,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 15:54:50,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 15:54:50,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 15:54:50,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 15:54:50,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 15:54:50,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 15:54:50,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 15:54:50,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 15:54:50,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 15:54:50,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 15:54:50,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 15:54:50,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 15:54:50,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 15:54:50,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 15:54:50,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 15:54:50,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 15:54:50,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 15:54:50,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 15:54:50,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 15:54:50,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 15:54:50,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 15:54:50,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-07-05 15:54:50,457 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 15:54:50,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 15:54:50,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 15:54:50,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 15:54:50,458 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 15:54:50,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 15:54:50,458 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-05 15:54:50,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 15:54:50,459 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 15:54:50,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 15:54:50,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 15:54:50,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 15:54:50,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 15:54:50,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 15:54:50,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 15:54:50,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 15:54:50,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 15:54:50,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 15:54:50,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 15:54:50,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 15:54:50,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 15:54:50,461 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 -> 6fc0780c5e7aaaab3fd23cf7f8fd26c5d01fd3e8 [2021-07-05 15:54:50,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 15:54:50,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 15:54:50,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 15:54:50,708 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 15:54:50,708 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 15:54:50,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe015_rmo.opt.i [2021-07-05 15:54:50,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef512584/2c074101fc044a1193fd618c5dc95c0c/FLAG33611caa2 [2021-07-05 15:54:51,182 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 15:54:51,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe015_rmo.opt.i [2021-07-05 15:54:51,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef512584/2c074101fc044a1193fd618c5dc95c0c/FLAG33611caa2 [2021-07-05 15:54:51,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef512584/2c074101fc044a1193fd618c5dc95c0c [2021-07-05 15:54:51,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 15:54:51,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 15:54:51,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 15:54:51,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 15:54:51,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 15:54:51,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dad820c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51, skipping insertion in model container [2021-07-05 15:54:51,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 15:54:51,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 15:54:51,421 WARN L224 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/safe015_rmo.opt.i[992,1005] [2021-07-05 15:54:51,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 15:54:51,602 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 15:54:51,616 WARN L224 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/safe015_rmo.opt.i[992,1005] [2021-07-05 15:54:51,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 15:54:51,746 INFO L208 MainTranslator]: Completed translation [2021-07-05 15:54:51,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51 WrapperNode [2021-07-05 15:54:51,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 15:54:51,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 15:54:51,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 15:54:51,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 15:54:51,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 15:54:51,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 15:54:51,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 15:54:51,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 15:54:51,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 15:54:51,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 15:54:51,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 15:54:51,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 15:54:51,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (1/1) ... [2021-07-05 15:54:51,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 15:54:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 15:54:51,905 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-07-05 15:54:51,924 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-07-05 15:54:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-05 15:54:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-05 15:54:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-05 15:54:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 15:54:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-05 15:54:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-05 15:54:51,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-05 15:54:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-05 15:54:51,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-05 15:54:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-05 15:54:51,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-05 15:54:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 15:54:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-05 15:54:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 15:54:51,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 15:54:51,940 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-05 15:54:54,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 15:54:54,107 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-07-05 15:54:54,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 03:54:54 BoogieIcfgContainer [2021-07-05 15:54:54,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 15:54:54,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 15:54:54,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 15:54:54,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 15:54:54,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 03:54:51" (1/3) ... [2021-07-05 15:54:54,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ec0232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 03:54:54, skipping insertion in model container [2021-07-05 15:54:54,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 03:54:51" (2/3) ... [2021-07-05 15:54:54,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ec0232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 03:54:54, skipping insertion in model container [2021-07-05 15:54:54,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 03:54:54" (3/3) ... [2021-07-05 15:54:54,115 INFO L111 eAbstractionObserver]: Analyzing ICFG safe015_rmo.opt.i [2021-07-05 15:54:54,120 WARN L144 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-05 15:54:54,120 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 15:54:54,120 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-05 15:54:54,120 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-05 15:54:54,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,181 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,182 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-05 15:54:54,211 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-05 15:54:54,235 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 15:54:54,239 INFO L329 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, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 15:54:54,239 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 15:54:54,247 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-07-05 15:54:54,252 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 259 flow [2021-07-05 15:54:54,254 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 259 flow [2021-07-05 15:54:54,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2021-07-05 15:54:54,283 INFO L129 PetriNetUnfolder]: 2/119 cut-off events. [2021-07-05 15:54:54,283 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-07-05 15:54:54,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-07-05 15:54:54,287 INFO L116 LiptonReduction]: Number of co-enabled transitions 1652 [2021-07-05 15:54:55,644 WARN L205 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-07-05 15:54:55,992 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-07-05 15:54:57,601 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 370 DAG size of output: 326 [2021-07-05 15:54:58,335 WARN L205 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2021-07-05 15:54:59,241 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-07-05 15:54:59,522 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-07-05 15:55:00,848 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-07-05 15:55:01,425 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-07-05 15:55:01,583 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-07-05 15:55:01,959 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2021-07-05 15:55:02,081 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-07-05 15:55:08,232 WARN L205 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 238 [2021-07-05 15:55:08,600 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-07-05 15:55:09,396 WARN L205 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 326 [2021-07-05 15:55:10,179 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 326 [2021-07-05 15:55:10,578 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-07-05 15:55:10,963 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-07-05 15:55:11,677 WARN L205 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 329 [2021-07-05 15:55:12,428 WARN L205 SmtUtils]: Spent 750.00 ms on a formula simplification that was a NOOP. DAG size: 329 [2021-07-05 15:55:13,837 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 251 DAG size of output: 250 [2021-07-05 15:55:14,355 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2021-07-05 15:55:15,144 WARN L205 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2021-07-05 15:55:15,930 WARN L205 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2021-07-05 15:55:17,063 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-07-05 15:55:17,442 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-07-05 15:55:18,286 WARN L205 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2021-07-05 15:55:19,077 WARN L205 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2021-07-05 15:55:19,635 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-07-05 15:55:19,748 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-07-05 15:55:19,869 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-07-05 15:55:19,984 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-07-05 15:55:20,571 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 163 [2021-07-05 15:55:20,847 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2021-07-05 15:55:21,386 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 163 [2021-07-05 15:55:21,646 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2021-07-05 15:55:21,648 INFO L131 LiptonReduction]: Checked pairs total: 4086 [2021-07-05 15:55:21,648 INFO L133 LiptonReduction]: Total number of compositions: 109 [2021-07-05 15:55:21,653 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2021-07-05 15:55:21,673 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 550 states, 548 states have (on average 3.271897810218978) internal successors, (1793), 549 states have internal predecessors, (1793), 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-07-05 15:55:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 548 states have (on average 3.271897810218978) internal successors, (1793), 549 states have internal predecessors, (1793), 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-07-05 15:55:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-07-05 15:55:21,679 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:21,680 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:21,680 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -329464455, now seen corresponding path program 1 times [2021-07-05 15:55:21,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:21,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915927107] [2021-07-05 15:55:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:21,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:21,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:21,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:21,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915927107] [2021-07-05 15:55:21,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915927107] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:21,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:21,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-07-05 15:55:21,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175647730] [2021-07-05 15:55:21,886 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 15:55:21,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 15:55:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 15:55:21,896 INFO L87 Difference]: Start difference. First operand has 550 states, 548 states have (on average 3.271897810218978) internal successors, (1793), 549 states have internal predecessors, (1793), 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 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-07-05 15:55:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:21,926 INFO L93 Difference]: Finished difference Result 540 states and 1655 transitions. [2021-07-05 15:55:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 15:55:21,927 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-07-05 15:55:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:21,937 INFO L225 Difference]: With dead ends: 540 [2021-07-05 15:55:21,937 INFO L226 Difference]: Without dead ends: 440 [2021-07-05 15:55:21,938 INFO L795 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-07-05 15:55:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-07-05 15:55:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-07-05 15:55:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0068337129840548) internal successors, (1320), 439 states have internal predecessors, (1320), 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-07-05 15:55:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2021-07-05 15:55:21,990 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2021-07-05 15:55:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:21,990 INFO L442 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2021-07-05 15:55:21,990 INFO L443 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-07-05 15:55:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2021-07-05 15:55:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-07-05 15:55:21,991 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:21,992 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:21,992 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 15:55:21,992 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1623463817, now seen corresponding path program 1 times [2021-07-05 15:55:21,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:21,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88171100] [2021-07-05 15:55:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:21,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:22,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 15:55:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:22,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:22,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88171100] [2021-07-05 15:55:22,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88171100] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:22,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:22,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-07-05 15:55:22,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602387259] [2021-07-05 15:55:22,134 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 15:55:22,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 15:55:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 15:55:22,135 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-05 15:55:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:22,160 INFO L93 Difference]: Finished difference Result 425 states and 1268 transitions. [2021-07-05 15:55:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 15:55:22,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2021-07-05 15:55:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:22,166 INFO L225 Difference]: With dead ends: 425 [2021-07-05 15:55:22,166 INFO L226 Difference]: Without dead ends: 425 [2021-07-05 15:55:22,168 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 15:55:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-07-05 15:55:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2021-07-05 15:55:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 2.990566037735849) internal successors, (1268), 424 states have internal predecessors, (1268), 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-07-05 15:55:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1268 transitions. [2021-07-05 15:55:22,185 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1268 transitions. Word has length 10 [2021-07-05 15:55:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:22,186 INFO L442 AbstractCegarLoop]: Abstraction has 425 states and 1268 transitions. [2021-07-05 15:55:22,186 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-07-05 15:55:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1268 transitions. [2021-07-05 15:55:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-07-05 15:55:22,190 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:22,190 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:22,190 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-05 15:55:22,191 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1211300595, now seen corresponding path program 1 times [2021-07-05 15:55:22,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:22,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638249416] [2021-07-05 15:55:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:22,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:22,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-05 15:55:22,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-05 15:55:22,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-07-05 15:55:22,455 INFO L142 QuantifierPusher]: treesize reduction 19, result has 69.8 percent of original size [2021-07-05 15:55:22,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-05 15:55:22,493 INFO L142 QuantifierPusher]: treesize reduction 19, result has 42.4 percent of original size [2021-07-05 15:55:22,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 15:55:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:22,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:22,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638249416] [2021-07-05 15:55:22,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638249416] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:22,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:22,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 15:55:22,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261846895] [2021-07-05 15:55:22,516 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 15:55:22,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 15:55:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:22,517 INFO L87 Difference]: Start difference. First operand 425 states and 1268 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-07-05 15:55:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:22,601 INFO L93 Difference]: Finished difference Result 418 states and 1242 transitions. [2021-07-05 15:55:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 15:55:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-07-05 15:55:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:22,604 INFO L225 Difference]: With dead ends: 418 [2021-07-05 15:55:22,604 INFO L226 Difference]: Without dead ends: 418 [2021-07-05 15:55:22,604 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 146.8ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-07-05 15:55:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-07-05 15:55:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.9784172661870505) internal successors, (1242), 417 states have internal predecessors, (1242), 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-07-05 15:55:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1242 transitions. [2021-07-05 15:55:22,621 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1242 transitions. Word has length 11 [2021-07-05 15:55:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:22,621 INFO L442 AbstractCegarLoop]: Abstraction has 418 states and 1242 transitions. [2021-07-05 15:55:22,621 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-07-05 15:55:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1242 transitions. [2021-07-05 15:55:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 15:55:22,623 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:22,623 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:22,623 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-05 15:55:22,623 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1104373108, now seen corresponding path program 1 times [2021-07-05 15:55:22,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:22,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773599386] [2021-07-05 15:55:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:22,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:22,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-05 15:55:22,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 15:55:22,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 15:55:22,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 15:55:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:22,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:22,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773599386] [2021-07-05 15:55:22,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773599386] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:22,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:22,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 15:55:22,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424103922] [2021-07-05 15:55:22,784 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 15:55:22,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 15:55:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 15:55:22,785 INFO L87 Difference]: Start difference. First operand 418 states and 1242 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-07-05 15:55:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:22,837 INFO L93 Difference]: Finished difference Result 492 states and 1469 transitions. [2021-07-05 15:55:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 15:55:22,838 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-07-05 15:55:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:22,840 INFO L225 Difference]: With dead ends: 492 [2021-07-05 15:55:22,840 INFO L226 Difference]: Without dead ends: 492 [2021-07-05 15:55:22,840 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-07-05 15:55:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 438. [2021-07-05 15:55:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.9588100686498855) internal successors, (1293), 437 states have internal predecessors, (1293), 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-07-05 15:55:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1293 transitions. [2021-07-05 15:55:22,849 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1293 transitions. Word has length 12 [2021-07-05 15:55:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:22,849 INFO L442 AbstractCegarLoop]: Abstraction has 438 states and 1293 transitions. [2021-07-05 15:55:22,849 INFO L443 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-07-05 15:55:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1293 transitions. [2021-07-05 15:55:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 15:55:22,850 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:22,850 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:22,850 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-05 15:55:22,850 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1104388887, now seen corresponding path program 1 times [2021-07-05 15:55:22,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:22,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934566329] [2021-07-05 15:55:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:22,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:22,934 INFO L142 QuantifierPusher]: treesize reduction 6, result has 94.5 percent of original size [2021-07-05 15:55:22,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-07-05 15:55:22,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 116 [2021-07-05 15:55:23,045 INFO L142 QuantifierPusher]: treesize reduction 29, result has 75.2 percent of original size [2021-07-05 15:55:23,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-07-05 15:55:23,093 INFO L142 QuantifierPusher]: treesize reduction 177, result has 29.5 percent of original size [2021-07-05 15:55:23,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-05 15:55:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:23,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:23,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934566329] [2021-07-05 15:55:23,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934566329] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:23,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:23,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:23,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975389567] [2021-07-05 15:55:23,123 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:23,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:23,124 INFO L87 Difference]: Start difference. First operand 438 states and 1293 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:23,231 INFO L93 Difference]: Finished difference Result 642 states and 1821 transitions. [2021-07-05 15:55:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 15:55:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:23,234 INFO L225 Difference]: With dead ends: 642 [2021-07-05 15:55:23,234 INFO L226 Difference]: Without dead ends: 578 [2021-07-05 15:55:23,235 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 211.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-07-05 15:55:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 524. [2021-07-05 15:55:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 2.9063097514340344) internal successors, (1520), 523 states have internal predecessors, (1520), 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-07-05 15:55:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1520 transitions. [2021-07-05 15:55:23,245 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1520 transitions. Word has length 12 [2021-07-05 15:55:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:23,245 INFO L442 AbstractCegarLoop]: Abstraction has 524 states and 1520 transitions. [2021-07-05 15:55:23,245 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1520 transitions. [2021-07-05 15:55:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 15:55:23,246 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:23,246 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:23,247 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-05 15:55:23,247 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1105583968, now seen corresponding path program 2 times [2021-07-05 15:55:23,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:23,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468544523] [2021-07-05 15:55:23,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:23,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:23,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-07-05 15:55:23,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 15:55:23,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 15:55:23,365 INFO L142 QuantifierPusher]: treesize reduction 31, result has 56.3 percent of original size [2021-07-05 15:55:23,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 15:55:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:23,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:23,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468544523] [2021-07-05 15:55:23,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468544523] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:23,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:23,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:23,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658836705] [2021-07-05 15:55:23,380 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:23,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:23,380 INFO L87 Difference]: Start difference. First operand 524 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:23,460 INFO L93 Difference]: Finished difference Result 628 states and 1836 transitions. [2021-07-05 15:55:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 15:55:23,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:23,463 INFO L225 Difference]: With dead ends: 628 [2021-07-05 15:55:23,463 INFO L226 Difference]: Without dead ends: 628 [2021-07-05 15:55:23,463 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-07-05 15:55:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 546. [2021-07-05 15:55:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.9394495412844037) internal successors, (1602), 545 states have internal predecessors, (1602), 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-07-05 15:55:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1602 transitions. [2021-07-05 15:55:23,473 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1602 transitions. Word has length 12 [2021-07-05 15:55:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:23,474 INFO L442 AbstractCegarLoop]: Abstraction has 546 states and 1602 transitions. [2021-07-05 15:55:23,474 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1602 transitions. [2021-07-05 15:55:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 15:55:23,475 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:23,475 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:23,475 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-05 15:55:23,475 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1922256760, now seen corresponding path program 3 times [2021-07-05 15:55:23,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:23,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868753715] [2021-07-05 15:55:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:23,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:23,525 INFO L142 QuantifierPusher]: treesize reduction 30, result has 60.0 percent of original size [2021-07-05 15:55:23,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-07-05 15:55:23,546 INFO L142 QuantifierPusher]: treesize reduction 30, result has 60.0 percent of original size [2021-07-05 15:55:23,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-07-05 15:55:23,548 INFO L142 QuantifierPusher]: treesize reduction 30, result has 63.4 percent of original size [2021-07-05 15:55:23,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-07-05 15:55:23,573 INFO L142 QuantifierPusher]: treesize reduction 30, result has 61.0 percent of original size [2021-07-05 15:55:23,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 15:55:23,597 INFO L142 QuantifierPusher]: treesize reduction 8, result has 85.5 percent of original size [2021-07-05 15:55:23,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 15:55:23,599 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.5 percent of original size [2021-07-05 15:55:23,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-07-05 15:55:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:23,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:23,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868753715] [2021-07-05 15:55:23,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868753715] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:23,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:23,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:23,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839748936] [2021-07-05 15:55:23,622 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:23,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:23,623 INFO L87 Difference]: Start difference. First operand 546 states and 1602 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:23,695 INFO L93 Difference]: Finished difference Result 571 states and 1664 transitions. [2021-07-05 15:55:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 15:55:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:23,698 INFO L225 Difference]: With dead ends: 571 [2021-07-05 15:55:23,698 INFO L226 Difference]: Without dead ends: 571 [2021-07-05 15:55:23,698 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-07-05 15:55:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 543. [2021-07-05 15:55:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.92619926199262) internal successors, (1586), 542 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-07-05 15:55:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1586 transitions. [2021-07-05 15:55:23,709 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1586 transitions. Word has length 12 [2021-07-05 15:55:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:23,709 INFO L442 AbstractCegarLoop]: Abstraction has 543 states and 1586 transitions. [2021-07-05 15:55:23,709 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-07-05 15:55:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1586 transitions. [2021-07-05 15:55:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-07-05 15:55:23,710 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:23,710 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:23,710 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 15:55:23,710 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash -838138415, now seen corresponding path program 2 times [2021-07-05 15:55:23,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:23,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739733887] [2021-07-05 15:55:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:23,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:23,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-07-05 15:55:23,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-07-05 15:55:23,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 15:55:23,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 15:55:23,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 15:55:23,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:23,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 15:55:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:23,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:23,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739733887] [2021-07-05 15:55:23,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739733887] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:23,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:23,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 15:55:23,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526576338] [2021-07-05 15:55:23,897 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 15:55:23,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 15:55:23,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:23,898 INFO L87 Difference]: Start difference. First operand 543 states and 1586 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-07-05 15:55:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,030 INFO L93 Difference]: Finished difference Result 757 states and 2129 transitions. [2021-07-05 15:55:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 15:55:24,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-07-05 15:55:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,033 INFO L225 Difference]: With dead ends: 757 [2021-07-05 15:55:24,033 INFO L226 Difference]: Without dead ends: 689 [2021-07-05 15:55:24,034 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 131.8ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-07-05 15:55:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-07-05 15:55:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 503. [2021-07-05 15:55:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 2.9163346613545817) internal successors, (1464), 502 states have internal predecessors, (1464), 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-07-05 15:55:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1464 transitions. [2021-07-05 15:55:24,043 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1464 transitions. Word has length 12 [2021-07-05 15:55:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,044 INFO L442 AbstractCegarLoop]: Abstraction has 503 states and 1464 transitions. [2021-07-05 15:55:24,044 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-07-05 15:55:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1464 transitions. [2021-07-05 15:55:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-07-05 15:55:24,045 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,045 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,045 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-05 15:55:24,045 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash 124135198, now seen corresponding path program 1 times [2021-07-05 15:55:24,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071526340] [2021-07-05 15:55:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 15:55:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071526340] [2021-07-05 15:55:24,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071526340] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 15:55:24,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420839552] [2021-07-05 15:55:24,091 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 15:55:24,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 15:55:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 15:55:24,092 INFO L87 Difference]: Start difference. First operand 503 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-07-05 15:55:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,111 INFO L93 Difference]: Finished difference Result 486 states and 1247 transitions. [2021-07-05 15:55:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 15:55:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-07-05 15:55:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,112 INFO L225 Difference]: With dead ends: 486 [2021-07-05 15:55:24,113 INFO L226 Difference]: Without dead ends: 356 [2021-07-05 15:55:24,113 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 15:55:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-07-05 15:55:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-07-05 15:55:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.4901408450704223) internal successors, (884), 355 states have internal predecessors, (884), 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-07-05 15:55:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 884 transitions. [2021-07-05 15:55:24,118 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 884 transitions. Word has length 13 [2021-07-05 15:55:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,119 INFO L442 AbstractCegarLoop]: Abstraction has 356 states and 884 transitions. [2021-07-05 15:55:24,119 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-07-05 15:55:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 884 transitions. [2021-07-05 15:55:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-07-05 15:55:24,120 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,120 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,120 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-05 15:55:24,120 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1596109497, now seen corresponding path program 1 times [2021-07-05 15:55:24,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044256157] [2021-07-05 15:55:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 15:55:24,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044256157] [2021-07-05 15:55:24,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044256157] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 15:55:24,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461811017] [2021-07-05 15:55:24,151 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 15:55:24,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 15:55:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 15:55:24,152 INFO L87 Difference]: Start difference. First operand 356 states and 884 transitions. Second operand has 3 states, 2 states have (on average 7.0) 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-07-05 15:55:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,161 INFO L93 Difference]: Finished difference Result 486 states and 1169 transitions. [2021-07-05 15:55:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 15:55:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) 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-07-05 15:55:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,163 INFO L225 Difference]: With dead ends: 486 [2021-07-05 15:55:24,163 INFO L226 Difference]: Without dead ends: 350 [2021-07-05 15:55:24,163 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 15:55:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-07-05 15:55:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2021-07-05 15:55:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.3605015673981193) internal successors, (753), 319 states have internal predecessors, (753), 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-07-05 15:55:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 753 transitions. [2021-07-05 15:55:24,168 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 753 transitions. Word has length 14 [2021-07-05 15:55:24,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,168 INFO L442 AbstractCegarLoop]: Abstraction has 320 states and 753 transitions. [2021-07-05 15:55:24,169 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 7.0) 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-07-05 15:55:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 753 transitions. [2021-07-05 15:55:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 15:55:24,169 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,169 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,169 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-05 15:55:24,170 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1368614598, now seen corresponding path program 1 times [2021-07-05 15:55:24,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298009509] [2021-07-05 15:55:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 15:55:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298009509] [2021-07-05 15:55:24,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298009509] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:24,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730602678] [2021-07-05 15:55:24,246 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 15:55:24,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 15:55:24,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 15:55:24,246 INFO L87 Difference]: Start difference. First operand 320 states and 753 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-07-05 15:55:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,271 INFO L93 Difference]: Finished difference Result 267 states and 580 transitions. [2021-07-05 15:55:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 15:55:24,271 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-07-05 15:55:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,272 INFO L225 Difference]: With dead ends: 267 [2021-07-05 15:55:24,272 INFO L226 Difference]: Without dead ends: 199 [2021-07-05 15:55:24,272 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-07-05 15:55:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2021-07-05 15:55:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.0773480662983426) internal successors, (376), 181 states have internal predecessors, (376), 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-07-05 15:55:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 376 transitions. [2021-07-05 15:55:24,276 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 376 transitions. Word has length 15 [2021-07-05 15:55:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,276 INFO L442 AbstractCegarLoop]: Abstraction has 182 states and 376 transitions. [2021-07-05 15:55:24,276 INFO L443 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-07-05 15:55:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 376 transitions. [2021-07-05 15:55:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-07-05 15:55:24,276 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,277 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,277 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-05 15:55:24,277 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash -935959981, now seen corresponding path program 1 times [2021-07-05 15:55:24,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136201966] [2021-07-05 15:55:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-07-05 15:55:24,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-07-05 15:55:24,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136201966] [2021-07-05 15:55:24,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136201966] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 15:55:24,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306614125] [2021-07-05 15:55:24,377 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 15:55:24,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 15:55:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 15:55:24,378 INFO L87 Difference]: Start difference. First operand 182 states and 376 transitions. Second operand has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,463 INFO L93 Difference]: Finished difference Result 276 states and 564 transitions. [2021-07-05 15:55:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 15:55:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,464 INFO L225 Difference]: With dead ends: 276 [2021-07-05 15:55:24,465 INFO L226 Difference]: Without dead ends: 206 [2021-07-05 15:55:24,465 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-07-05 15:55:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2021-07-05 15:55:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.0677083333333335) internal successors, (397), 192 states have internal predecessors, (397), 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-07-05 15:55:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 397 transitions. [2021-07-05 15:55:24,468 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 397 transitions. Word has length 17 [2021-07-05 15:55:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,468 INFO L442 AbstractCegarLoop]: Abstraction has 193 states and 397 transitions. [2021-07-05 15:55:24,468 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 397 transitions. [2021-07-05 15:55:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-07-05 15:55:24,468 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,468 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,468 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-05 15:55:24,469 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash -112330327, now seen corresponding path program 2 times [2021-07-05 15:55:24,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944024902] [2021-07-05 15:55:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-07-05 15:55:24,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-07-05 15:55:24,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944024902] [2021-07-05 15:55:24,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944024902] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 15:55:24,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265905500] [2021-07-05 15:55:24,566 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 15:55:24,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 15:55:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 15:55:24,567 INFO L87 Difference]: Start difference. First operand 193 states and 397 transitions. Second operand has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,645 INFO L93 Difference]: Finished difference Result 304 states and 625 transitions. [2021-07-05 15:55:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 15:55:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,647 INFO L225 Difference]: With dead ends: 304 [2021-07-05 15:55:24,647 INFO L226 Difference]: Without dead ends: 218 [2021-07-05 15:55:24,647 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-07-05 15:55:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 204. [2021-07-05 15:55:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0689655172413794) internal successors, (420), 203 states have internal predecessors, (420), 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-07-05 15:55:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 420 transitions. [2021-07-05 15:55:24,650 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 420 transitions. Word has length 17 [2021-07-05 15:55:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,650 INFO L442 AbstractCegarLoop]: Abstraction has 204 states and 420 transitions. [2021-07-05 15:55:24,650 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 4.25) 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-07-05 15:55:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 420 transitions. [2021-07-05 15:55:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-07-05 15:55:24,651 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,651 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,651 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 15:55:24,651 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1268721181, now seen corresponding path program 3 times [2021-07-05 15:55:24,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847178919] [2021-07-05 15:55:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 15:55:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847178919] [2021-07-05 15:55:24,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847178919] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 15:55:24,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802927550] [2021-07-05 15:55:24,722 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:24,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:24,723 INFO L87 Difference]: Start difference. First operand 204 states and 420 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-07-05 15:55:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,752 INFO L93 Difference]: Finished difference Result 186 states and 384 transitions. [2021-07-05 15:55:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 15:55:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-07-05 15:55:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,753 INFO L225 Difference]: With dead ends: 186 [2021-07-05 15:55:24,753 INFO L226 Difference]: Without dead ends: 83 [2021-07-05 15:55:24,753 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-07-05 15:55:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-07-05 15:55:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2021-07-05 15:55:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 72 states have internal predecessors, (131), 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-07-05 15:55:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 131 transitions. [2021-07-05 15:55:24,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 131 transitions. Word has length 17 [2021-07-05 15:55:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,755 INFO L442 AbstractCegarLoop]: Abstraction has 73 states and 131 transitions. [2021-07-05 15:55:24,755 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-07-05 15:55:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 131 transitions. [2021-07-05 15:55:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-07-05 15:55:24,756 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,756 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,756 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 15:55:24,756 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1433691792, now seen corresponding path program 1 times [2021-07-05 15:55:24,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:24,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615407507] [2021-07-05 15:55:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:24,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:24,853 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-07-05 15:55:24,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 15:55:24,859 INFO L142 QuantifierPusher]: treesize reduction 37, result has 41.3 percent of original size [2021-07-05 15:55:24,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 15:55:24,863 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.1 percent of original size [2021-07-05 15:55:24,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-05 15:55:24,880 INFO L142 QuantifierPusher]: treesize reduction 18, result has 77.5 percent of original size [2021-07-05 15:55:24,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-07-05 15:55:24,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:24,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:24,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:24,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615407507] [2021-07-05 15:55:24,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615407507] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:24,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:24,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:24,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407845167] [2021-07-05 15:55:24,906 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:24,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:24,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:24,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:24,907 INFO L87 Difference]: Start difference. First operand 73 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-07-05 15:55:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:24,994 INFO L93 Difference]: Finished difference Result 108 states and 192 transitions. [2021-07-05 15:55:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 15:55:24,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2021-07-05 15:55:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:24,996 INFO L225 Difference]: With dead ends: 108 [2021-07-05 15:55:24,996 INFO L226 Difference]: Without dead ends: 76 [2021-07-05 15:55:24,996 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 15:55:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-07-05 15:55:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2021-07-05 15:55:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 69 states have internal predecessors, (119), 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-07-05 15:55:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 119 transitions. [2021-07-05 15:55:24,998 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 119 transitions. Word has length 20 [2021-07-05 15:55:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:24,998 INFO L442 AbstractCegarLoop]: Abstraction has 70 states and 119 transitions. [2021-07-05 15:55:24,998 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-07-05 15:55:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 119 transitions. [2021-07-05 15:55:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-07-05 15:55:24,999 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:24,999 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:24,999 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 15:55:24,999 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash -256941220, now seen corresponding path program 2 times [2021-07-05 15:55:25,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:25,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478322555] [2021-07-05 15:55:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:25,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 15:55:25,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:25,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 15:55:25,096 INFO L142 QuantifierPusher]: treesize reduction 22, result has 72.2 percent of original size [2021-07-05 15:55:25,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-07-05 15:55:25,101 INFO L142 QuantifierPusher]: treesize reduction 22, result has 74.4 percent of original size [2021-07-05 15:55:25,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-05 15:55:25,135 INFO L142 QuantifierPusher]: treesize reduction 36, result has 64.4 percent of original size [2021-07-05 15:55:25,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-07-05 15:55:25,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 15:55:25,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 15:55:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 15:55:25,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 15:55:25,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478322555] [2021-07-05 15:55:25,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478322555] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 15:55:25,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 15:55:25,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 15:55:25,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250336349] [2021-07-05 15:55:25,167 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 15:55:25,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 15:55:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 15:55:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 15:55:25,168 INFO L87 Difference]: Start difference. First operand 70 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-07-05 15:55:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 15:55:25,262 INFO L93 Difference]: Finished difference Result 111 states and 193 transitions. [2021-07-05 15:55:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 15:55:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2021-07-05 15:55:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 15:55:25,263 INFO L225 Difference]: With dead ends: 111 [2021-07-05 15:55:25,263 INFO L226 Difference]: Without dead ends: 73 [2021-07-05 15:55:25,263 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 102.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 15:55:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-07-05 15:55:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-07-05 15:55:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6666666666666667) internal successors, (110), 66 states have internal predecessors, (110), 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-07-05 15:55:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 110 transitions. [2021-07-05 15:55:25,265 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 110 transitions. Word has length 20 [2021-07-05 15:55:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 15:55:25,265 INFO L442 AbstractCegarLoop]: Abstraction has 67 states and 110 transitions. [2021-07-05 15:55:25,265 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-07-05 15:55:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 110 transitions. [2021-07-05 15:55:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-07-05 15:55:25,265 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 15:55:25,265 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 15:55:25,266 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-05 15:55:25,266 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 15:55:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 15:55:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1331555280, now seen corresponding path program 3 times [2021-07-05 15:55:25,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 15:55:25,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829462600] [2021-07-05 15:55:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 15:55:25,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 15:55:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 15:55:25,328 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 15:55:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 15:55:25,394 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 15:55:25,418 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-05 15:55:25,419 INFO L639 BasicCegarLoop]: Counterexample is feasible [2021-07-05 15:55:25,420 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-05 15:55:25,421 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 15:55:25,422 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/4) [2021-07-05 15:55:25,424 INFO L224 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-05 15:55:25,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 03:55:25 BasicIcfg [2021-07-05 15:55:25,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 15:55:25,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 15:55:25,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 15:55:25,481 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 15:55:25,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 03:54:54" (3/4) ... [2021-07-05 15:55:25,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-07-05 15:55:25,544 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 15:55:25,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 15:55:25,545 INFO L168 Benchmark]: Toolchain (without parser) took 34317.52 ms. Allocated memory was 62.9 MB in the beginning and 685.8 MB in the end (delta: 622.9 MB). Free memory was 43.7 MB in the beginning and 381.4 MB in the end (delta: -337.7 MB). Peak memory consumption was 283.3 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,545 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory is still 44.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 15:55:25,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 519.16 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 43.5 MB in the beginning and 63.4 MB in the end (delta: -20.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.74 ms. Allocated memory is still 88.1 MB. Free memory was 63.4 MB in the beginning and 60.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,546 INFO L168 Benchmark]: Boogie Preprocessor took 60.56 ms. Allocated memory is still 88.1 MB. Free memory was 60.4 MB in the beginning and 57.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,546 INFO L168 Benchmark]: RCFGBuilder took 2226.40 ms. Allocated memory was 88.1 MB in the beginning and 169.9 MB in the end (delta: 81.8 MB). Free memory was 57.3 MB in the beginning and 123.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,546 INFO L168 Benchmark]: TraceAbstraction took 31369.61 ms. Allocated memory was 169.9 MB in the beginning and 685.8 MB in the end (delta: 515.9 MB). Free memory was 122.3 MB in the beginning and 405.5 MB in the end (delta: -283.2 MB). Peak memory consumption was 232.7 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,546 INFO L168 Benchmark]: Witness Printer took 63.85 ms. Allocated memory is still 685.8 MB. Free memory was 405.5 MB in the beginning and 381.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-07-05 15:55:25,547 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.14 ms. Allocated memory is still 62.9 MB. Free memory is still 44.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 519.16 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 43.5 MB in the beginning and 63.4 MB in the end (delta: -20.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.74 ms. Allocated memory is still 88.1 MB. Free memory was 63.4 MB in the beginning and 60.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.56 ms. Allocated memory is still 88.1 MB. Free memory was 60.4 MB in the beginning and 57.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2226.40 ms. Allocated memory was 88.1 MB in the beginning and 169.9 MB in the end (delta: 81.8 MB). Free memory was 57.3 MB in the beginning and 123.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31369.61 ms. Allocated memory was 169.9 MB in the beginning and 685.8 MB in the end (delta: 515.9 MB). Free memory was 122.3 MB in the beginning and 405.5 MB in the end (delta: -283.2 MB). Peak memory consumption was 232.7 MB. Max. memory is 16.1 GB. * Witness Printer took 63.85 ms. Allocated memory is still 685.8 MB. Free memory was 405.5 MB in the beginning and 381.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27394.8ms, 130 PlacesBefore, 34 PlacesAfterwards, 122 TransitionsBefore, 25 TransitionsAfterwards, 1652 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 4086 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1907, positive: 1719, positive conditional: 0, positive unconditional: 1719, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1216, positive: 1162, positive conditional: 0, positive unconditional: 1162, 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: 1216, positive: 1129, positive conditional: 0, positive unconditional: 1129, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5115, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 1123, negative conditional: 0, negative unconditional: 1123, unknown: 3923, unknown conditional: 0, unknown unconditional: 3923] ], Cache Queries: [ total: 1907, positive: 557, positive conditional: 0, positive unconditional: 557, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 1216, unknown conditional: 0, unknown unconditional: 1216] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2136; [L853] FCALL, FORK 0 pthread_create(&t2136, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t2137; [L855] FCALL, FORK 0 pthread_create(&t2137, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2138; [L857] FCALL, FORK 0 pthread_create(&t2138, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L875] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L877] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L879] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=255, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 147 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 31188.2ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 18.8ms, AutomataDifference: 1079.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27434.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 340 SDtfs, 333 SDslu, 476 SDs, 0 SdLazy, 504 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 605.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1042.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 149.4ms AutomataMinimizationTime, 16 MinimizatonAttempts, 500 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.3ms SsaConstructionTime, 636.7ms SatisfiabilityAnalysisTime, 1506.4ms InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 3229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-07-05 15:55:25,623 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...