./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 7b2dab56
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC --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 1c18da5ad493754a172557e27871b31901512968
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.0-7b2dab5
[2021-10-11 00:33:42,247 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:33:42,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:33:42,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:33:42,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:33:42,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:33:42,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:33:42,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:33:42,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:33:42,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:33:42,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:33:42,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:33:42,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:33:42,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:33:42,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:33:42,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:33:42,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:33:42,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:33:42,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:33:42,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:33:42,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:33:42,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:33:42,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:33:42,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:33:42,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:33:42,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:33:42,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:33:42,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:33:42,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:33:42,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:33:42,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:33:42,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:33:42,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:33:42,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:33:42,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:33:42,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:33:42,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:33:42,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:33:42,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:33:42,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:33:42,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:33:42,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:33:42,368 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:33:42,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:33:42,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:33:42,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:33:42,374 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:33:42,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:33:42,375 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:33:42,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:33:42,375 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:33:42,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:33:42,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:33:42,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:33:42,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:33:42,378 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:33:42,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:33:42,378 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:33:42,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:33:42,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:33:42,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:33:42,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:33:42,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:33:42,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:33:42,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:33:42,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:33:42,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:33:42,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:33:42,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:33:42,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:33:42,381 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC
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 -> 1c18da5ad493754a172557e27871b31901512968
[2021-10-11 00:33:42,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:33:42,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:33:42,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:33:42,709 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:33:42,710 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:33:42,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i
[2021-10-11 00:33:42,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/data/e919a6037/ccee90864cde440193080981b8f74f69/FLAG938b642bd
[2021-10-11 00:33:43,379 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:33:43,380 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i
[2021-10-11 00:33:43,403 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/data/e919a6037/ccee90864cde440193080981b8f74f69/FLAG938b642bd
[2021-10-11 00:33:43,655 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/data/e919a6037/ccee90864cde440193080981b8f74f69
[2021-10-11 00:33:43,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:33:43,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:33:43,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:43,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:33:43,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:33:43,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:43" (1/1) ...
[2021-10-11 00:33:43,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab6394a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:43, skipping insertion in model container
[2021-10-11 00:33:43,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:43" (1/1) ...
[2021-10-11 00:33:43,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:33:43,727 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:33:43,924 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i[992,1005]
[2021-10-11 00:33:44,124 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:44,141 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:33:44,160 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i[992,1005]
[2021-10-11 00:33:44,223 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:44,300 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:33:44,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44 WrapperNode
[2021-10-11 00:33:44,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:44,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:44,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:33:44,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:33:44,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:44,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:33:44,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:33:44,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:33:44,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
[2021-10-11 00:33:44,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:33:44,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:33:44,418 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:33:44,418 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:33:44,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:33:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:33:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:33:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:33:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:33:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:33:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:33:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:33:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:33:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:33:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:33:44,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:33:44,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:33:44,496 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-10-11 00:33:46,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:33:46,188 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:33:46,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:46 BoogieIcfgContainer
[2021-10-11 00:33:46,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:33:46,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:33:46,195 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:33:46,200 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:33:46,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:33:43" (1/3) ...
[2021-10-11 00:33:46,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782fea6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:46, skipping insertion in model container
[2021-10-11 00:33:46,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:44" (2/3) ...
[2021-10-11 00:33:46,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782fea6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:46, skipping insertion in model container
[2021-10-11 00:33:46,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:46" (3/3) ...
[2021-10-11 00:33:46,205 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i
[2021-10-11 00:33:46,224 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:33:46,224 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:33:46,228 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:33:46,229 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:33:46,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,345 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:33:46,350 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:33:46,362 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-10-11 00:33:46,394 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:33:46,394 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:33:46,394 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:33:46,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:33:46,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:33:46,394 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:33:46,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:33:46,396 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:33:46,414 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:33:46,417 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 83 transitions, 176 flow
[2021-10-11 00:33:46,420 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 83 transitions, 176 flow
[2021-10-11 00:33:46,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow
[2021-10-11 00:33:46,485 INFO L129 PetriNetUnfolder]: 2/81 cut-off events.
[2021-10-11 00:33:46,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:33:46,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place.
[2021-10-11 00:33:46,499 INFO L116 LiptonReduction]: Number of co-enabled transitions 968
[2021-10-11 00:33:46,969 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:33:47,126 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 57
[2021-10-11 00:33:47,628 WARN L197 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84
[2021-10-11 00:33:47,850 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:33:48,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:48,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:48,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,199 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,321 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:33:48,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:33:48,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:48,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:48,538 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,543 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:48,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:48,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:48,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:48,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:33:48,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,324 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,326 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:49,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:49,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:49,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:50,128 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2021-10-11 00:33:50,362 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2021-10-11 00:33:50,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:33:50,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:50,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term
[2021-10-11 00:33:50,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:50,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:33:50,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:51,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:51,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,077 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:33:51,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:33:51,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:51,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:51,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:51,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:51,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:51,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:33:51,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:33:51,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:51,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:33:51,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:33:51,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:52,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:52,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:52,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:52,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:52,189 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:33:52,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:33:52,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:52,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:33:52,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:33:53,091 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68
[2021-10-11 00:33:53,320 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68
[2021-10-11 00:33:53,814 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110
[2021-10-11 00:33:54,003 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-10-11 00:33:54,385 WARN L197 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110
[2021-10-11 00:33:54,540 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2021-10-11 00:33:54,547 INFO L131 LiptonReduction]: Checked pairs total: 2594
[2021-10-11 00:33:54,547 INFO L133 LiptonReduction]: Total number of compositions: 72
[2021-10-11 00:33:54,562 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow
[2021-10-11 00:33:54,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 202 states.
[2021-10-11 00:33:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states.
[2021-10-11 00:33:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2021-10-11 00:33:54,590 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:54,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2021-10-11 00:33:54,592 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:54,598 INFO L82 PathProgramCache]: Analyzing trace with hash 798496338, now seen corresponding path program 1 times
[2021-10-11 00:33:54,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:54,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041999601]
[2021-10-11 00:33:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:54,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041999601]
[2021-10-11 00:33:54,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:54,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:33:54,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355868058]
[2021-10-11 00:33:54,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:33:54,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:33:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:33:54,986 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 3 states.
[2021-10-11 00:33:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:55,051 INFO L93 Difference]: Finished difference Result 178 states and 426 transitions.
[2021-10-11 00:33:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:33:55,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2021-10-11 00:33:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:55,070 INFO L225 Difference]: With dead ends: 178
[2021-10-11 00:33:55,071 INFO L226 Difference]: Without dead ends: 150
[2021-10-11 00:33:55,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:33:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2021-10-11 00:33:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2021-10-11 00:33:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states.
[2021-10-11 00:33:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 353 transitions.
[2021-10-11 00:33:55,150 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 353 transitions. Word has length 5
[2021-10-11 00:33:55,151 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:55,151 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 353 transitions.
[2021-10-11 00:33:55,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:33:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 353 transitions.
[2021-10-11 00:33:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2021-10-11 00:33:55,152 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:55,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:55,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:33:55,153 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1817752541, now seen corresponding path program 1 times
[2021-10-11 00:33:55,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:55,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590533036]
[2021-10-11 00:33:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:55,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590533036]
[2021-10-11 00:33:55,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:55,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:33:55,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786495505]
[2021-10-11 00:33:55,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:33:55,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:33:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:33:55,350 INFO L87 Difference]: Start difference. First operand 150 states and 353 transitions. Second operand 4 states.
[2021-10-11 00:33:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:55,443 INFO L93 Difference]: Finished difference Result 254 states and 557 transitions.
[2021-10-11 00:33:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:33:55,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2021-10-11 00:33:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:55,447 INFO L225 Difference]: With dead ends: 254
[2021-10-11 00:33:55,447 INFO L226 Difference]: Without dead ends: 181
[2021-10-11 00:33:55,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2021-10-11 00:33:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151.
[2021-10-11 00:33:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states.
[2021-10-11 00:33:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 332 transitions.
[2021-10-11 00:33:55,460 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 332 transitions. Word has length 8
[2021-10-11 00:33:55,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:55,460 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 332 transitions.
[2021-10-11 00:33:55,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:33:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 332 transitions.
[2021-10-11 00:33:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:33:55,461 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:55,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:55,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:33:55,462 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 440933651, now seen corresponding path program 1 times
[2021-10-11 00:33:55,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:55,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922141903]
[2021-10-11 00:33:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:55,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922141903]
[2021-10-11 00:33:55,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:55,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:33:55,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045819725]
[2021-10-11 00:33:55,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:33:55,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:33:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:55,565 INFO L87 Difference]: Start difference. First operand 151 states and 332 transitions. Second operand 5 states.
[2021-10-11 00:33:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:55,652 INFO L93 Difference]: Finished difference Result 180 states and 368 transitions.
[2021-10-11 00:33:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:33:55,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9
[2021-10-11 00:33:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:55,654 INFO L225 Difference]: With dead ends: 180
[2021-10-11 00:33:55,654 INFO L226 Difference]: Without dead ends: 129
[2021-10-11 00:33:55,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:33:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2021-10-11 00:33:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108.
[2021-10-11 00:33:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2021-10-11 00:33:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 232 transitions.
[2021-10-11 00:33:55,662 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 232 transitions. Word has length 9
[2021-10-11 00:33:55,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:55,663 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 232 transitions.
[2021-10-11 00:33:55,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:33:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 232 transitions.
[2021-10-11 00:33:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-10-11 00:33:55,664 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:55,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:55,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:33:55,665 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:55,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash -783695991, now seen corresponding path program 1 times
[2021-10-11 00:33:55,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:55,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955356583]
[2021-10-11 00:33:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:55,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955356583]
[2021-10-11 00:33:55,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:55,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:33:55,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726478817]
[2021-10-11 00:33:55,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:33:55,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:33:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:33:55,777 INFO L87 Difference]: Start difference. First operand 108 states and 232 transitions. Second operand 4 states.
[2021-10-11 00:33:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:55,796 INFO L93 Difference]: Finished difference Result 114 states and 236 transitions.
[2021-10-11 00:33:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:33:55,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2021-10-11 00:33:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:55,797 INFO L225 Difference]: With dead ends: 114
[2021-10-11 00:33:55,798 INFO L226 Difference]: Without dead ends: 96
[2021-10-11 00:33:55,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2021-10-11 00:33:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93.
[2021-10-11 00:33:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2021-10-11 00:33:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 198 transitions.
[2021-10-11 00:33:55,804 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 198 transitions. Word has length 12
[2021-10-11 00:33:55,804 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:55,804 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 198 transitions.
[2021-10-11 00:33:55,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:33:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 198 transitions.
[2021-10-11 00:33:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:33:55,806 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:55,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:55,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:33:55,807 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1473984954, now seen corresponding path program 1 times
[2021-10-11 00:33:55,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:55,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952927741]
[2021-10-11 00:33:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:55,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952927741]
[2021-10-11 00:33:55,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:55,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:33:55,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574109447]
[2021-10-11 00:33:55,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:33:55,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:33:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:33:55,894 INFO L87 Difference]: Start difference. First operand 93 states and 198 transitions. Second operand 4 states.
[2021-10-11 00:33:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:55,924 INFO L93 Difference]: Finished difference Result 76 states and 136 transitions.
[2021-10-11 00:33:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:33:55,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2021-10-11 00:33:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:55,926 INFO L225 Difference]: With dead ends: 76
[2021-10-11 00:33:55,926 INFO L226 Difference]: Without dead ends: 53
[2021-10-11 00:33:55,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2021-10-11 00:33:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2021-10-11 00:33:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2021-10-11 00:33:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions.
[2021-10-11 00:33:55,934 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 13
[2021-10-11 00:33:55,934 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:55,934 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions.
[2021-10-11 00:33:55,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:33:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions.
[2021-10-11 00:33:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:33:55,938 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:55,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:55,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:33:55,939 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1079499733, now seen corresponding path program 1 times
[2021-10-11 00:33:55,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:55,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170799688]
[2021-10-11 00:33:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:56,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170799688]
[2021-10-11 00:33:56,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:56,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:33:56,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904568649]
[2021-10-11 00:33:56,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:33:56,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:33:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:56,124 INFO L87 Difference]: Start difference. First operand 53 states and 86 transitions. Second operand 5 states.
[2021-10-11 00:33:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:56,170 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions.
[2021-10-11 00:33:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:33:56,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-10-11 00:33:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:56,171 INFO L225 Difference]: With dead ends: 79
[2021-10-11 00:33:56,171 INFO L226 Difference]: Without dead ends: 50
[2021-10-11 00:33:56,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:33:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2021-10-11 00:33:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49.
[2021-10-11 00:33:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2021-10-11 00:33:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions.
[2021-10-11 00:33:56,174 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 15
[2021-10-11 00:33:56,175 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:56,175 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions.
[2021-10-11 00:33:56,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:33:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions.
[2021-10-11 00:33:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:33:56,176 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:56,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:56,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:33:56,176 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 213783387, now seen corresponding path program 2 times
[2021-10-11 00:33:56,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:56,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149980610]
[2021-10-11 00:33:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:56,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149980610]
[2021-10-11 00:33:56,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:56,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:33:56,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267990118]
[2021-10-11 00:33:56,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:33:56,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:56,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:33:56,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:33:56,337 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand 6 states.
[2021-10-11 00:33:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:56,420 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions.
[2021-10-11 00:33:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:33:56,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2021-10-11 00:33:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:56,422 INFO L225 Difference]: With dead ends: 68
[2021-10-11 00:33:56,422 INFO L226 Difference]: Without dead ends: 42
[2021-10-11 00:33:56,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2021-10-11 00:33:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2021-10-11 00:33:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2021-10-11 00:33:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2021-10-11 00:33:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions.
[2021-10-11 00:33:56,433 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 15
[2021-10-11 00:33:56,433 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:56,434 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions.
[2021-10-11 00:33:56,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:33:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions.
[2021-10-11 00:33:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:33:56,436 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:56,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:56,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:33:56,437 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1706784903, now seen corresponding path program 3 times
[2021-10-11 00:33:56,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:56,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882301113]
[2021-10-11 00:33:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:33:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:33:56,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882301113]
[2021-10-11 00:33:56,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:33:56,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:33:56,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530546904]
[2021-10-11 00:33:56,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:33:56,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:33:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:33:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:33:56,581 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. Second operand 5 states.
[2021-10-11 00:33:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:33:56,618 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions.
[2021-10-11 00:33:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:33:56,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-10-11 00:33:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:33:56,620 INFO L225 Difference]: With dead ends: 30
[2021-10-11 00:33:56,620 INFO L226 Difference]: Without dead ends: 24
[2021-10-11 00:33:56,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:33:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2021-10-11 00:33:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2021-10-11 00:33:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2021-10-11 00:33:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions.
[2021-10-11 00:33:56,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15
[2021-10-11 00:33:56,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:33:56,622 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions.
[2021-10-11 00:33:56,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:33:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions.
[2021-10-11 00:33:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:33:56,623 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:33:56,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:33:56,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:33:56,623 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:33:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:33:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2109025463, now seen corresponding path program 1 times
[2021-10-11 00:33:56,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:33:56,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66778202]
[2021-10-11 00:33:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:33:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:33:56,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:33:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:33:56,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:33:56,816 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:33:56,816 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:33:56,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:33:56,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:33:56 BasicIcfg
[2021-10-11 00:33:56,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:33:56,880 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:33:56,881 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:33:56,881 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:33:56,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:46" (3/4) ...
[2021-10-11 00:33:56,883 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:33:56,983 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_645dbf40-0086-459f-aff5-777e49ede4a3/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:33:56,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:33:56,984 INFO L168 Benchmark]: Toolchain (without parser) took 13324.67 ms. Allocated memory was 113.2 MB in the beginning and 274.7 MB in the end (delta: 161.5 MB). Free memory was 81.4 MB in the beginning and 97.3 MB in the end (delta: -16.0 MB). Peak memory consumption was 144.0 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,984 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 77.6 MB. Free memory is still 38.9 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.34 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 66.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.48 ms. Allocated memory is still 113.2 MB. Free memory was 66.9 MB in the beginning and 64.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,985 INFO L168 Benchmark]: Boogie Preprocessor took 53.36 ms. Allocated memory is still 113.2 MB. Free memory was 64.5 MB in the beginning and 62.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,986 INFO L168 Benchmark]: RCFGBuilder took 1773.72 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 62.4 MB in the beginning and 52.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,986 INFO L168 Benchmark]: TraceAbstraction took 10684.98 ms. Allocated memory was 136.3 MB in the beginning and 274.7 MB in the end (delta: 138.4 MB). Free memory was 52.2 MB in the beginning and 107.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 82.8 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,986 INFO L168 Benchmark]: Witness Printer took 102.76 ms. Allocated memory is still 274.7 MB. Free memory was 107.8 MB in the beginning and 97.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:33:56,988 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.57 ms. Allocated memory is still 77.6 MB. Free memory is still 38.9 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 640.34 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 66.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 58.48 ms. Allocated memory is still 113.2 MB. Free memory was 66.9 MB in the beginning and 64.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 53.36 ms. Allocated memory is still 113.2 MB. Free memory was 64.5 MB in the beginning and 62.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 1773.72 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 62.4 MB in the beginning and 52.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 10684.98 ms. Allocated memory was 136.3 MB in the beginning and 274.7 MB in the end (delta: 138.4 MB). Free memory was 52.2 MB in the beginning and 107.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 82.8 MB. Max. memory is 16.1 GB.
* Witness Printer took 102.76 ms. Allocated memory is still 274.7 MB. Free memory was 107.8 MB in the beginning and 97.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
650 VarBasedMoverChecksPositive, 53 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 63 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 88 PlacesBefore, 28 PlacesAfterwards, 83 TransitionsBefore, 22 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 2594 MoverChecksTotal
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L720] 0 _Bool x$flush_delayed;
[L721] 0 int x$mem_tmp;
[L722] 0 _Bool x$r_buff0_thd0;
[L723] 0 _Bool x$r_buff0_thd1;
[L724] 0 _Bool x$r_buff0_thd2;
[L725] 0 _Bool x$r_buff1_thd0;
[L726] 0 _Bool x$r_buff1_thd1;
[L727] 0 _Bool x$r_buff1_thd2;
[L728] 0 _Bool x$read_delayed;
[L729] 0 int *x$read_delayed_var;
[L730] 0 int x$w_buff0;
[L731] 0 _Bool x$w_buff0_used;
[L732] 0 int x$w_buff1;
[L733] 0 _Bool x$w_buff1_used;
[L735] 0 int y = 0;
[L736] 0 _Bool weak$$choice0;
[L737] 0 _Bool weak$$choice2;
[L813] 0 pthread_t t1641;
[L814] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L815] 0 pthread_t t1642;
[L816] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L771] 2 x$w_buff1 = x$w_buff0
[L772] 2 x$w_buff0 = 1
[L773] 2 x$w_buff1_used = x$w_buff0_used
[L774] 2 x$w_buff0_used = (_Bool)1
[L19] COND FALSE 2 !(!expression)
[L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L779] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L782] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L785] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L788] 2 __unbuffered_p1_EBX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L741] 1 y = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L746] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L747] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L748] 1 x$flush_delayed = weak$$choice2
[L749] 1 x$mem_tmp = x
[L750] 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)
[L750] 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)
[L751] 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))
[L751] 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))
[L752] 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))
[L752] 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))
[L753] 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))
[L753] 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))
[L754] 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))
[L754] 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))
[L755] 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))
[L755] 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))
[L756] 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))
[L756] 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))
[L757] 1 __unbuffered_p0_EAX = x
[L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L758] 1 x = x$flush_delayed ? x$mem_tmp : x
[L759] 1 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L791] 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)
[L791] 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)
[L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L793] 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
[L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L795] 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
[L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L800] 2 return 0;
[L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L766] 1 return 0;
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2
[L4] COND FALSE 0 !(!cond)
[L822] 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)
[L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L822] 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)
[L822] 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)
[L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L824] 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
[L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L826] 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
[L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1)
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 162 SDtfs, 149 SDslu, 232 SDs, 0 SdLazy, 119 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 55 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 5912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...