/usr/bin/java -Xmx8000000000 -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/safe029_power.opt_pso.opt_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd
[2022-02-08 23:58:52,341 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-08 23:58:52,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-08 23:58:52,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-08 23:58:52,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-08 23:58:52,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-08 23:58:52,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-08 23:58:52,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-08 23:58:52,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-08 23:58:52,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-08 23:58:52,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-08 23:58:52,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-08 23:58:52,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-08 23:58:52,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-08 23:58:52,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-08 23:58:52,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-08 23:58:52,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-08 23:58:52,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-08 23:58:52,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-08 23:58:52,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-08 23:58:52,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-08 23:58:52,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-08 23:58:52,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-08 23:58:52,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-08 23:58:52,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-08 23:58:52,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-08 23:58:52,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-08 23:58:52,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-08 23:58:52,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-08 23:58:52,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-08 23:58:52,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-08 23:58:52,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-08 23:58:52,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-08 23:58:52,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-08 23:58:52,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-08 23:58:52,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-08 23:58:52,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-08 23:58:52,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-08 23:58:52,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-08 23:58:52,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-08 23:58:52,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-08 23:58:52,421 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
[2022-02-08 23:58:52,436 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-08 23:58:52,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-08 23:58:52,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-08 23:58:52,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-08 23:58:52,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-08 23:58:52,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-08 23:58:52,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-08 23:58:52,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-08 23:58:52,438 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-08 23:58:52,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-08 23:58:52,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-08 23:58:52,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-08 23:58:52,440 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-08 23:58:52,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-08 23:58:52,440 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-08 23:58:52,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-08 23:58:52,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-08 23:58:52,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-08 23:58:52,441 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-02-08 23:58:52,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-08 23:58:52,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-08 23:58:52,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-08 23:58:52,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-08 23:58:52,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-08 23:58:52,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-08 23:58:52,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-08 23:58:52,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-08 23:58:52,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-08 23:58:52,442 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
[2022-02-08 23:58:52,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-08 23:58:52,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-08 23:58:52,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-08 23:58:52,664 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-08 23:58:52,670 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-08 23:58:52,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:52,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe4ffaf1/ff8709ac022a436ab7557da5ddcba7ef/FLAG0b28763b1
[2022-02-08 23:58:53,161 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-08 23:58:53,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:53,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe4ffaf1/ff8709ac022a436ab7557da5ddcba7ef/FLAG0b28763b1
[2022-02-08 23:58:53,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fe4ffaf1/ff8709ac022a436ab7557da5ddcba7ef
[2022-02-08 23:58:53,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-08 23:58:53,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-08 23:58:53,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-08 23:58:53,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-08 23:58:53,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-08 23:58:53,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd5d697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53, skipping insertion in model container
[2022-02-08 23:58:53,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-08 23:58:53,557 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-08 23:58:53,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980]
[2022-02-08 23:58:53,794 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-08 23:58:53,799 INFO L203 MainTranslator]: Completed pre-run
[2022-02-08 23:58:53,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980]
[2022-02-08 23:58:53,867 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-08 23:58:53,903 INFO L208 MainTranslator]: Completed translation
[2022-02-08 23:58:53,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53 WrapperNode
[2022-02-08 23:58:53,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-08 23:58:53,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-08 23:58:53,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-08 23:58:53,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-08 23:58:53,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,961 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258
[2022-02-08 23:58:53,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-08 23:58:53,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-08 23:58:53,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-08 23:58:53,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-08 23:58:53,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:53,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:54,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:54,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-08 23:58:54,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-08 23:58:54,004 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-08 23:58:54,004 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-08 23:58:54,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (1/1) ...
[2022-02-08 23:58:54,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-08 23:58:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-08 23:58:54,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-02-08 23:58:54,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-02-08 23:58:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-02-08 23:58:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2022-02-08 23:58:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2022-02-08 23:58:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-08 23:58:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-08 23:58:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-08 23:58:54,055 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-08 23:58:54,136 INFO L234 CfgBuilder]: Building ICFG
[2022-02-08 23:58:54,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-08 23:58:54,450 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-08 23:58:54,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-08 23:58:54,641 INFO L299 CfgBuilder]: Removed 0 assume(true) statements.
[2022-02-08 23:58:54,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:54 BoogieIcfgContainer
[2022-02-08 23:58:54,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-08 23:58:54,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-08 23:58:54,644 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-08 23:58:54,646 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-08 23:58:54,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:58:53" (1/3) ...
[2022-02-08 23:58:54,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4b8cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:54, skipping insertion in model container
[2022-02-08 23:58:54,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:53" (2/3) ...
[2022-02-08 23:58:54,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4b8cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:54, skipping insertion in model container
[2022-02-08 23:58:54,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:54" (3/3) ...
[2022-02-08 23:58:54,648 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:54,651 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-08 23:58:54,651 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-08 23:58:54,651 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-08 23:58:54,651 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,684 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,688 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,692 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,693 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,697 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,698 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,699 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,699 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:54,699 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-08 23:58:54,727 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-08 23:58:54,731 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-02-08 23:58:54,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2022-02-08 23:58:54,737 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 93 transitions, 196 flow
[2022-02-08 23:58:54,813 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1726 states, 1723 states have (on average 2.680789320951828) internal successors, (4619), 1725 states have internal predecessors, (4619), 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)
[2022-02-08 23:58:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 1726 states, 1723 states have (on average 2.680789320951828) internal successors, (4619), 1725 states have internal predecessors, (4619), 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)
[2022-02-08 23:58:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2022-02-08 23:58:54,825 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:54,826 INFO L514 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]
[2022-02-08 23:58:54,826 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1568406000, now seen corresponding path program 1 times
[2022-02-08 23:58:54,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:54,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852011091]
[2022-02-08 23:58:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:54,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:55,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:55,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852011091]
[2022-02-08 23:58:55,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852011091] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:55,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:55,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-08 23:58:55,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373621832]
[2022-02-08 23:58:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:55,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-08 23:58:55,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-08 23:58:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-08 23:58:55,153 INFO L87 Difference]: Start difference. First operand has 1726 states, 1723 states have (on average 2.680789320951828) internal successors, (4619), 1725 states have internal predecessors, (4619), 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 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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)
[2022-02-08 23:58:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:55,228 INFO L93 Difference]: Finished difference Result 1470 states and 3803 transitions.
[2022-02-08 23:58:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-08 23:58:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 47
[2022-02-08 23:58:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:55,258 INFO L225 Difference]: With dead ends: 1470
[2022-02-08 23:58:55,259 INFO L226 Difference]: Without dead ends: 1246
[2022-02-08 23:58:55,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-08 23:58:55,263 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:55,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 129 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-08 23:58:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states.
[2022-02-08 23:58:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246.
[2022-02-08 23:58:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.6080321285140564) internal successors, (3247), 1245 states have internal predecessors, (3247), 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)
[2022-02-08 23:58:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3247 transitions.
[2022-02-08 23:58:55,350 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3247 transitions. Word has length 47
[2022-02-08 23:58:55,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:55,350 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3247 transitions.
[2022-02-08 23:58:55,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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)
[2022-02-08 23:58:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3247 transitions.
[2022-02-08 23:58:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2022-02-08 23:58:55,360 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:55,360 INFO L514 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]
[2022-02-08 23:58:55,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-08 23:58:55,360 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1291529996, now seen corresponding path program 1 times
[2022-02-08 23:58:55,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:55,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620799766]
[2022-02-08 23:58:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:55,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:55,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:55,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620799766]
[2022-02-08 23:58:55,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620799766] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:55,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:55,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:58:55,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903541250]
[2022-02-08 23:58:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:55,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:58:55,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:58:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:58:55,591 INFO L87 Difference]: Start difference. First operand 1246 states and 3247 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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)
[2022-02-08 23:58:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:55,734 INFO L93 Difference]: Finished difference Result 1524 states and 3943 transitions.
[2022-02-08 23:58:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-08 23:58:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 62
[2022-02-08 23:58:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:55,738 INFO L225 Difference]: With dead ends: 1524
[2022-02-08 23:58:55,738 INFO L226 Difference]: Without dead ends: 1204
[2022-02-08 23:58:55,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:58:55,740 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:55,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 417 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states.
[2022-02-08 23:58:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204.
[2022-02-08 23:58:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 2.594347464671654) internal successors, (3121), 1203 states have internal predecessors, (3121), 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)
[2022-02-08 23:58:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 3121 transitions.
[2022-02-08 23:58:55,761 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 3121 transitions. Word has length 62
[2022-02-08 23:58:55,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:55,762 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 3121 transitions.
[2022-02-08 23:58:55,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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)
[2022-02-08 23:58:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 3121 transitions.
[2022-02-08 23:58:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2022-02-08 23:58:55,764 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:55,764 INFO L514 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]
[2022-02-08 23:58:55,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-08 23:58:55,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1755974829, now seen corresponding path program 1 times
[2022-02-08 23:58:55,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:55,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580821143]
[2022-02-08 23:58:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:55,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:55,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:55,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580821143]
[2022-02-08 23:58:55,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580821143] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:55,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:55,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:58:55,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762411633]
[2022-02-08 23:58:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:55,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:58:55,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:58:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:58:55,894 INFO L87 Difference]: Start difference. First operand 1204 states and 3121 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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)
[2022-02-08 23:58:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:56,110 INFO L93 Difference]: Finished difference Result 1436 states and 3699 transitions.
[2022-02-08 23:58:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-08 23:58:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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 64
[2022-02-08 23:58:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:56,116 INFO L225 Difference]: With dead ends: 1436
[2022-02-08 23:58:56,116 INFO L226 Difference]: Without dead ends: 1196
[2022-02-08 23:58:56,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2022-02-08 23:58:56,118 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 116 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:56,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 498 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states.
[2022-02-08 23:58:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1190.
[2022-02-08 23:58:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 2.5895710681244744) internal successors, (3079), 1189 states have internal predecessors, (3079), 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)
[2022-02-08 23:58:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3079 transitions.
[2022-02-08 23:58:56,166 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3079 transitions. Word has length 64
[2022-02-08 23:58:56,166 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:56,168 INFO L470 AbstractCegarLoop]: Abstraction has 1190 states and 3079 transitions.
[2022-02-08 23:58:56,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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)
[2022-02-08 23:58:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3079 transitions.
[2022-02-08 23:58:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2022-02-08 23:58:56,170 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:56,170 INFO L514 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]
[2022-02-08 23:58:56,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-08 23:58:56,170 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1145345042, now seen corresponding path program 1 times
[2022-02-08 23:58:56,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:56,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581043016]
[2022-02-08 23:58:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:56,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:56,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:56,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581043016]
[2022-02-08 23:58:56,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581043016] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:56,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:56,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:58:56,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437550367]
[2022-02-08 23:58:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:56,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:58:56,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:58:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:58:56,346 INFO L87 Difference]: Start difference. First operand 1190 states and 3079 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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)
[2022-02-08 23:58:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:56,535 INFO L93 Difference]: Finished difference Result 1320 states and 3388 transitions.
[2022-02-08 23:58:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-02-08 23:58:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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 65
[2022-02-08 23:58:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:56,539 INFO L225 Difference]: With dead ends: 1320
[2022-02-08 23:58:56,539 INFO L226 Difference]: Without dead ends: 1120
[2022-02-08 23:58:56,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240
[2022-02-08 23:58:56,541 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 184 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:56,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 625 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states.
[2022-02-08 23:58:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120.
[2022-02-08 23:58:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 2.576407506702413) internal successors, (2883), 1119 states have internal predecessors, (2883), 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)
[2022-02-08 23:58:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2883 transitions.
[2022-02-08 23:58:56,558 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2883 transitions. Word has length 65
[2022-02-08 23:58:56,559 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:56,559 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 2883 transitions.
[2022-02-08 23:58:56,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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)
[2022-02-08 23:58:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2883 transitions.
[2022-02-08 23:58:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2022-02-08 23:58:56,560 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:56,561 INFO L514 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]
[2022-02-08 23:58:56,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-08 23:58:56,561 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1667123167, now seen corresponding path program 1 times
[2022-02-08 23:58:56,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:56,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499585165]
[2022-02-08 23:58:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:56,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:56,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:56,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499585165]
[2022-02-08 23:58:56,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499585165] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:56,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:56,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:58:56,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290765602]
[2022-02-08 23:58:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:56,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:58:56,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:58:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:58:56,630 INFO L87 Difference]: Start difference. First operand 1120 states and 2883 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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)
[2022-02-08 23:58:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:56,750 INFO L93 Difference]: Finished difference Result 1940 states and 4949 transitions.
[2022-02-08 23:58:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-08 23:58:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65
[2022-02-08 23:58:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:56,755 INFO L225 Difference]: With dead ends: 1940
[2022-02-08 23:58:56,755 INFO L226 Difference]: Without dead ends: 1260
[2022-02-08 23:58:56,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:58:56,756 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:56,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 480 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states.
[2022-02-08 23:58:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1050.
[2022-02-08 23:58:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 2.498570066730219) internal successors, (2621), 1049 states have internal predecessors, (2621), 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)
[2022-02-08 23:58:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2621 transitions.
[2022-02-08 23:58:56,773 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2621 transitions. Word has length 65
[2022-02-08 23:58:56,773 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:56,773 INFO L470 AbstractCegarLoop]: Abstraction has 1050 states and 2621 transitions.
[2022-02-08 23:58:56,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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)
[2022-02-08 23:58:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2621 transitions.
[2022-02-08 23:58:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-08 23:58:56,775 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:56,775 INFO L514 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]
[2022-02-08 23:58:56,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-08 23:58:56,775 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:56,776 INFO L85 PathProgramCache]: Analyzing trace with hash -132211925, now seen corresponding path program 1 times
[2022-02-08 23:58:56,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:56,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746817878]
[2022-02-08 23:58:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:56,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:56,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:56,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746817878]
[2022-02-08 23:58:56,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746817878] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:56,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:56,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:58:56,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480848176]
[2022-02-08 23:58:56,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:56,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:58:56,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:58:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:58:56,909 INFO L87 Difference]: Start difference. First operand 1050 states and 2621 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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)
[2022-02-08 23:58:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:57,051 INFO L93 Difference]: Finished difference Result 1216 states and 3025 transitions.
[2022-02-08 23:58:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-08 23:58:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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
[2022-02-08 23:58:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:57,056 INFO L225 Difference]: With dead ends: 1216
[2022-02-08 23:58:57,056 INFO L226 Difference]: Without dead ends: 1036
[2022-02-08 23:58:57,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210
[2022-02-08 23:58:57,057 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 161 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:57,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 418 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states.
[2022-02-08 23:58:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036.
[2022-02-08 23:58:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 2.4917874396135264) internal successors, (2579), 1035 states have internal predecessors, (2579), 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)
[2022-02-08 23:58:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2579 transitions.
[2022-02-08 23:58:57,094 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2579 transitions. Word has length 66
[2022-02-08 23:58:57,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:57,095 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 2579 transitions.
[2022-02-08 23:58:57,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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)
[2022-02-08 23:58:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2579 transitions.
[2022-02-08 23:58:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2022-02-08 23:58:57,102 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:57,102 INFO L514 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]
[2022-02-08 23:58:57,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-08 23:58:57,103 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1463082320, now seen corresponding path program 1 times
[2022-02-08 23:58:57,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:57,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346015892]
[2022-02-08 23:58:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:57,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:57,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:57,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346015892]
[2022-02-08 23:58:57,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346015892] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:57,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:57,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-08 23:58:57,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497117901]
[2022-02-08 23:58:57,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:57,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-08 23:58:57,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:57,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-08 23:58:57,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-02-08 23:58:57,247 INFO L87 Difference]: Start difference. First operand 1036 states and 2579 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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)
[2022-02-08 23:58:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:57,413 INFO L93 Difference]: Finished difference Result 1273 states and 3169 transitions.
[2022-02-08 23:58:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-02-08 23:58:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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 67
[2022-02-08 23:58:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:57,417 INFO L225 Difference]: With dead ends: 1273
[2022-02-08 23:58:57,417 INFO L226 Difference]: Without dead ends: 1123
[2022-02-08 23:58:57,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182
[2022-02-08 23:58:57,418 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 100 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:57,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 621 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states.
[2022-02-08 23:58:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1049.
[2022-02-08 23:58:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1048 states have (on average 2.484732824427481) internal successors, (2604), 1048 states have internal predecessors, (2604), 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)
[2022-02-08 23:58:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2604 transitions.
[2022-02-08 23:58:57,442 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2604 transitions. Word has length 67
[2022-02-08 23:58:57,442 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:57,442 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 2604 transitions.
[2022-02-08 23:58:57,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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)
[2022-02-08 23:58:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2604 transitions.
[2022-02-08 23:58:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2022-02-08 23:58:57,444 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:57,444 INFO L514 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]
[2022-02-08 23:58:57,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-08 23:58:57,445 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -237809388, now seen corresponding path program 2 times
[2022-02-08 23:58:57,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:57,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195909645]
[2022-02-08 23:58:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:57,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:57,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:57,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195909645]
[2022-02-08 23:58:57,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195909645] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:57,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:57,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:58:57,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090422252]
[2022-02-08 23:58:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:57,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:58:57,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:58:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:58:57,601 INFO L87 Difference]: Start difference. First operand 1049 states and 2604 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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)
[2022-02-08 23:58:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:57,777 INFO L93 Difference]: Finished difference Result 1274 states and 3170 transitions.
[2022-02-08 23:58:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-08 23:58:57,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67
[2022-02-08 23:58:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:57,781 INFO L225 Difference]: With dead ends: 1274
[2022-02-08 23:58:57,781 INFO L226 Difference]: Without dead ends: 1124
[2022-02-08 23:58:57,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2022-02-08 23:58:57,782 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 175 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:57,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 708 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states.
[2022-02-08 23:58:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1047.
[2022-02-08 23:58:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 2.48565965583174) internal successors, (2600), 1046 states have internal predecessors, (2600), 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)
[2022-02-08 23:58:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2600 transitions.
[2022-02-08 23:58:57,800 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2600 transitions. Word has length 67
[2022-02-08 23:58:57,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:57,801 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 2600 transitions.
[2022-02-08 23:58:57,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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)
[2022-02-08 23:58:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2600 transitions.
[2022-02-08 23:58:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2022-02-08 23:58:57,805 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:57,805 INFO L514 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]
[2022-02-08 23:58:57,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-08 23:58:57,805 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1054840410, now seen corresponding path program 3 times
[2022-02-08 23:58:57,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:57,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306961096]
[2022-02-08 23:58:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:57,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:57,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:57,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306961096]
[2022-02-08 23:58:57,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306961096] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:57,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:57,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:58:57,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325592213]
[2022-02-08 23:58:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:57,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:58:57,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:57,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:58:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:58:57,950 INFO L87 Difference]: Start difference. First operand 1047 states and 2600 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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)
[2022-02-08 23:58:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:58,183 INFO L93 Difference]: Finished difference Result 1359 states and 3349 transitions.
[2022-02-08 23:58:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-08 23:58:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 67
[2022-02-08 23:58:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:58,188 INFO L225 Difference]: With dead ends: 1359
[2022-02-08 23:58:58,188 INFO L226 Difference]: Without dead ends: 989
[2022-02-08 23:58:58,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2022-02-08 23:58:58,190 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 209 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:58,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 587 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states.
[2022-02-08 23:58:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 950.
[2022-02-08 23:58:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 2.4678609062170707) internal successors, (2342), 949 states have internal predecessors, (2342), 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)
[2022-02-08 23:58:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2342 transitions.
[2022-02-08 23:58:58,209 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2342 transitions. Word has length 67
[2022-02-08 23:58:58,209 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:58,209 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 2342 transitions.
[2022-02-08 23:58:58,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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)
[2022-02-08 23:58:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2342 transitions.
[2022-02-08 23:58:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-08 23:58:58,213 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:58,213 INFO L514 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]
[2022-02-08 23:58:58,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-08 23:58:58,213 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 157568576, now seen corresponding path program 1 times
[2022-02-08 23:58:58,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:58,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376455332]
[2022-02-08 23:58:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:58,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:58,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:58,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376455332]
[2022-02-08 23:58:58,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376455332] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:58,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:58,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-02-08 23:58:58,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928333274]
[2022-02-08 23:58:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:58,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2022-02-08 23:58:58,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2022-02-08 23:58:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2022-02-08 23:58:58,472 INFO L87 Difference]: Start difference. First operand 950 states and 2342 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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)
[2022-02-08 23:58:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:59,011 INFO L93 Difference]: Finished difference Result 1127 states and 2728 transitions.
[2022-02-08 23:58:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2022-02-08 23:58:59,012 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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
[2022-02-08 23:58:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:59,015 INFO L225 Difference]: With dead ends: 1127
[2022-02-08 23:58:59,015 INFO L226 Difference]: Without dead ends: 950
[2022-02-08 23:58:59,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870
[2022-02-08 23:58:59,017 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 188 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:59,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 990 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-02-08 23:58:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states.
[2022-02-08 23:58:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950.
[2022-02-08 23:58:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 2.4552160168598527) internal successors, (2330), 949 states have internal predecessors, (2330), 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)
[2022-02-08 23:58:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2330 transitions.
[2022-02-08 23:58:59,034 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2330 transitions. Word has length 68
[2022-02-08 23:58:59,034 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:59,034 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 2330 transitions.
[2022-02-08 23:58:59,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 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)
[2022-02-08 23:58:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2330 transitions.
[2022-02-08 23:58:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-08 23:58:59,036 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:59,036 INFO L514 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]
[2022-02-08 23:58:59,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-08 23:58:59,037 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1990785472, now seen corresponding path program 2 times
[2022-02-08 23:58:59,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:59,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451985180]
[2022-02-08 23:58:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:59,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:59,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:59,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451985180]
[2022-02-08 23:58:59,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451985180] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:59,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:59,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-02-08 23:58:59,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181966476]
[2022-02-08 23:58:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:59,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-02-08 23:58:59,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:59,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-02-08 23:58:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-02-08 23:58:59,250 INFO L87 Difference]: Start difference. First operand 950 states and 2330 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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)
[2022-02-08 23:58:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:59,471 INFO L93 Difference]: Finished difference Result 1075 states and 2624 transitions.
[2022-02-08 23:58:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-02-08 23:58:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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
[2022-02-08 23:58:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:59,475 INFO L225 Difference]: With dead ends: 1075
[2022-02-08 23:58:59,475 INFO L226 Difference]: Without dead ends: 921
[2022-02-08 23:58:59,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:58:59,476 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 144 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:59,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 654 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:58:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2022-02-08 23:58:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921.
[2022-02-08 23:58:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 2.4608695652173913) internal successors, (2264), 920 states have internal predecessors, (2264), 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)
[2022-02-08 23:58:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2264 transitions.
[2022-02-08 23:58:59,491 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2264 transitions. Word has length 68
[2022-02-08 23:58:59,492 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:59,492 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 2264 transitions.
[2022-02-08 23:58:59,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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)
[2022-02-08 23:58:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2264 transitions.
[2022-02-08 23:58:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-08 23:58:59,493 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:59,493 INFO L514 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]
[2022-02-08 23:58:59,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-08 23:58:59,494 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -588624726, now seen corresponding path program 3 times
[2022-02-08 23:58:59,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:59,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394834935]
[2022-02-08 23:58:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:59,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:59,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:59,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394834935]
[2022-02-08 23:58:59,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394834935] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:59,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:59,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-08 23:58:59,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184833091]
[2022-02-08 23:58:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:59,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-08 23:58:59,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-08 23:58:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2022-02-08 23:58:59,679 INFO L87 Difference]: Start difference. First operand 921 states and 2264 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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)
[2022-02-08 23:58:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:59,928 INFO L93 Difference]: Finished difference Result 1381 states and 3365 transitions.
[2022-02-08 23:58:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-02-08 23:58:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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
[2022-02-08 23:58:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:58:59,933 INFO L225 Difference]: With dead ends: 1381
[2022-02-08 23:58:59,933 INFO L226 Difference]: Without dead ends: 866
[2022-02-08 23:58:59,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306
[2022-02-08 23:58:59,936 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 165 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-08 23:58:59,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 853 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-08 23:58:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states.
[2022-02-08 23:58:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 726.
[2022-02-08 23:58:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.406896551724138) internal successors, (1745), 725 states have internal predecessors, (1745), 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)
[2022-02-08 23:58:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1745 transitions.
[2022-02-08 23:58:59,957 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1745 transitions. Word has length 68
[2022-02-08 23:58:59,957 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:58:59,957 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1745 transitions.
[2022-02-08 23:58:59,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 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)
[2022-02-08 23:58:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1745 transitions.
[2022-02-08 23:58:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-08 23:58:59,959 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:58:59,959 INFO L514 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]
[2022-02-08 23:58:59,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-08 23:58:59,960 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:58:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 413428596, now seen corresponding path program 1 times
[2022-02-08 23:58:59,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:59,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436714604]
[2022-02-08 23:58:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:59,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:00,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:00,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436714604]
[2022-02-08 23:59:00,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436714604] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:00,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:00,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:59:00,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857281016]
[2022-02-08 23:59:00,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:00,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:59:00,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:00,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:59:00,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:59:00,128 INFO L87 Difference]: Start difference. First operand 726 states and 1745 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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)
[2022-02-08 23:59:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:00,429 INFO L93 Difference]: Finished difference Result 941 states and 2252 transitions.
[2022-02-08 23:59:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-02-08 23:59:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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
[2022-02-08 23:59:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:00,431 INFO L225 Difference]: With dead ends: 941
[2022-02-08 23:59:00,432 INFO L226 Difference]: Without dead ends: 731
[2022-02-08 23:59:00,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:59:00,433 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 215 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:00,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 527 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-08 23:59:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states.
[2022-02-08 23:59:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 726.
[2022-02-08 23:59:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.4) internal successors, (1740), 725 states have internal predecessors, (1740), 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)
[2022-02-08 23:59:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1740 transitions.
[2022-02-08 23:59:00,445 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1740 transitions. Word has length 68
[2022-02-08 23:59:00,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:00,445 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1740 transitions.
[2022-02-08 23:59:00,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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)
[2022-02-08 23:59:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1740 transitions.
[2022-02-08 23:59:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-08 23:59:00,447 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:59:00,447 INFO L514 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]
[2022-02-08 23:59:00,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-08 23:59:00,447 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:59:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1431212494, now seen corresponding path program 2 times
[2022-02-08 23:59:00,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:00,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470218671]
[2022-02-08 23:59:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:00,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:00,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:00,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470218671]
[2022-02-08 23:59:00,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470218671] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:00,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:00,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:00,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123796096]
[2022-02-08 23:59:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:00,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:00,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:00,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:00,505 INFO L87 Difference]: Start difference. First operand 726 states and 1740 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)
[2022-02-08 23:59:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:00,619 INFO L93 Difference]: Finished difference Result 807 states and 1885 transitions.
[2022-02-08 23:59:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-02-08 23:59:00,619 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
[2022-02-08 23:59:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:00,622 INFO L225 Difference]: With dead ends: 807
[2022-02-08 23:59:00,622 INFO L226 Difference]: Without dead ends: 577
[2022-02-08 23:59:00,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:00,622 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 107 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:00,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 285 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states.
[2022-02-08 23:59:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577.
[2022-02-08 23:59:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 2.3090277777777777) internal successors, (1330), 576 states have internal predecessors, (1330), 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)
[2022-02-08 23:59:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1330 transitions.
[2022-02-08 23:59:00,633 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1330 transitions. Word has length 68
[2022-02-08 23:59:00,633 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:00,633 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 1330 transitions.
[2022-02-08 23:59:00,633 INFO L471 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)
[2022-02-08 23:59:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1330 transitions.
[2022-02-08 23:59:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2022-02-08 23:59:00,634 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:59:00,634 INFO L514 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]
[2022-02-08 23:59:00,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-02-08 23:59:00,635 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:59:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash -225884169, now seen corresponding path program 1 times
[2022-02-08 23:59:00,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:00,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588923567]
[2022-02-08 23:59:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:00,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:00,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:00,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588923567]
[2022-02-08 23:59:00,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588923567] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:00,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:00,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-08 23:59:00,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131707122]
[2022-02-08 23:59:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:00,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-08 23:59:00,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-08 23:59:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-02-08 23:59:00,712 INFO L87 Difference]: Start difference. First operand 577 states and 1330 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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)
[2022-02-08 23:59:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:00,829 INFO L93 Difference]: Finished difference Result 475 states and 1043 transitions.
[2022-02-08 23:59:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-02-08 23:59:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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
[2022-02-08 23:59:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:00,830 INFO L225 Difference]: With dead ends: 475
[2022-02-08 23:59:00,830 INFO L226 Difference]: Without dead ends: 289
[2022-02-08 23:59:00,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2022-02-08 23:59:00,833 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:00,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 302 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2022-02-08 23:59:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289.
[2022-02-08 23:59:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.076388888888889) internal successors, (598), 288 states have internal predecessors, (598), 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)
[2022-02-08 23:59:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 598 transitions.
[2022-02-08 23:59:00,837 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 598 transitions. Word has length 69
[2022-02-08 23:59:00,837 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:00,838 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 598 transitions.
[2022-02-08 23:59:00,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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)
[2022-02-08 23:59:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 598 transitions.
[2022-02-08 23:59:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2022-02-08 23:59:00,838 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-08 23:59:00,838 INFO L514 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]
[2022-02-08 23:59:00,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-02-08 23:59:00,839 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2022-02-08 23:59:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1156507031, now seen corresponding path program 1 times
[2022-02-08 23:59:00,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:00,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590765481]
[2022-02-08 23:59:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:00,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-08 23:59:00,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-08 23:59:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-08 23:59:00,933 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-08 23:59:00,934 INFO L628 BasicCegarLoop]: Counterexample is feasible
[2022-02-08 23:59:00,935 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2022-02-08 23:59:00,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2022-02-08 23:59:00,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining)
[2022-02-08 23:59:00,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining)
[2022-02-08 23:59:00,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2022-02-08 23:59:00,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-02-08 23:59:00,938 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:00,942 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-08 23:59:00,942 INFO L180 ceAbstractionStarter]: Computing trace abstraction results
[2022-02-08 23:59:01,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:59:01 BasicIcfg
[2022-02-08 23:59:01,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-08 23:59:01,035 INFO L158 Benchmark]: Toolchain (without parser) took 7514.25ms. Allocated memory was 209.7MB in the beginning and 416.3MB in the end (delta: 206.6MB). Free memory was 158.8MB in the beginning and 155.4MB in the end (delta: 3.4MB). Peak memory consumption was 210.7MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,035 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 176.8MB in the beginning and 176.8MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-02-08 23:59:01,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.30ms. Allocated memory is still 209.7MB. Free memory was 158.6MB in the beginning and 168.3MB in the end (delta: -9.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.03ms. Allocated memory is still 209.7MB. Free memory was 168.3MB in the beginning and 165.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,036 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 209.7MB. Free memory was 165.7MB in the beginning and 163.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,036 INFO L158 Benchmark]: RCFGBuilder took 639.03ms. Allocated memory is still 209.7MB. Free memory was 163.6MB in the beginning and 92.8MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,036 INFO L158 Benchmark]: TraceAbstraction took 6391.42ms. Allocated memory was 209.7MB in the beginning and 416.3MB in the end (delta: 206.6MB). Free memory was 92.3MB in the beginning and 155.4MB in the end (delta: -63.1MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:01,037 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.11ms. Allocated memory is still 209.7MB. Free memory was 176.8MB in the beginning and 176.8MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 382.30ms. Allocated memory is still 209.7MB. Free memory was 158.6MB in the beginning and 168.3MB in the end (delta: -9.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 56.03ms. Allocated memory is still 209.7MB. Free memory was 168.3MB in the beginning and 165.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 41.48ms. Allocated memory is still 209.7MB. Free memory was 165.7MB in the beginning and 163.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 639.03ms. Allocated memory is still 209.7MB. Free memory was 163.6MB in the beginning and 92.8MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB.
* TraceAbstraction took 6391.42ms. Allocated memory was 209.7MB in the beginning and 416.3MB in the end (delta: 206.6MB). Free memory was 92.3MB in the beginning and 155.4MB in the end (delta: -63.1MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L709] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0]
[L710] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L712] 0 int x = 0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L713] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L714] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L715] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L716] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L717] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L718] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0]
[L719] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L720] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L721] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0]
[L722] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L723] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L724] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L725] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L726] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L728] 0 int y = 0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L729] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L730] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L790] 0 pthread_t t2475;
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L792] 0 pthread_t t2476;
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L754] 2 x$w_buff1 = x$w_buff0
[L755] 2 x$w_buff0 = 2
[L756] 2 x$w_buff1_used = x$w_buff0_used
[L757] 2 x$w_buff0_used = (_Bool)1
[L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L762] 2 x$r_buff0_thd2 = (_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L765] 2 y = 1
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L734] 1 y = 2
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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L737] 1 x = 1
VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L775] 2 __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L797] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L797] RET 0 assume_abort_if_not(main$tmp_guard0)
[L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L806] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L807] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L808] 0 x$flush_delayed = weak$$choice2
[L809] 0 x$mem_tmp = x
[L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L811] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)
[L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L817] 0 main$tmp_guard1 = !(x == 2 && y == 2)
[L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L818] 0 x = x$flush_delayed ? x$mem_tmp : x
[L819] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L821] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L18] 0 reach_error()
VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
- UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2111 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2111 mSDsluCounter, 8094 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6880 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1779 IncrementalHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 1523 mSDtfsCounter, 1779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1726occurred in iteration=0, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 551 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 964 ConstructedInterpolants, 0 QuantifiedInterpolants, 6006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-02-08 23:59:01,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...