/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 16:35:21,435 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-01 16:35:21,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 16:35:21,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 16:35:21,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 16:35:21,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 16:35:21,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 16:35:21,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 16:35:21,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 16:35:21,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 16:35:21,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 16:35:21,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 16:35:21,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 16:35:21,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 16:35:21,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 16:35:21,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 16:35:21,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 16:35:21,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 16:35:21,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 16:35:21,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 16:35:21,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 16:35:21,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 16:35:21,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 16:35:21,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 16:35:21,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 16:35:21,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 16:35:21,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 16:35:21,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 16:35:21,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 16:35:21,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 16:35:21,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 16:35:21,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 16:35:21,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 16:35:21,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 16:35:21,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 16:35:21,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 16:35:21,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 16:35:21,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 16:35:21,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 16:35:21,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 16:35:21,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 16:35:21,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2021-06-01 16:35:21,568 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-01 16:35:21,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 16:35:21,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 16:35:21,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 16:35:21,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 16:35:21,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-01 16:35:21,572 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-01 16:35:21,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 16:35:21,572 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-01 16:35:21,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-01 16:35:21,573 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-01 16:35:21,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-01 16:35:21,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-01 16:35:21,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 16:35:21,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-01 16:35:21,575 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-01 16:35:21,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-01 16:35:21,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:35:21,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 16:35:21,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-01 16:35:21,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 16:35:21,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 16:35:21,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 16:35:21,961 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-01 16:35:21,962 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-01 16:35:21,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i
[2021-06-01 16:35:22,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582ddf9f/500d67b8ff3042ec9f4c7d111d02ee38/FLAG054c3ff93
[2021-06-01 16:35:22,553 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-01 16:35:22,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i
[2021-06-01 16:35:22,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582ddf9f/500d67b8ff3042ec9f4c7d111d02ee38/FLAG054c3ff93
[2021-06-01 16:35:23,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9582ddf9f/500d67b8ff3042ec9f4c7d111d02ee38
[2021-06-01 16:35:23,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 16:35:23,010 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 16:35:23,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 16:35:23,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 16:35:23,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 16:35:23,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f776d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23, skipping insertion in model container
[2021-06-01 16:35:23,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-01 16:35:23,078 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-01 16:35:23,243 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962]
[2021-06-01 16:35:23,469 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:35:23,476 INFO L203 MainTranslator]: Completed pre-run
[2021-06-01 16:35:23,489 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962]
[2021-06-01 16:35:23,543 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:35:23,619 INFO L208 MainTranslator]: Completed translation
[2021-06-01 16:35:23,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23 WrapperNode
[2021-06-01 16:35:23,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 16:35:23,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 16:35:23,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 16:35:23,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 16:35:23,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 16:35:23,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 16:35:23,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 16:35:23,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 16:35:23,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
[2021-06-01 16:35:23,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 16:35:23,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 16:35:23,756 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 16:35:23,756 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-01 16:35:23,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:35:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 16:35:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 16:35:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 16:35:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 16:35:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 16:35:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 16:35:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 16:35:23,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 16:35:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 16:35:23,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 16:35:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 16:35:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 16:35:23,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 16:35:23,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 16:35:23,838 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 16:35:25,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 16:35:25,563 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 16:35:25,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:35:25 BoogieIcfgContainer
[2021-06-01 16:35:25,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 16:35:25,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 16:35:25,568 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 16:35:25,570 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-01 16:35:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:35:23" (1/3) ...
[2021-06-01 16:35:25,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3fb640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:35:25, skipping insertion in model container
[2021-06-01 16:35:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:35:23" (2/3) ...
[2021-06-01 16:35:25,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3fb640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:35:25, skipping insertion in model container
[2021-06-01 16:35:25,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:35:25" (3/3) ...
[2021-06-01 16:35:25,573 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i
[2021-06-01 16:35:25,581 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 16:35:25,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 16:35:25,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 16:35:25,582 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,616 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,617 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,618 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,618 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,623 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,624 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:35:25,646 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 16:35:25,667 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:35:25,692 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:25,695 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:25,695 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:25,695 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:25,695 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:25,696 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:25,696 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:25,696 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0========
[2021-06-01 16:35:25,709 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow
[2021-06-01 16:35:26,577 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2021-06-01 16:35:26,661 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:26,663 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:26,663 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1699461236, now seen corresponding path program 1 times
[2021-06-01 16:35:26,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:26,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472916013]
[2021-06-01 16:35:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:26,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:26,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472916013]
[2021-06-01 16:35:26,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472916013] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:26,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:26,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 16:35:26,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310703365]
[2021-06-01 16:35:26,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:35:26,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:35:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:35:26,953 INFO L87 Difference]: Start difference. First operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:27,217 INFO L93 Difference]: Finished difference Result 12127 states and 42768 transitions.
[2021-06-01 16:35:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-01 16:35:27,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54
[2021-06-01 16:35:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:27,251 INFO L225 Difference]: With dead ends: 12127
[2021-06-01 16:35:27,252 INFO L226 Difference]: Without dead ends: 0
[2021-06-01 16:35:27,253 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:35:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 16:35:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 16:35:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 16:35:27,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54
[2021-06-01 16:35:27,273 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:27,273 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 16:35:27,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 16:35:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:35:27,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 16:35:27,274 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/3)
[2021-06-01 16:35:27,276 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:35:27,279 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:27,280 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:27,280 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:27,280 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:27,280 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:27,280 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:27,280 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:27,280 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2========
[2021-06-01 16:35:27,282 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow
[2021-06-01 16:35:27,806 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:27,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:35:27,893 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (2/3)
[2021-06-01 16:35:27,894 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-06-01 16:35:27,895 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:35:27,895 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 16:35:27,895 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:35:27,895 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:35:27,895 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:35:27,895 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 16:35:27,895 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:35:27,895 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 16:35:27,897 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 104 transitions, 223 flow
[2021-06-01 16:35:28,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2021-06-01 16:35:28,492 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:28,493 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:28,493 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1498850709, now seen corresponding path program 1 times
[2021-06-01 16:35:28,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:28,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624627777]
[2021-06-01 16:35:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:28,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:28,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624627777]
[2021-06-01 16:35:28,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624627777] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:28,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:28,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:28,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451519479]
[2021-06-01 16:35:28,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:28,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:28,808 INFO L87 Difference]: Start difference. First operand has 14087 states, 14083 states have (on average 3.6198963289071933) internal successors, (50979), 14086 states have internal predecessors, (50979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:29,100 INFO L93 Difference]: Finished difference Result 19775 states and 69886 transitions.
[2021-06-01 16:35:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:35:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2021-06-01 16:35:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:29,168 INFO L225 Difference]: With dead ends: 19775
[2021-06-01 16:35:29,168 INFO L226 Difference]: Without dead ends: 7715
[2021-06-01 16:35:29,168 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states.
[2021-06-01 16:35:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7715.
[2021-06-01 16:35:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7715 states, 7713 states have (on average 3.4760793465577597) internal successors, (26811), 7714 states have internal predecessors, (26811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 26811 transitions.
[2021-06-01 16:35:29,555 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 26811 transitions. Word has length 66
[2021-06-01 16:35:29,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:29,556 INFO L482 AbstractCegarLoop]: Abstraction has 7715 states and 26811 transitions.
[2021-06-01 16:35:29,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 26811 transitions.
[2021-06-01 16:35:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2021-06-01 16:35:29,570 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:29,570 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:29,571 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 16:35:29,571 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1135028906, now seen corresponding path program 1 times
[2021-06-01 16:35:29,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:29,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374321404]
[2021-06-01 16:35:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:29,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:29,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374321404]
[2021-06-01 16:35:29,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374321404] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:29,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:29,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:29,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721084922]
[2021-06-01 16:35:29,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:29,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:29,715 INFO L87 Difference]: Start difference. First operand 7715 states and 26811 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:29,910 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 16
[2021-06-01 16:35:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:30,029 INFO L93 Difference]: Finished difference Result 8939 states and 30789 transitions.
[2021-06-01 16:35:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:35:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2021-06-01 16:35:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:30,090 INFO L225 Difference]: With dead ends: 8939
[2021-06-01 16:35:30,090 INFO L226 Difference]: Without dead ends: 7427
[2021-06-01 16:35:30,092 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 228.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7427 states.
[2021-06-01 16:35:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7427 to 7427.
[2021-06-01 16:35:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7425 states have (on average 3.462222222222222) internal successors, (25707), 7426 states have internal predecessors, (25707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 25707 transitions.
[2021-06-01 16:35:30,315 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 25707 transitions. Word has length 68
[2021-06-01 16:35:30,316 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:30,316 INFO L482 AbstractCegarLoop]: Abstraction has 7427 states and 25707 transitions.
[2021-06-01 16:35:30,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 25707 transitions.
[2021-06-01 16:35:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2021-06-01 16:35:30,336 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:30,336 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:30,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 16:35:30,336 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1573199234, now seen corresponding path program 1 times
[2021-06-01 16:35:30,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:30,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040812229]
[2021-06-01 16:35:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:30,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:30,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040812229]
[2021-06-01 16:35:30,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040812229] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:30,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:30,601 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:30,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813529938]
[2021-06-01 16:35:30,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:30,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:30,603 INFO L87 Difference]: Start difference. First operand 7427 states and 25707 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:30,770 INFO L93 Difference]: Finished difference Result 12419 states and 42219 transitions.
[2021-06-01 16:35:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:35:30,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2021-06-01 16:35:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:30,799 INFO L225 Difference]: With dead ends: 12419
[2021-06-01 16:35:30,800 INFO L226 Difference]: Without dead ends: 8291
[2021-06-01 16:35:30,800 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states.
[2021-06-01 16:35:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 6995.
[2021-06-01 16:35:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 6993 states have (on average 3.3758043758043756) internal successors, (23607), 6994 states have internal predecessors, (23607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 23607 transitions.
[2021-06-01 16:35:31,005 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 23607 transitions. Word has length 69
[2021-06-01 16:35:31,005 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:31,005 INFO L482 AbstractCegarLoop]: Abstraction has 6995 states and 23607 transitions.
[2021-06-01 16:35:31,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 23607 transitions.
[2021-06-01 16:35:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2021-06-01 16:35:31,017 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:31,017 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:31,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 16:35:31,017 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -789215593, now seen corresponding path program 1 times
[2021-06-01 16:35:31,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:31,018 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239713630]
[2021-06-01 16:35:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:31,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:31,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239713630]
[2021-06-01 16:35:31,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239713630] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:31,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:31,305 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:35:31,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094493985]
[2021-06-01 16:35:31,305 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:35:31,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:31,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:35:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:31,306 INFO L87 Difference]: Start difference. First operand 6995 states and 23607 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:31,625 INFO L93 Difference]: Finished difference Result 8153 states and 27362 transitions.
[2021-06-01 16:35:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 16:35:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2021-06-01 16:35:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:31,652 INFO L225 Difference]: With dead ends: 8153
[2021-06-01 16:35:31,652 INFO L226 Difference]: Without dead ends: 6833
[2021-06-01 16:35:31,653 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 223.1ms TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:35:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states.
[2021-06-01 16:35:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 6833.
[2021-06-01 16:35:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6833 states, 6831 states have (on average 3.365393061045235) internal successors, (22989), 6832 states have internal predecessors, (22989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6833 states to 6833 states and 22989 transitions.
[2021-06-01 16:35:31,926 INFO L78 Accepts]: Start accepts. Automaton has 6833 states and 22989 transitions. Word has length 70
[2021-06-01 16:35:31,926 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:31,926 INFO L482 AbstractCegarLoop]: Abstraction has 6833 states and 22989 transitions.
[2021-06-01 16:35:31,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6833 states and 22989 transitions.
[2021-06-01 16:35:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-06-01 16:35:31,941 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:31,941 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:31,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 16:35:31,942 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -646375001, now seen corresponding path program 1 times
[2021-06-01 16:35:31,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:31,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588373197]
[2021-06-01 16:35:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:32,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:32,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588373197]
[2021-06-01 16:35:32,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588373197] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:32,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:32,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:35:32,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379036213]
[2021-06-01 16:35:32,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:35:32,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:35:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:35:32,166 INFO L87 Difference]: Start difference. First operand 6833 states and 22989 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:32,421 INFO L93 Difference]: Finished difference Result 6679 states and 22228 transitions.
[2021-06-01 16:35:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 16:35:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2021-06-01 16:35:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:32,438 INFO L225 Difference]: With dead ends: 6679
[2021-06-01 16:35:32,438 INFO L226 Difference]: Without dead ends: 5879
[2021-06-01 16:35:32,439 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 162.2ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:35:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states.
[2021-06-01 16:35:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5879.
[2021-06-01 16:35:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5879 states, 5878 states have (on average 3.3341272541680844) internal successors, (19598), 5878 states have internal predecessors, (19598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 19598 transitions.
[2021-06-01 16:35:32,578 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 19598 transitions. Word has length 71
[2021-06-01 16:35:32,579 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:32,579 INFO L482 AbstractCegarLoop]: Abstraction has 5879 states and 19598 transitions.
[2021-06-01 16:35:32,579 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 19598 transitions.
[2021-06-01 16:35:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2021-06-01 16:35:32,589 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:32,589 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:32,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 16:35:32,589 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2031589724, now seen corresponding path program 1 times
[2021-06-01 16:35:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:32,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789620865]
[2021-06-01 16:35:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:32,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:32,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789620865]
[2021-06-01 16:35:32,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789620865] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:32,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:32,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:32,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517808782]
[2021-06-01 16:35:32,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:32,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:32,686 INFO L87 Difference]: Start difference. First operand 5879 states and 19598 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:32,898 INFO L93 Difference]: Finished difference Result 9473 states and 31211 transitions.
[2021-06-01 16:35:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:35:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2021-06-01 16:35:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:32,916 INFO L225 Difference]: With dead ends: 9473
[2021-06-01 16:35:32,917 INFO L226 Difference]: Without dead ends: 6281
[2021-06-01 16:35:32,917 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 162.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states.
[2021-06-01 16:35:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 5531.
[2021-06-01 16:35:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5530 states have (on average 3.250994575045208) internal successors, (17978), 5530 states have internal predecessors, (17978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 17978 transitions.
[2021-06-01 16:35:33,045 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 17978 transitions. Word has length 72
[2021-06-01 16:35:33,045 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:33,045 INFO L482 AbstractCegarLoop]: Abstraction has 5531 states and 17978 transitions.
[2021-06-01 16:35:33,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 17978 transitions.
[2021-06-01 16:35:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2021-06-01 16:35:33,059 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:33,059 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:33,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 16:35:33,060 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2117553635, now seen corresponding path program 1 times
[2021-06-01 16:35:33,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:33,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243950978]
[2021-06-01 16:35:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:33,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:33,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243950978]
[2021-06-01 16:35:33,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243950978] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:33,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:33,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:35:33,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490116926]
[2021-06-01 16:35:33,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:35:33,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:33,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:35:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:35:33,274 INFO L87 Difference]: Start difference. First operand 5531 states and 17978 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:33,568 INFO L93 Difference]: Finished difference Result 6235 states and 20210 transitions.
[2021-06-01 16:35:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 16:35:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2021-06-01 16:35:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:33,582 INFO L225 Difference]: With dead ends: 6235
[2021-06-01 16:35:33,582 INFO L226 Difference]: Without dead ends: 5635
[2021-06-01 16:35:33,583 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 188.9ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:35:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states.
[2021-06-01 16:35:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5635.
[2021-06-01 16:35:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5635 states, 5634 states have (on average 3.247071352502662) internal successors, (18294), 5634 states have internal predecessors, (18294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 18294 transitions.
[2021-06-01 16:35:33,759 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 18294 transitions. Word has length 73
[2021-06-01 16:35:33,759 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:33,759 INFO L482 AbstractCegarLoop]: Abstraction has 5635 states and 18294 transitions.
[2021-06-01 16:35:33,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 18294 transitions.
[2021-06-01 16:35:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2021-06-01 16:35:33,770 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:33,770 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:33,770 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 16:35:33,770 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash -511051197, now seen corresponding path program 2 times
[2021-06-01 16:35:33,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:33,771 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554485606]
[2021-06-01 16:35:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:33,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:33,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554485606]
[2021-06-01 16:35:33,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554485606] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:33,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:33,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:35:33,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745353265]
[2021-06-01 16:35:33,967 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:35:33,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:35:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:35:33,968 INFO L87 Difference]: Start difference. First operand 5635 states and 18294 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:34,223 INFO L93 Difference]: Finished difference Result 6627 states and 21521 transitions.
[2021-06-01 16:35:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 16:35:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2021-06-01 16:35:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:34,236 INFO L225 Difference]: With dead ends: 6627
[2021-06-01 16:35:34,236 INFO L226 Difference]: Without dead ends: 5947
[2021-06-01 16:35:34,237 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 202.6ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:35:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states.
[2021-06-01 16:35:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 5723.
[2021-06-01 16:35:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 5722 states have (on average 3.249737853897239) internal successors, (18595), 5722 states have internal predecessors, (18595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 18595 transitions.
[2021-06-01 16:35:34,374 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 18595 transitions. Word has length 73
[2021-06-01 16:35:34,374 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:34,374 INFO L482 AbstractCegarLoop]: Abstraction has 5723 states and 18595 transitions.
[2021-06-01 16:35:34,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 18595 transitions.
[2021-06-01 16:35:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-01 16:35:34,385 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:34,385 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:34,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 16:35:34,385 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:34,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1077713512, now seen corresponding path program 1 times
[2021-06-01 16:35:34,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:34,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604268676]
[2021-06-01 16:35:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:34,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:34,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604268676]
[2021-06-01 16:35:34,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604268676] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:34,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:34,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:35:34,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374163464]
[2021-06-01 16:35:34,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:35:34,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:35:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:35:34,646 INFO L87 Difference]: Start difference. First operand 5723 states and 18595 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:34,931 INFO L93 Difference]: Finished difference Result 6667 states and 21461 transitions.
[2021-06-01 16:35:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-01 16:35:34,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2021-06-01 16:35:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:34,945 INFO L225 Difference]: With dead ends: 6667
[2021-06-01 16:35:34,945 INFO L226 Difference]: Without dead ends: 5962
[2021-06-01 16:35:34,946 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 255.0ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:35:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states.
[2021-06-01 16:35:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5962.
[2021-06-01 16:35:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5962 states, 5961 states have (on average 3.242408991779903) internal successors, (19328), 5961 states have internal predecessors, (19328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 19328 transitions.
[2021-06-01 16:35:35,094 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 19328 transitions. Word has length 74
[2021-06-01 16:35:35,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:35,095 INFO L482 AbstractCegarLoop]: Abstraction has 5962 states and 19328 transitions.
[2021-06-01 16:35:35,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 19328 transitions.
[2021-06-01 16:35:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-01 16:35:35,106 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:35,106 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:35,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 16:35:35,106 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -960084680, now seen corresponding path program 2 times
[2021-06-01 16:35:35,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:35,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655427330]
[2021-06-01 16:35:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:35,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:35,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655427330]
[2021-06-01 16:35:35,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655427330] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:35,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:35,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:35:35,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379875332]
[2021-06-01 16:35:35,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:35:35,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:35:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:35:35,457 INFO L87 Difference]: Start difference. First operand 5962 states and 19328 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:35,840 INFO L93 Difference]: Finished difference Result 6812 states and 21900 transitions.
[2021-06-01 16:35:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-06-01 16:35:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2021-06-01 16:35:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:35,851 INFO L225 Difference]: With dead ends: 6812
[2021-06-01 16:35:35,851 INFO L226 Difference]: Without dead ends: 5512
[2021-06-01 16:35:35,852 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 407.3ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380
[2021-06-01 16:35:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states.
[2021-06-01 16:35:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 5323.
[2021-06-01 16:35:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 5322 states have (on average 3.2290492296129276) internal successors, (17185), 5322 states have internal predecessors, (17185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 17185 transitions.
[2021-06-01 16:35:35,980 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 17185 transitions. Word has length 74
[2021-06-01 16:35:35,980 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:35,980 INFO L482 AbstractCegarLoop]: Abstraction has 5323 states and 17185 transitions.
[2021-06-01 16:35:35,980 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 17185 transitions.
[2021-06-01 16:35:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-01 16:35:35,988 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:35,989 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:35,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 16:35:35,989 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash 544574612, now seen corresponding path program 3 times
[2021-06-01 16:35:35,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:35,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044657259]
[2021-06-01 16:35:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:36,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:36,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044657259]
[2021-06-01 16:35:36,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044657259] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:36,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:36,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:35:36,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403735065]
[2021-06-01 16:35:36,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:35:36,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:35:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:35:36,237 INFO L87 Difference]: Start difference. First operand 5323 states and 17185 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:36,612 INFO L93 Difference]: Finished difference Result 7491 states and 23971 transitions.
[2021-06-01 16:35:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-06-01 16:35:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2021-06-01 16:35:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:36,620 INFO L225 Difference]: With dead ends: 7491
[2021-06-01 16:35:36,620 INFO L226 Difference]: Without dead ends: 4661
[2021-06-01 16:35:36,621 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 351.7ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380
[2021-06-01 16:35:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states.
[2021-06-01 16:35:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 3836.
[2021-06-01 16:35:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.1994784876140807) internal successors, (12270), 3835 states have internal predecessors, (12270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 12270 transitions.
[2021-06-01 16:35:36,715 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 12270 transitions. Word has length 74
[2021-06-01 16:35:36,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:36,716 INFO L482 AbstractCegarLoop]: Abstraction has 3836 states and 12270 transitions.
[2021-06-01 16:35:36,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 12270 transitions.
[2021-06-01 16:35:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-06-01 16:35:36,722 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:36,722 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:36,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 16:35:36,722 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1790156746, now seen corresponding path program 1 times
[2021-06-01 16:35:36,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:36,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195833606]
[2021-06-01 16:35:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:36,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:36,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195833606]
[2021-06-01 16:35:36,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195833606] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:36,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:36,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:35:36,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375638145]
[2021-06-01 16:35:36,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:35:36,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:35:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:35:36,806 INFO L87 Difference]: Start difference. First operand 3836 states and 12270 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:36,924 INFO L93 Difference]: Finished difference Result 4692 states and 14710 transitions.
[2021-06-01 16:35:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 16:35:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2021-06-01 16:35:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:36,932 INFO L225 Difference]: With dead ends: 4692
[2021-06-01 16:35:36,932 INFO L226 Difference]: Without dead ends: 3380
[2021-06-01 16:35:36,932 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 88.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:35:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states.
[2021-06-01 16:35:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3380.
[2021-06-01 16:35:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 3.1358390056229655) internal successors, (10596), 3379 states have internal predecessors, (10596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 10596 transitions.
[2021-06-01 16:35:37,008 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 10596 transitions. Word has length 74
[2021-06-01 16:35:37,008 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:37,008 INFO L482 AbstractCegarLoop]: Abstraction has 3380 states and 10596 transitions.
[2021-06-01 16:35:37,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 10596 transitions.
[2021-06-01 16:35:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2021-06-01 16:35:37,014 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:37,014 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:37,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 16:35:37,014 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 178190096, now seen corresponding path program 1 times
[2021-06-01 16:35:37,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:37,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528532670]
[2021-06-01 16:35:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:37,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-06-01 16:35:37,122 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:37,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528532670]
[2021-06-01 16:35:37,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528532670] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:37,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:37,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:35:37,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059642774]
[2021-06-01 16:35:37,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:35:37,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:35:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:35:37,123 INFO L87 Difference]: Start difference. First operand 3380 states and 10596 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:37,253 INFO L93 Difference]: Finished difference Result 3422 states and 10426 transitions.
[2021-06-01 16:35:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-01 16:35:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2021-06-01 16:35:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:37,256 INFO L225 Difference]: With dead ends: 3422
[2021-06-01 16:35:37,256 INFO L226 Difference]: Without dead ends: 2354
[2021-06-01 16:35:37,256 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 101.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:35:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states.
[2021-06-01 16:35:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354.
[2021-06-01 16:35:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 3.008924776880578) internal successors, (7080), 2353 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7080 transitions.
[2021-06-01 16:35:37,301 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7080 transitions. Word has length 75
[2021-06-01 16:35:37,301 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:37,301 INFO L482 AbstractCegarLoop]: Abstraction has 2354 states and 7080 transitions.
[2021-06-01 16:35:37,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7080 transitions.
[2021-06-01 16:35:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2021-06-01 16:35:37,304 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:37,305 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:37,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 16:35:37,305 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 649217767, now seen corresponding path program 1 times
[2021-06-01 16:35:37,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:37,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004398518]
[2021-06-01 16:35:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:35:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 16:35:37,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:35:37,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004398518]
[2021-06-01 16:35:37,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004398518] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:35:37,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:35:37,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 16:35:37,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954696642]
[2021-06-01 16:35:37,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 16:35:37,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:35:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 16:35:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 16:35:37,405 INFO L87 Difference]: Start difference. First operand 2354 states and 7080 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:35:37,555 INFO L93 Difference]: Finished difference Result 1940 states and 5673 transitions.
[2021-06-01 16:35:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 16:35:37,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2021-06-01 16:35:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:35:37,557 INFO L225 Difference]: With dead ends: 1940
[2021-06-01 16:35:37,557 INFO L226 Difference]: Without dead ends: 794
[2021-06-01 16:35:37,559 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 120.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:35:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states.
[2021-06-01 16:35:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794.
[2021-06-01 16:35:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 2.7919293820933166) internal successors, (2214), 793 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2214 transitions.
[2021-06-01 16:35:37,572 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2214 transitions. Word has length 77
[2021-06-01 16:35:37,572 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:35:37,573 INFO L482 AbstractCegarLoop]: Abstraction has 794 states and 2214 transitions.
[2021-06-01 16:35:37,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 16:35:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2214 transitions.
[2021-06-01 16:35:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-06-01 16:35:37,574 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 16:35:37,574 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:35:37,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-01 16:35:37,574 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:35:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:35:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash 162993972, now seen corresponding path program 1 times
[2021-06-01 16:35:37,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:35:37,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212293007]
[2021-06-01 16:35:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:35:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:35:37,611 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:35:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:35:37,651 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:35:37,695 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 16:35:37,697 INFO L655 BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 16:35:37,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-01 16:35:37,697 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-01 16:35:37,699 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 16:35:37,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:35:37 BasicIcfg
[2021-06-01 16:35:37,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 16:35:37,840 INFO L168 Benchmark]: Toolchain (without parser) took 14829.86 ms. Allocated memory was 331.4 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 293.7 MB in the beginning and 1.1 GB in the end (delta: -844.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,840 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 331.4 MB. Free memory was 312.1 MB in the beginning and 312.0 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.38 ms. Allocated memory is still 331.4 MB. Free memory was 293.5 MB in the beginning and 290.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.38 ms. Allocated memory is still 331.4 MB. Free memory was 290.1 MB in the beginning and 286.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,841 INFO L168 Benchmark]: Boogie Preprocessor took 51.49 ms. Allocated memory is still 331.4 MB. Free memory was 286.9 MB in the beginning and 284.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,841 INFO L168 Benchmark]: RCFGBuilder took 1810.22 ms. Allocated memory is still 331.4 MB. Free memory was 284.8 MB in the beginning and 244.2 MB in the end (delta: 40.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,841 INFO L168 Benchmark]: TraceAbstraction took 12271.47 ms. Allocated memory was 331.4 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 244.2 MB in the beginning and 1.1 GB in the end (delta: -893.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB.
[2021-06-01 16:35:37,842 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.15 ms. Allocated memory is still 331.4 MB. Free memory was 312.1 MB in the beginning and 312.0 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 609.38 ms. Allocated memory is still 331.4 MB. Free memory was 293.5 MB in the beginning and 290.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 81.38 ms. Allocated memory is still 331.4 MB. Free memory was 290.1 MB in the beginning and 286.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 51.49 ms. Allocated memory is still 331.4 MB. Free memory was 286.9 MB in the beginning and 284.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1810.22 ms. Allocated memory is still 331.4 MB. Free memory was 284.8 MB in the beginning and 244.2 MB in the end (delta: 40.6 MB). Peak memory consumption was 142.3 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 12271.47 ms. Allocated memory was 331.4 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 244.2 MB in the beginning and 1.1 GB in the end (delta: -893.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L710] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0]
[L711] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L713] 0 int x = 0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L715] 0 int y = 0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L716] 0 _Bool y$flush_delayed;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L717] 0 int y$mem_tmp;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L718] 0 _Bool y$r_buff0_thd0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L719] 0 _Bool y$r_buff0_thd1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L720] 0 _Bool y$r_buff0_thd2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L721] 0 _Bool y$r_buff0_thd3;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L722] 0 _Bool y$r_buff1_thd0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L723] 0 _Bool y$r_buff1_thd1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L724] 0 _Bool y$r_buff1_thd2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L725] 0 _Bool y$r_buff1_thd3;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L726] 0 _Bool y$read_delayed;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L727] 0 int *y$read_delayed_var;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L728] 0 int y$w_buff0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L729] 0 _Bool y$w_buff0_used;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L730] 0 int y$w_buff1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L731] 0 _Bool y$w_buff1_used;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L733] 0 int z = 0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L734] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L735] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L811] 0 pthread_t t2498;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L813] 0 pthread_t t2499;
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L815] 0 pthread_t t2500;
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L774] 3 y$w_buff1 = y$w_buff0
[L775] 3 y$w_buff0 = 2
[L776] 3 y$w_buff1_used = y$w_buff0_used
[L777] 3 y$w_buff0_used = (_Bool)1
[L18] COND FALSE 3 !(!expression)
[L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L783] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L786] 3 z = 1
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L739] 1 z = 2
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L742] 1 x = 1
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L754] 2 x = 2
VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L757] 2 y = 1
VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L829] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L830] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L831] 0 y$flush_delayed = weak$$choice2
[L832] 0 y$mem_tmp = y
[L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y
[L841] 0 y = y$flush_delayed ? y$mem_tmp : y
[L842] 0 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances
CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1583.9ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 80.7ms, AutomataDifference: 336.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 881.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 35 SDslu, 64 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.1ms SsaConstructionTime, 38.2ms SatisfiabilityAnalysisTime, 133.0ms InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances
CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 613.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 86.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 526.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9802.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 223.5ms, AutomataDifference: 3876.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 509.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1997 SDtfs, 2808 SDslu, 7838 SDs, 0 SdLazy, 1005 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1007.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2680.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14087occurred in iteration=0, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2171.1ms AutomataMinimizationTime, 14 MinimizatonAttempts, 3284 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.2ms SsaConstructionTime, 556.3ms SatisfiabilityAnalysisTime, 2194.6ms InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 5564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...