/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/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 13:07:33,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 13:07:33,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 13:07:33,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 13:07:33,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 13:07:33,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 13:07:33,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 13:07:33,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 13:07:33,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 13:07:33,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 13:07:33,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 13:07:33,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 13:07:33,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 13:07:33,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 13:07:33,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 13:07:33,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 13:07:33,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 13:07:33,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 13:07:33,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 13:07:33,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 13:07:33,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 13:07:33,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 13:07:33,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 13:07:33,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 13:07:33,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 13:07:33,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 13:07:33,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 13:07:33,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 13:07:33,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 13:07:33,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 13:07:33,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 13:07:33,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 13:07:33,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 13:07:33,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 13:07:33,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 13:07:33,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 13:07:33,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 13:07:33,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 13:07:33,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 13:07:33,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 13:07:33,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 13:07:33,171 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-03-15 13:07:33,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 13:07:33,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 13:07:33,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 13:07:33,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 13:07:33,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 13:07:33,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 13:07:33,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 13:07:33,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 13:07:33,189 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 13:07:33,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 13:07:33,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 13:07:33,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 13:07:33,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 13:07:33,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 13:07:33,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:07:33,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 13:07:33,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 13:07:33,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 13:07:33,195 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 13:07:33,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 13:07:33,195 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-03-15 13:07:33,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 13:07:33,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 13:07:33,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 13:07:33,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 13:07:33,406 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 13:07:33,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-03-15 13:07:33,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b5ae46/bcb831077e8f4d7ea2d996a36334ee0f/FLAG9a37928a0 [2022-03-15 13:07:33,829 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 13:07:33,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-03-15 13:07:33,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b5ae46/bcb831077e8f4d7ea2d996a36334ee0f/FLAG9a37928a0 [2022-03-15 13:07:34,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9b5ae46/bcb831077e8f4d7ea2d996a36334ee0f [2022-03-15 13:07:34,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 13:07:34,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 13:07:34,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 13:07:34,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 13:07:34,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 13:07:34,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3895977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34, skipping insertion in model container [2022-03-15 13:07:34,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 13:07:34,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 13:07:34,421 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/mix027_tso.i[944,957] [2022-03-15 13:07:34,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:07:34,612 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 13:07:34,620 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/mix027_tso.i[944,957] [2022-03-15 13:07:34,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 13:07:34,667 INFO L208 MainTranslator]: Completed translation [2022-03-15 13:07:34,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34 WrapperNode [2022-03-15 13:07:34,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 13:07:34,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 13:07:34,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 13:07:34,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 13:07:34,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,734 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-03-15 13:07:34,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 13:07:34,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 13:07:34,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 13:07:34,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 13:07:34,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 13:07:34,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 13:07:34,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 13:07:34,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 13:07:34,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (1/1) ... [2022-03-15 13:07:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 13:07:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 13:07:34,829 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-03-15 13:07:34,831 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-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 13:07:34,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 13:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 13:07:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 13:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 13:07:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 13:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 13:07:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 13:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 13:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 13:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 13:07:34,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 13:07:34,863 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 13:07:35,003 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 13:07:35,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 13:07:35,502 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 13:07:35,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 13:07:35,785 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 13:07:35,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:07:35 BoogieIcfgContainer [2022-03-15 13:07:35,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 13:07:35,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 13:07:35,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 13:07:35,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 13:07:35,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:07:34" (1/3) ... [2022-03-15 13:07:35,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1097c00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:07:35, skipping insertion in model container [2022-03-15 13:07:35,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:07:34" (2/3) ... [2022-03-15 13:07:35,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1097c00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:07:35, skipping insertion in model container [2022-03-15 13:07:35,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:07:35" (3/3) ... [2022-03-15 13:07:35,797 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-03-15 13:07:35,801 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 13:07:35,801 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 13:07:35,801 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 13:07:35,801 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 13:07:35,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,852 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,853 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,854 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,856 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,857 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,857 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,857 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,858 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,858 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,859 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,860 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,867 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,867 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,867 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,867 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,867 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,868 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,870 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,871 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,879 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,883 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,884 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,885 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,886 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,887 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,887 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,887 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,887 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,890 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,891 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,892 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,892 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,894 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,894 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,894 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,894 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,895 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,895 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,895 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,896 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,897 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,898 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,898 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,899 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,900 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 13:07:35,900 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 13:07:35,954 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 13:07:35,960 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 13:07:35,960 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 13:07:35,976 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 137 transitions, 294 flow [2022-03-15 13:07:39,915 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129055 states, 129052 states have (on average 4.459543439853702) internal successors, (575513), 129054 states have internal predecessors, (575513), 0 states have call successors, (0), 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-03-15 13:07:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 129055 states, 129052 states have (on average 4.459543439853702) internal successors, (575513), 129054 states have internal predecessors, (575513), 0 states have call successors, (0), 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-03-15 13:07:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-15 13:07:40,178 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:07:40,179 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] [2022-03-15 13:07:40,180 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:07:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:07:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1421907133, now seen corresponding path program 1 times [2022-03-15 13:07:40,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:07:40,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967707434] [2022-03-15 13:07:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:07:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:07:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:07:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:07:40,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:07:40,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967707434] [2022-03-15 13:07:40,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967707434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:07:40,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:07:40,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 13:07:40,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703189637] [2022-03-15 13:07:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:07:40,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 13:07:40,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:07:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 13:07:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 13:07:40,756 INFO L87 Difference]: Start difference. First operand has 129055 states, 129052 states have (on average 4.459543439853702) internal successors, (575513), 129054 states have internal predecessors, (575513), 0 states have call successors, (0), 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 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 13:07:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:07:42,807 INFO L93 Difference]: Finished difference Result 107815 states and 471720 transitions. [2022-03-15 13:07:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 13:07:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-03-15 13:07:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:07:43,547 INFO L225 Difference]: With dead ends: 107815 [2022-03-15 13:07:43,547 INFO L226 Difference]: Without dead ends: 87079 [2022-03-15 13:07:43,548 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-03-15 13:07:43,550 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 63 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:07:43,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 200 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 13:07:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87079 states. [2022-03-15 13:07:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87079 to 87079. [2022-03-15 13:07:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87079 states, 87078 states have (on average 4.411768759043616) internal successors, (384168), 87078 states have internal predecessors, (384168), 0 states have call successors, (0), 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-03-15 13:07:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87079 states to 87079 states and 384168 transitions. [2022-03-15 13:07:48,071 INFO L78 Accepts]: Start accepts. Automaton has 87079 states and 384168 transitions. Word has length 56 [2022-03-15 13:07:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:07:48,072 INFO L470 AbstractCegarLoop]: Abstraction has 87079 states and 384168 transitions. [2022-03-15 13:07:48,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-15 13:07:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 87079 states and 384168 transitions. [2022-03-15 13:07:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-15 13:07:48,212 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:07:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:07:48,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 13:07:48,213 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:07:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:07:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2065629017, now seen corresponding path program 1 times [2022-03-15 13:07:48,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:07:48,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96150411] [2022-03-15 13:07:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:07:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:07:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:07:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:07:48,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:07:48,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96150411] [2022-03-15 13:07:48,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96150411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:07:48,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:07:48,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 13:07:48,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245849480] [2022-03-15 13:07:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:07:48,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 13:07:48,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:07:48,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 13:07:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 13:07:48,437 INFO L87 Difference]: Start difference. First operand 87079 states and 384168 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-03-15 13:07:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:07:49,984 INFO L93 Difference]: Finished difference Result 107431 states and 471176 transitions. [2022-03-15 13:07:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 13:07:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2022-03-15 13:07:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:07:51,048 INFO L225 Difference]: With dead ends: 107431 [2022-03-15 13:07:51,048 INFO L226 Difference]: Without dead ends: 84391 [2022-03-15 13:07:51,048 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-03-15 13:07:51,050 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 174 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:07:51,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 688 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:07:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84391 states. [2022-03-15 13:07:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84391 to 84391. [2022-03-15 13:07:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84391 states, 84390 states have (on average 4.40099537859936) internal successors, (371400), 84390 states have internal predecessors, (371400), 0 states have call successors, (0), 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-03-15 13:07:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84391 states to 84391 states and 371400 transitions. [2022-03-15 13:07:54,973 INFO L78 Accepts]: Start accepts. Automaton has 84391 states and 371400 transitions. Word has length 85 [2022-03-15 13:07:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:07:54,974 INFO L470 AbstractCegarLoop]: Abstraction has 84391 states and 371400 transitions. [2022-03-15 13:07:54,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-03-15 13:07:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 84391 states and 371400 transitions. [2022-03-15 13:07:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-03-15 13:07:55,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:07:55,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:07:55,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 13:07:55,083 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:07:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:07:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2114888856, now seen corresponding path program 1 times [2022-03-15 13:07:55,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:07:55,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625164762] [2022-03-15 13:07:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:07:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:07:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:07:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:07:55,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:07:55,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625164762] [2022-03-15 13:07:55,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625164762] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:07:55,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:07:55,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 13:07:55,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393593054] [2022-03-15 13:07:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:07:55,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 13:07:55,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:07:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 13:07:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 13:07:55,586 INFO L87 Difference]: Start difference. First operand 84391 states and 371400 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-15 13:07:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:07:56,717 INFO L93 Difference]: Finished difference Result 97447 states and 426248 transitions. [2022-03-15 13:07:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 13:07:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-03-15 13:07:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:07:57,452 INFO L225 Difference]: With dead ends: 97447 [2022-03-15 13:07:57,452 INFO L226 Difference]: Without dead ends: 76327 [2022-03-15 13:07:57,463 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-03-15 13:07:57,464 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 184 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:07:57,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 657 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 13:07:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76327 states. [2022-03-15 13:07:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76327 to 76327. [2022-03-15 13:07:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76327 states, 76326 states have (on average 4.381730995990881) internal successors, (334440), 76326 states have internal predecessors, (334440), 0 states have call successors, (0), 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-03-15 13:08:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76327 states to 76327 states and 334440 transitions. [2022-03-15 13:08:00,511 INFO L78 Accepts]: Start accepts. Automaton has 76327 states and 334440 transitions. Word has length 87 [2022-03-15 13:08:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:00,511 INFO L470 AbstractCegarLoop]: Abstraction has 76327 states and 334440 transitions. [2022-03-15 13:08:00,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-03-15 13:08:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 76327 states and 334440 transitions. [2022-03-15 13:08:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-15 13:08:00,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:00,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:00,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 13:08:00,963 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2108511245, now seen corresponding path program 1 times [2022-03-15 13:08:00,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:00,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020656411] [2022-03-15 13:08:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:01,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:01,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020656411] [2022-03-15 13:08:01,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020656411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:01,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:01,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 13:08:01,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224180232] [2022-03-15 13:08:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:01,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 13:08:01,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:01,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 13:08:01,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-15 13:08:01,234 INFO L87 Difference]: Start difference. First operand 76327 states and 334440 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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-03-15 13:08:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:02,445 INFO L93 Difference]: Finished difference Result 94591 states and 413108 transitions. [2022-03-15 13:08:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 13:08:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-03-15 13:08:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:02,878 INFO L225 Difference]: With dead ends: 94591 [2022-03-15 13:08:02,878 INFO L226 Difference]: Without dead ends: 78031 [2022-03-15 13:08:02,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-15 13:08:02,879 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 366 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:02,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 815 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78031 states. [2022-03-15 13:08:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78031 to 74311. [2022-03-15 13:08:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74311 states, 74310 states have (on average 4.372870407751312) internal successors, (324948), 74310 states have internal predecessors, (324948), 0 states have call successors, (0), 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-03-15 13:08:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74311 states to 74311 states and 324948 transitions. [2022-03-15 13:08:06,361 INFO L78 Accepts]: Start accepts. Automaton has 74311 states and 324948 transitions. Word has length 88 [2022-03-15 13:08:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:06,362 INFO L470 AbstractCegarLoop]: Abstraction has 74311 states and 324948 transitions. [2022-03-15 13:08:06,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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-03-15 13:08:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 74311 states and 324948 transitions. [2022-03-15 13:08:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 13:08:06,526 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:06,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:06,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 13:08:06,526 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 897639537, now seen corresponding path program 1 times [2022-03-15 13:08:06,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:06,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216929131] [2022-03-15 13:08:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:06,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:06,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216929131] [2022-03-15 13:08:06,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216929131] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:06,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:06,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 13:08:06,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552222747] [2022-03-15 13:08:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:06,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 13:08:06,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 13:08:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 13:08:06,719 INFO L87 Difference]: Start difference. First operand 74311 states and 324948 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03-15 13:08:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:08,110 INFO L93 Difference]: Finished difference Result 85951 states and 374052 transitions. [2022-03-15 13:08:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 13:08:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-03-15 13:08:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:08,872 INFO L225 Difference]: With dead ends: 85951 [2022-03-15 13:08:08,872 INFO L226 Difference]: Without dead ends: 74431 [2022-03-15 13:08:08,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 13:08:08,876 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 309 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:08,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 1035 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 13:08:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74431 states. [2022-03-15 13:08:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74431 to 74431. [2022-03-15 13:08:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74431 states, 74430 states have (on average 4.372269246271665) internal successors, (325428), 74430 states have internal predecessors, (325428), 0 states have call successors, (0), 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-03-15 13:08:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74431 states to 74431 states and 325428 transitions. [2022-03-15 13:08:12,489 INFO L78 Accepts]: Start accepts. Automaton has 74431 states and 325428 transitions. Word has length 90 [2022-03-15 13:08:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:12,489 INFO L470 AbstractCegarLoop]: Abstraction has 74431 states and 325428 transitions. [2022-03-15 13:08:12,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03-15 13:08:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 74431 states and 325428 transitions. [2022-03-15 13:08:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-15 13:08:12,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:12,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:12,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 13:08:12,606 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -52662903, now seen corresponding path program 2 times [2022-03-15 13:08:12,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:12,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274695372] [2022-03-15 13:08:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:13,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:13,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274695372] [2022-03-15 13:08:13,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274695372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:13,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:13,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 13:08:13,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014441384] [2022-03-15 13:08:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:13,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 13:08:13,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 13:08:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 13:08:13,199 INFO L87 Difference]: Start difference. First operand 74431 states and 325428 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03-15 13:08:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:14,352 INFO L93 Difference]: Finished difference Result 90415 states and 394308 transitions. [2022-03-15 13:08:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 13:08:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-03-15 13:08:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:14,766 INFO L225 Difference]: With dead ends: 90415 [2022-03-15 13:08:14,767 INFO L226 Difference]: Without dead ends: 77695 [2022-03-15 13:08:14,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-03-15 13:08:14,768 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 295 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:14,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1147 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77695 states. [2022-03-15 13:08:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77695 to 77575. [2022-03-15 13:08:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77575 states, 77574 states have (on average 4.378064815530977) internal successors, (339624), 77574 states have internal predecessors, (339624), 0 states have call successors, (0), 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-03-15 13:08:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77575 states to 77575 states and 339624 transitions. [2022-03-15 13:08:18,173 INFO L78 Accepts]: Start accepts. Automaton has 77575 states and 339624 transitions. Word has length 90 [2022-03-15 13:08:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:18,173 INFO L470 AbstractCegarLoop]: Abstraction has 77575 states and 339624 transitions. [2022-03-15 13:08:18,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03-15 13:08:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 77575 states and 339624 transitions. [2022-03-15 13:08:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-15 13:08:18,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:18,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:18,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 13:08:18,316 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1001547207, now seen corresponding path program 1 times [2022-03-15 13:08:18,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:18,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687056291] [2022-03-15 13:08:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:18,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:18,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687056291] [2022-03-15 13:08:18,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687056291] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:18,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:18,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 13:08:18,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108738800] [2022-03-15 13:08:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:18,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 13:08:18,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 13:08:18,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 13:08:18,485 INFO L87 Difference]: Start difference. First operand 77575 states and 339624 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-03-15 13:08:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:19,649 INFO L93 Difference]: Finished difference Result 96435 states and 420825 transitions. [2022-03-15 13:08:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 13:08:19,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-03-15 13:08:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:20,349 INFO L225 Difference]: With dead ends: 96435 [2022-03-15 13:08:20,349 INFO L226 Difference]: Without dead ends: 85075 [2022-03-15 13:08:20,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-03-15 13:08:20,350 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 304 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:20,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 1070 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 13:08:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85075 states. [2022-03-15 13:08:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85075 to 83171. [2022-03-15 13:08:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83171 states, 83170 states have (on average 4.38029337501503) internal successors, (364309), 83170 states have internal predecessors, (364309), 0 states have call successors, (0), 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-03-15 13:08:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83171 states to 83171 states and 364309 transitions. [2022-03-15 13:08:24,001 INFO L78 Accepts]: Start accepts. Automaton has 83171 states and 364309 transitions. Word has length 91 [2022-03-15 13:08:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:24,001 INFO L470 AbstractCegarLoop]: Abstraction has 83171 states and 364309 transitions. [2022-03-15 13:08:24,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-03-15 13:08:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 83171 states and 364309 transitions. [2022-03-15 13:08:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-15 13:08:24,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:24,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:24,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 13:08:24,202 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1120974991, now seen corresponding path program 1 times [2022-03-15 13:08:24,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:24,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053680165] [2022-03-15 13:08:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:24,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:24,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053680165] [2022-03-15 13:08:24,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053680165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:24,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:24,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 13:08:24,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069280751] [2022-03-15 13:08:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:24,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 13:08:24,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 13:08:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-03-15 13:08:24,476 INFO L87 Difference]: Start difference. First operand 83171 states and 364309 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-15 13:08:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:25,657 INFO L93 Difference]: Finished difference Result 89203 states and 388849 transitions. [2022-03-15 13:08:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 13:08:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-03-15 13:08:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:26,386 INFO L225 Difference]: With dead ends: 89203 [2022-03-15 13:08:26,386 INFO L226 Difference]: Without dead ends: 79923 [2022-03-15 13:08:26,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-15 13:08:26,387 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 384 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:26,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 1105 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79923 states. [2022-03-15 13:08:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79923 to 79923. [2022-03-15 13:08:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79923 states, 79922 states have (on average 4.375778884412302) internal successors, (349721), 79922 states have internal predecessors, (349721), 0 states have call successors, (0), 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-03-15 13:08:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79923 states to 79923 states and 349721 transitions. [2022-03-15 13:08:29,402 INFO L78 Accepts]: Start accepts. Automaton has 79923 states and 349721 transitions. Word has length 92 [2022-03-15 13:08:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:29,402 INFO L470 AbstractCegarLoop]: Abstraction has 79923 states and 349721 transitions. [2022-03-15 13:08:29,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-15 13:08:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 79923 states and 349721 transitions. [2022-03-15 13:08:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-15 13:08:30,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:30,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:30,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 13:08:30,026 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 804426272, now seen corresponding path program 1 times [2022-03-15 13:08:30,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:30,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850296726] [2022-03-15 13:08:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:30,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:30,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850296726] [2022-03-15 13:08:30,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850296726] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:30,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:30,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 13:08:30,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033199519] [2022-03-15 13:08:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:30,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 13:08:30,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:30,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 13:08:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-15 13:08:30,233 INFO L87 Difference]: Start difference. First operand 79923 states and 349721 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-15 13:08:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:31,626 INFO L93 Difference]: Finished difference Result 98836 states and 427000 transitions. [2022-03-15 13:08:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 13:08:31,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-03-15 13:08:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:32,273 INFO L225 Difference]: With dead ends: 98836 [2022-03-15 13:08:32,273 INFO L226 Difference]: Without dead ends: 71756 [2022-03-15 13:08:32,274 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-03-15 13:08:32,277 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 239 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:32,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 496 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71756 states. [2022-03-15 13:08:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71756 to 71756. [2022-03-15 13:08:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71756 states, 71755 states have (on average 4.304731377604348) internal successors, (308886), 71755 states have internal predecessors, (308886), 0 states have call successors, (0), 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-03-15 13:08:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71756 states to 71756 states and 308886 transitions. [2022-03-15 13:08:35,086 INFO L78 Accepts]: Start accepts. Automaton has 71756 states and 308886 transitions. Word has length 92 [2022-03-15 13:08:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:35,087 INFO L470 AbstractCegarLoop]: Abstraction has 71756 states and 308886 transitions. [2022-03-15 13:08:35,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-15 13:08:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71756 states and 308886 transitions. [2022-03-15 13:08:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 13:08:35,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:35,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:35,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 13:08:35,576 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash -619084931, now seen corresponding path program 1 times [2022-03-15 13:08:35,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:35,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356868369] [2022-03-15 13:08:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:35,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:35,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356868369] [2022-03-15 13:08:35,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356868369] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:35,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:35,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 13:08:35,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791405577] [2022-03-15 13:08:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:35,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 13:08:35,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 13:08:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-15 13:08:35,674 INFO L87 Difference]: Start difference. First operand 71756 states and 308886 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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-03-15 13:08:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:36,620 INFO L93 Difference]: Finished difference Result 71972 states and 302346 transitions. [2022-03-15 13:08:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 13:08:36,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-03-15 13:08:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:36,853 INFO L225 Difference]: With dead ends: 71972 [2022-03-15 13:08:36,853 INFO L226 Difference]: Without dead ends: 49292 [2022-03-15 13:08:36,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-15 13:08:36,854 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 403 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:36,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 588 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 13:08:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49292 states. [2022-03-15 13:08:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49292 to 47552. [2022-03-15 13:08:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47552 states, 47551 states have (on average 4.13612752623499) internal successors, (196677), 47551 states have internal predecessors, (196677), 0 states have call successors, (0), 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-03-15 13:08:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47552 states to 47552 states and 196677 transitions. [2022-03-15 13:08:38,515 INFO L78 Accepts]: Start accepts. Automaton has 47552 states and 196677 transitions. Word has length 93 [2022-03-15 13:08:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:38,515 INFO L470 AbstractCegarLoop]: Abstraction has 47552 states and 196677 transitions. [2022-03-15 13:08:38,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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-03-15 13:08:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47552 states and 196677 transitions. [2022-03-15 13:08:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-03-15 13:08:38,605 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:38,606 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, 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-03-15 13:08:38,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 13:08:38,606 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2003640500, now seen corresponding path program 1 times [2022-03-15 13:08:38,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:38,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434651103] [2022-03-15 13:08:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:38,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:38,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:38,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434651103] [2022-03-15 13:08:38,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434651103] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:38,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:38,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 13:08:38,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710453803] [2022-03-15 13:08:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:38,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 13:08:38,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 13:08:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 13:08:38,695 INFO L87 Difference]: Start difference. First operand 47552 states and 196677 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-15 13:08:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:39,449 INFO L93 Difference]: Finished difference Result 39956 states and 161826 transitions. [2022-03-15 13:08:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 13:08:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-03-15 13:08:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:39,572 INFO L225 Difference]: With dead ends: 39956 [2022-03-15 13:08:39,572 INFO L226 Difference]: Without dead ends: 28166 [2022-03-15 13:08:39,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-15 13:08:39,573 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 495 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:39,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 616 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28166 states. [2022-03-15 13:08:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28166 to 27142. [2022-03-15 13:08:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27142 states, 27141 states have (on average 3.9968682067720422) internal successors, (108479), 27141 states have internal predecessors, (108479), 0 states have call successors, (0), 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-03-15 13:08:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27142 states to 27142 states and 108479 transitions. [2022-03-15 13:08:40,407 INFO L78 Accepts]: Start accepts. Automaton has 27142 states and 108479 transitions. Word has length 96 [2022-03-15 13:08:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:40,407 INFO L470 AbstractCegarLoop]: Abstraction has 27142 states and 108479 transitions. [2022-03-15 13:08:40,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-15 13:08:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27142 states and 108479 transitions. [2022-03-15 13:08:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-15 13:08:40,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:40,461 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, 1, 1, 1, 1, 1, 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-03-15 13:08:40,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 13:08:40,461 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1322114945, now seen corresponding path program 1 times [2022-03-15 13:08:40,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:40,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436048377] [2022-03-15 13:08:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:40,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:40,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436048377] [2022-03-15 13:08:40,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436048377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:40,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:40,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 13:08:40,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936139578] [2022-03-15 13:08:40,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:40,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 13:08:40,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:40,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 13:08:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-15 13:08:40,556 INFO L87 Difference]: Start difference. First operand 27142 states and 108479 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:41,176 INFO L93 Difference]: Finished difference Result 40303 states and 160720 transitions. [2022-03-15 13:08:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 13:08:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-03-15 13:08:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:41,277 INFO L225 Difference]: With dead ends: 40303 [2022-03-15 13:08:41,277 INFO L226 Difference]: Without dead ends: 28087 [2022-03-15 13:08:41,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-15 13:08:41,277 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 141 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:41,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 993 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 13:08:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28087 states. [2022-03-15 13:08:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28087 to 27142. [2022-03-15 13:08:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27142 states, 27141 states have (on average 3.9464647581150287) internal successors, (107111), 27141 states have internal predecessors, (107111), 0 states have call successors, (0), 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-03-15 13:08:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27142 states to 27142 states and 107111 transitions. [2022-03-15 13:08:42,078 INFO L78 Accepts]: Start accepts. Automaton has 27142 states and 107111 transitions. Word has length 101 [2022-03-15 13:08:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:42,079 INFO L470 AbstractCegarLoop]: Abstraction has 27142 states and 107111 transitions. [2022-03-15 13:08:42,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27142 states and 107111 transitions. [2022-03-15 13:08:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-15 13:08:42,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:42,130 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, 1, 1, 1, 1, 1, 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-03-15 13:08:42,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 13:08:42,131 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 952472959, now seen corresponding path program 2 times [2022-03-15 13:08:42,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:42,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138045242] [2022-03-15 13:08:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:42,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:42,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138045242] [2022-03-15 13:08:42,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138045242] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:42,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:42,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-15 13:08:42,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806473663] [2022-03-15 13:08:42,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:42,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 13:08:42,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:42,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 13:08:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 13:08:42,399 INFO L87 Difference]: Start difference. First operand 27142 states and 107111 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:43,387 INFO L93 Difference]: Finished difference Result 53428 states and 207985 transitions. [2022-03-15 13:08:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 13:08:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-03-15 13:08:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:43,550 INFO L225 Difference]: With dead ends: 53428 [2022-03-15 13:08:43,550 INFO L226 Difference]: Without dead ends: 44758 [2022-03-15 13:08:43,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2022-03-15 13:08:43,551 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 487 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:43,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 2024 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 13:08:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44758 states. [2022-03-15 13:08:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44758 to 31998. [2022-03-15 13:08:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31998 states, 31997 states have (on average 3.9311185423633463) internal successors, (125784), 31997 states have internal predecessors, (125784), 0 states have call successors, (0), 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-03-15 13:08:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31998 states to 31998 states and 125784 transitions. [2022-03-15 13:08:44,808 INFO L78 Accepts]: Start accepts. Automaton has 31998 states and 125784 transitions. Word has length 101 [2022-03-15 13:08:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:44,808 INFO L470 AbstractCegarLoop]: Abstraction has 31998 states and 125784 transitions. [2022-03-15 13:08:44,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 31998 states and 125784 transitions. [2022-03-15 13:08:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-15 13:08:44,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:44,872 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, 1, 1, 1, 1, 1, 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-03-15 13:08:44,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 13:08:44,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2094222943, now seen corresponding path program 3 times [2022-03-15 13:08:44,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:44,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731914486] [2022-03-15 13:08:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:44,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:44,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731914486] [2022-03-15 13:08:44,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731914486] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:44,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:44,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 13:08:44,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116528072] [2022-03-15 13:08:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:44,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 13:08:44,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:44,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 13:08:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 13:08:44,984 INFO L87 Difference]: Start difference. First operand 31998 states and 125784 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:45,363 INFO L93 Difference]: Finished difference Result 27030 states and 105777 transitions. [2022-03-15 13:08:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 13:08:45,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-03-15 13:08:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:45,406 INFO L225 Difference]: With dead ends: 27030 [2022-03-15 13:08:45,407 INFO L226 Difference]: Without dead ends: 13556 [2022-03-15 13:08:45,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-03-15 13:08:45,407 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 605 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:45,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [605 Valid, 576 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13556 states. [2022-03-15 13:08:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13556 to 12164. [2022-03-15 13:08:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12164 states, 12163 states have (on average 3.8733042834826934) internal successors, (47111), 12163 states have internal predecessors, (47111), 0 states have call successors, (0), 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-03-15 13:08:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12164 states to 12164 states and 47111 transitions. [2022-03-15 13:08:45,845 INFO L78 Accepts]: Start accepts. Automaton has 12164 states and 47111 transitions. Word has length 101 [2022-03-15 13:08:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:45,845 INFO L470 AbstractCegarLoop]: Abstraction has 12164 states and 47111 transitions. [2022-03-15 13:08:45,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-03-15 13:08:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12164 states and 47111 transitions. [2022-03-15 13:08:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-15 13:08:45,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:45,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 13:08:45,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 13:08:45,870 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1768325055, now seen corresponding path program 1 times [2022-03-15 13:08:45,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:45,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71070012] [2022-03-15 13:08:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 13:08:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 13:08:46,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 13:08:46,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71070012] [2022-03-15 13:08:46,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71070012] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 13:08:46,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 13:08:46,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-15 13:08:46,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160700245] [2022-03-15 13:08:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 13:08:46,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 13:08:46,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 13:08:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 13:08:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-03-15 13:08:46,244 INFO L87 Difference]: Start difference. First operand 12164 states and 47111 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-15 13:08:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 13:08:46,701 INFO L93 Difference]: Finished difference Result 22880 states and 89001 transitions. [2022-03-15 13:08:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 13:08:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-03-15 13:08:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 13:08:46,913 INFO L225 Difference]: With dead ends: 22880 [2022-03-15 13:08:46,914 INFO L226 Difference]: Without dead ends: 19299 [2022-03-15 13:08:46,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-03-15 13:08:46,914 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 661 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 13:08:46,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 1509 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 13:08:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2022-03-15 13:08:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 11324. [2022-03-15 13:08:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11324 states, 11323 states have (on average 3.909652918837764) internal successors, (44269), 11323 states have internal predecessors, (44269), 0 states have call successors, (0), 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-03-15 13:08:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 44269 transitions. [2022-03-15 13:08:47,202 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 44269 transitions. Word has length 106 [2022-03-15 13:08:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 13:08:47,202 INFO L470 AbstractCegarLoop]: Abstraction has 11324 states and 44269 transitions. [2022-03-15 13:08:47,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-15 13:08:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 44269 transitions. [2022-03-15 13:08:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-15 13:08:47,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 13:08:47,225 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 13:08:47,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 13:08:47,225 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 13:08:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 13:08:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1384892257, now seen corresponding path program 2 times [2022-03-15 13:08:47,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 13:08:47,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040289328] [2022-03-15 13:08:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 13:08:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 13:08:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 13:08:47,282 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 13:08:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 13:08:47,374 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 13:08:47,376 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 13:08:47,377 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 13:08:47,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 13:08:47,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 13:08:47,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 13:08:47,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 13:08:47,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 13:08:47,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 13:08:47,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 13:08:47,382 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 13:08:47,385 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 13:08:47,386 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 13:08:47,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:08:47 BasicIcfg [2022-03-15 13:08:47,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 13:08:47,523 INFO L158 Benchmark]: Toolchain (without parser) took 73324.72ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 148.2MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-03-15 13:08:47,523 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 165.9MB in the beginning and 165.9MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 13:08:47,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.99ms. Allocated memory is still 200.3MB. Free memory was 147.9MB in the beginning and 161.9MB in the end (delta: -14.0MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-03-15 13:08:47,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.50ms. Allocated memory is still 200.3MB. Free memory was 161.9MB in the beginning and 158.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 13:08:47,524 INFO L158 Benchmark]: Boogie Preprocessor took 49.71ms. Allocated memory is still 200.3MB. Free memory was 158.8MB in the beginning and 156.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 13:08:47,524 INFO L158 Benchmark]: RCFGBuilder took 1002.81ms. Allocated memory is still 200.3MB. Free memory was 156.2MB in the beginning and 121.4MB in the end (delta: 34.8MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2022-03-15 13:08:47,524 INFO L158 Benchmark]: TraceAbstraction took 71732.29ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-03-15 13:08:47,525 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 200.3MB. Free memory was 165.9MB in the beginning and 165.9MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.99ms. Allocated memory is still 200.3MB. Free memory was 147.9MB in the beginning and 161.9MB in the end (delta: -14.0MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.50ms. Allocated memory is still 200.3MB. Free memory was 161.9MB in the beginning and 158.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.71ms. Allocated memory is still 200.3MB. Free memory was 158.8MB in the beginning and 156.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1002.81ms. Allocated memory is still 200.3MB. Free memory was 156.2MB in the beginning and 121.4MB in the end (delta: 34.8MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. * TraceAbstraction took 71732.29ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 3.2GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L851] 0 pthread_t t737; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t737={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L853] 0 pthread_t t738; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L855] 0 pthread_t t739; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L857] 0 pthread_t t740; VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L756] 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) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] 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) [L756] 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) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2] [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L786] 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) [L786] 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) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 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 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 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 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 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 [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 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) [L875] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=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: 858]: 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: 852]: 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: 856]: 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: 854]: 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 9 procedures, 174 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 71.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5110 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5110 mSDsluCounter, 13519 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11674 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2554 IncrementalHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 2661 mSDtfsCounter, 2554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129055occurred in iteration=0, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 31580 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1475 NumberOfCodeBlocks, 1475 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1354 ConstructedInterpolants, 0 QuantifiedInterpolants, 9100 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-03-15 13:08:47,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...