/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:51:58,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:51:58,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:51:58,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:51:58,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:51:58,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:51:58,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:51:58,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:51:58,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:51:58,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:51:58,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:51:58,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:51:58,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:51:58,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:51:58,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:51:58,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:51:58,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:51:58,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:51:58,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:51:58,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:51:58,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:51:58,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:51:58,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:51:58,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:51:58,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:51:58,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:51:58,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:51:58,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:51:58,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:51:58,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:51:58,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:51:58,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:51:58,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:51:58,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:51:58,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:51:58,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:51:58,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:51:58,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:51:58,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:51:58,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:51:58,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:51:58,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:51:58,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:51:58,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:51:58,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:51:58,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:51:58,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:51:58,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:51:58,902 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:51:58,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:51:58,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:51:58,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:51:58,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:51:58,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:51:58,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:51:58,905 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 17:51:59,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:51:59,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:51:59,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:51:59,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:51:59,118 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:51:59,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-03-15 17:51:59,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a57c184/1c0bb39d389c4d67b56643e62c578578/FLAG2b2eb8e29 [2022-03-15 17:51:59,599 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:51:59,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-03-15 17:51:59,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a57c184/1c0bb39d389c4d67b56643e62c578578/FLAG2b2eb8e29 [2022-03-15 17:51:59,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a57c184/1c0bb39d389c4d67b56643e62c578578 [2022-03-15 17:51:59,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:51:59,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:51:59,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:51:59,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:51:59,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:51:59,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:59" (1/1) ... [2022-03-15 17:51:59,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c468a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:59, skipping insertion in model container [2022-03-15 17:51:59,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:59" (1/1) ... [2022-03-15 17:51:59,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:51:59,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:51:59,865 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/mix033.opt.i[944,957] [2022-03-15 17:52:00,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:00,043 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:52:00,054 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/mix033.opt.i[944,957] [2022-03-15 17:52:00,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:00,114 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:52:00,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00 WrapperNode [2022-03-15 17:52:00,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:00,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:00,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:52:00,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:52:00,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,171 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 186 [2022-03-15 17:52:00,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:00,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:52:00,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:52:00,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:52:00,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:52:00,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:52:00,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:52:00,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:52:00,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (1/1) ... [2022-03-15 17:52:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:52:00,248 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 17:52:00,258 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 17:52:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:52:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:52:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:52:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:52:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:52:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:52:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:52:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:52:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:52:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:52:00,282 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 17:52:00,361 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:52:00,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:52:00,662 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:52:00,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:52:00,829 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:52:00,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:00 BoogieIcfgContainer [2022-03-15 17:52:00,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:52:00,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:52:00,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:52:00,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:52:00,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:51:59" (1/3) ... [2022-03-15 17:52:00,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1e3ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:00, skipping insertion in model container [2022-03-15 17:52:00,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:00" (2/3) ... [2022-03-15 17:52:00,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1e3ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:00, skipping insertion in model container [2022-03-15 17:52:00,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:00" (3/3) ... [2022-03-15 17:52:00,836 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-03-15 17:52:00,839 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:52:00,839 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:52:00,840 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:52:00,840 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:52:00,870 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,870 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,871 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,873 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,874 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,882 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,883 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,885 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,889 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,890 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,890 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,890 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,890 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,893 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,894 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,895 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,896 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,897 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,899 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,900 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,901 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,901 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,902 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,902 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,902 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,903 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,904 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,904 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,905 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:00,906 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:52:00,945 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:52:00,949 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:52:00,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:52:00,957 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:52:00,962 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 257 flow [2022-03-15 17:52:00,964 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 257 flow [2022-03-15 17:52:00,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-03-15 17:52:01,006 INFO L129 PetriNetUnfolder]: 2/118 cut-off events. [2022-03-15 17:52:01,007 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:52:01,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-03-15 17:52:01,015 INFO L116 LiptonReduction]: Number of co-enabled transitions 2240 [2022-03-15 17:52:04,398 INFO L131 LiptonReduction]: Checked pairs total: 5716 [2022-03-15 17:52:04,398 INFO L133 LiptonReduction]: Total number of compositions: 103 [2022-03-15 17:52:04,403 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2022-03-15 17:52:04,447 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 930 states, 927 states have (on average 3.3462783171521036) internal successors, (3102), 929 states have internal predecessors, (3102), 0 states have call successors, (0), 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 17:52:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 930 states, 927 states have (on average 3.3462783171521036) internal successors, (3102), 929 states have internal predecessors, (3102), 0 states have call successors, (0), 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 17:52:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 17:52:04,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:04,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:04,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2114260258, now seen corresponding path program 1 times [2022-03-15 17:52:04,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:04,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949153110] [2022-03-15 17:52:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:04,652 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 17:52:04,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:04,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949153110] [2022-03-15 17:52:04,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949153110] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:04,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:04,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:52:04,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725938659] [2022-03-15 17:52:04,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:04,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:04,674 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 17:52:04,674 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:04,676 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:04,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:52:04,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:52:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:04,716 INFO L87 Difference]: Start difference. First operand has 930 states, 927 states have (on average 3.3462783171521036) internal successors, (3102), 929 states have internal predecessors, (3102), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 17:52:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:04,821 INFO L93 Difference]: Finished difference Result 790 states and 2485 transitions. [2022-03-15 17:52:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 17:52:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:04,846 INFO L225 Difference]: With dead ends: 790 [2022-03-15 17:52:04,847 INFO L226 Difference]: Without dead ends: 650 [2022-03-15 17:52:04,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:04,849 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:04,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-03-15 17:52:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-03-15 17:52:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 3.1248073959938365) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 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 17:52:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-03-15 17:52:04,933 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2022-03-15 17:52:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:04,934 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-03-15 17:52:04,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 17:52:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-03-15 17:52:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:52:04,935 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:04,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:04,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:52:04,935 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash 234347684, now seen corresponding path program 1 times [2022-03-15 17:52:04,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:04,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921929165] [2022-03-15 17:52:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:05,088 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 17:52:05,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:05,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921929165] [2022-03-15 17:52:05,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921929165] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:05,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:05,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:05,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691312344] [2022-03-15 17:52:05,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:05,090 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:05,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 17:52:05,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:05,091 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:05,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:05,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:05,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:05,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:05,092 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:05,205 INFO L93 Difference]: Finished difference Result 1106 states and 3230 transitions. [2022-03-15 17:52:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 17:52:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:05,210 INFO L225 Difference]: With dead ends: 1106 [2022-03-15 17:52:05,210 INFO L226 Difference]: Without dead ends: 894 [2022-03-15 17:52:05,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:05,211 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:05,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-03-15 17:52:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 782. [2022-03-15 17:52:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 3.032010243277849) internal successors, (2368), 781 states have internal predecessors, (2368), 0 states have call successors, (0), 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 17:52:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2368 transitions. [2022-03-15 17:52:05,232 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 2368 transitions. Word has length 10 [2022-03-15 17:52:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:05,232 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 2368 transitions. [2022-03-15 17:52:05,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 2368 transitions. [2022-03-15 17:52:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:52:05,238 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:05,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:05,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:52:05,239 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:05,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1325199851, now seen corresponding path program 1 times [2022-03-15 17:52:05,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:05,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562116319] [2022-03-15 17:52:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:05,294 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 17:52:05,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:05,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562116319] [2022-03-15 17:52:05,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562116319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:05,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:05,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:05,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467572285] [2022-03-15 17:52:05,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:05,296 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:05,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2022-03-15 17:52:05,297 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:05,366 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:05,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:05,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:05,367 INFO L87 Difference]: Start difference. First operand 782 states and 2368 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:05,437 INFO L93 Difference]: Finished difference Result 814 states and 2400 transitions. [2022-03-15 17:52:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 17:52:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:05,440 INFO L225 Difference]: With dead ends: 814 [2022-03-15 17:52:05,440 INFO L226 Difference]: Without dead ends: 718 [2022-03-15 17:52:05,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:05,441 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:05,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 13 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-03-15 17:52:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 654. [2022-03-15 17:52:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 3.013782542113323) internal successors, (1968), 653 states have internal predecessors, (1968), 0 states have call successors, (0), 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 17:52:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1968 transitions. [2022-03-15 17:52:05,454 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1968 transitions. Word has length 11 [2022-03-15 17:52:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:05,454 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 1968 transitions. [2022-03-15 17:52:05,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1968 transitions. [2022-03-15 17:52:05,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:52:05,455 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:05,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:05,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:52:05,455 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1869835254, now seen corresponding path program 1 times [2022-03-15 17:52:05,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:05,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35084371] [2022-03-15 17:52:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:05,499 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 17:52:05,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:05,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35084371] [2022-03-15 17:52:05,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35084371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:05,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:05,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:05,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984018479] [2022-03-15 17:52:05,499 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:05,500 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:05,501 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 17:52:05,501 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:05,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:05,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:05,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:05,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:05,502 INFO L87 Difference]: Start difference. First operand 654 states and 1968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:05,567 INFO L93 Difference]: Finished difference Result 670 states and 1960 transitions. [2022-03-15 17:52:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 17:52:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:05,570 INFO L225 Difference]: With dead ends: 670 [2022-03-15 17:52:05,570 INFO L226 Difference]: Without dead ends: 590 [2022-03-15 17:52:05,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:05,570 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:05,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 13 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-03-15 17:52:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 542. [2022-03-15 17:52:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.9648798521256934) internal successors, (1604), 541 states have internal predecessors, (1604), 0 states have call successors, (0), 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 17:52:05,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1604 transitions. [2022-03-15 17:52:05,581 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1604 transitions. Word has length 12 [2022-03-15 17:52:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:05,581 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 1604 transitions. [2022-03-15 17:52:05,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1604 transitions. [2022-03-15 17:52:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:52:05,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:05,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:05,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:52:05,582 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 285489448, now seen corresponding path program 1 times [2022-03-15 17:52:05,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:05,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769904067] [2022-03-15 17:52:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:05,622 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 17:52:05,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:05,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769904067] [2022-03-15 17:52:05,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769904067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:05,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:05,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:05,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633044874] [2022-03-15 17:52:05,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:05,624 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:05,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2022-03-15 17:52:05,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:05,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10653#(not (= 3 ~__unbuffered_cnt~0))] [2022-03-15 17:52:05,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:05,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:05,781 INFO L87 Difference]: Start difference. First operand 542 states and 1604 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:52:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:05,881 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2022-03-15 17:52:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 17:52:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:05,883 INFO L225 Difference]: With dead ends: 362 [2022-03-15 17:52:05,883 INFO L226 Difference]: Without dead ends: 230 [2022-03-15 17:52:05,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:05,883 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:05,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 20 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-03-15 17:52:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-03-15 17:52:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.2422907488986783) internal successors, (509), 227 states have internal predecessors, (509), 0 states have call successors, (0), 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 17:52:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 509 transitions. [2022-03-15 17:52:05,888 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 509 transitions. Word has length 14 [2022-03-15 17:52:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:05,888 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 509 transitions. [2022-03-15 17:52:05,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:52:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 509 transitions. [2022-03-15 17:52:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:52:05,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:05,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:05,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:52:05,889 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash -805713989, now seen corresponding path program 1 times [2022-03-15 17:52:05,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:05,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993385906] [2022-03-15 17:52:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:05,949 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 17:52:05,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:05,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993385906] [2022-03-15 17:52:05,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993385906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:05,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:05,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:05,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361151977] [2022-03-15 17:52:05,950 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:05,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:05,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 122 transitions. [2022-03-15 17:52:05,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:07,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11482#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:52:07,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:52:07,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:52:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:07,215 INFO L87 Difference]: Start difference. First operand 228 states and 509 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 17:52:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:07,299 INFO L93 Difference]: Finished difference Result 199 states and 450 transitions. [2022-03-15 17:52:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 19 [2022-03-15 17:52:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:07,300 INFO L225 Difference]: With dead ends: 199 [2022-03-15 17:52:07,301 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 17:52:07,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:07,301 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:07,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 17:52:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-03-15 17:52:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.31055900621118) internal successors, (372), 161 states have internal predecessors, (372), 0 states have call successors, (0), 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 17:52:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 372 transitions. [2022-03-15 17:52:07,305 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 372 transitions. Word has length 19 [2022-03-15 17:52:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:07,305 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 372 transitions. [2022-03-15 17:52:07,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 17:52:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 372 transitions. [2022-03-15 17:52:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 17:52:07,306 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:07,306 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] [2022-03-15 17:52:07,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:52:07,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:07,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash 261522695, now seen corresponding path program 1 times [2022-03-15 17:52:07,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:07,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727008364] [2022-03-15 17:52:07,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:07,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:07,417 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 17:52:07,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:07,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727008364] [2022-03-15 17:52:07,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727008364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:07,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:07,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:07,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1555095447] [2022-03-15 17:52:07,418 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:07,421 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:07,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 149 transitions. [2022-03-15 17:52:07,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:08,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:08,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:08,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:08,536 INFO L87 Difference]: Start difference. First operand 162 states and 372 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 17:52:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:08,618 INFO L93 Difference]: Finished difference Result 204 states and 455 transitions. [2022-03-15 17:52:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 22 [2022-03-15 17:52:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:08,619 INFO L225 Difference]: With dead ends: 204 [2022-03-15 17:52:08,619 INFO L226 Difference]: Without dead ends: 71 [2022-03-15 17:52:08,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:08,620 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:08,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-15 17:52:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-03-15 17:52:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 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 17:52:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-03-15 17:52:08,622 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2022-03-15 17:52:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:08,622 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-03-15 17:52:08,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 17:52:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-03-15 17:52:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 17:52:08,623 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:08,623 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] [2022-03-15 17:52:08,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:52:08,623 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1983117221, now seen corresponding path program 2 times [2022-03-15 17:52:08,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:08,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513725153] [2022-03-15 17:52:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:08,687 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 17:52:08,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:08,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513725153] [2022-03-15 17:52:08,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513725153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:08,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:08,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:08,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851083328] [2022-03-15 17:52:08,688 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:08,690 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:08,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 89 transitions. [2022-03-15 17:52:08,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:08,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:08,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:08,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:08,924 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 17:52:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:08,975 INFO L93 Difference]: Finished difference Result 98 states and 183 transitions. [2022-03-15 17:52:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:08,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 22 [2022-03-15 17:52:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:08,976 INFO L225 Difference]: With dead ends: 98 [2022-03-15 17:52:08,976 INFO L226 Difference]: Without dead ends: 49 [2022-03-15 17:52:08,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:08,976 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:08,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:52:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-15 17:52:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-03-15 17:52:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 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 17:52:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2022-03-15 17:52:08,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22 [2022-03-15 17:52:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:08,978 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2022-03-15 17:52:08,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 17:52:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2022-03-15 17:52:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 17:52:08,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:08,979 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] [2022-03-15 17:52:08,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:52:08,979 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash 412729051, now seen corresponding path program 3 times [2022-03-15 17:52:08,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:08,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939842951] [2022-03-15 17:52:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:09,078 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 17:52:09,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:09,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939842951] [2022-03-15 17:52:09,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939842951] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:09,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:09,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:09,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045137179] [2022-03-15 17:52:09,079 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:09,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:09,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 89 transitions. [2022-03-15 17:52:09,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:10,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12573#(and (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$r_buff0_thd2~0 0) (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd2~0 0) (= ~z$w_buff0~0 1))] [2022-03-15 17:52:10,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:52:10,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:10,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:52:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:10,315 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 17:52:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:10,403 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-03-15 17:52:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:52:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 22 [2022-03-15 17:52:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:10,403 INFO L225 Difference]: With dead ends: 60 [2022-03-15 17:52:10,404 INFO L226 Difference]: Without dead ends: 33 [2022-03-15 17:52:10,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:52:10,404 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:10,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-15 17:52:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-03-15 17:52:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:52:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-03-15 17:52:10,406 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2022-03-15 17:52:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:10,406 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-03-15 17:52:10,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 17:52:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-03-15 17:52:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 17:52:10,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:10,406 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] [2022-03-15 17:52:10,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:52:10,406 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -458616403, now seen corresponding path program 4 times [2022-03-15 17:52:10,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:10,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089912123] [2022-03-15 17:52:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:10,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:52:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:10,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:52:10,480 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:52:10,480 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:52:10,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-15 17:52:10,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:52:10,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 17:52:10,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 17:52:10,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:52:10,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:52:10,483 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:10,486 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:52:10,486 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:52:10,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:52:10 BasicIcfg [2022-03-15 17:52:10,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:52:10,532 INFO L158 Benchmark]: Toolchain (without parser) took 10911.08ms. Allocated memory was 201.3MB in the beginning and 399.5MB in the end (delta: 198.2MB). Free memory was 148.7MB in the beginning and 237.4MB in the end (delta: -88.7MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,532 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory was 167.2MB in the beginning and 167.2MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:52:10,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.37ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 165.0MB in the end (delta: -16.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.83ms. Allocated memory is still 201.3MB. Free memory was 165.0MB in the beginning and 162.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,533 INFO L158 Benchmark]: Boogie Preprocessor took 38.24ms. Allocated memory is still 201.3MB. Free memory was 162.4MB in the beginning and 160.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,533 INFO L158 Benchmark]: RCFGBuilder took 619.93ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 95.3MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,533 INFO L158 Benchmark]: TraceAbstraction took 9699.90ms. Allocated memory was 201.3MB in the beginning and 399.5MB in the end (delta: 198.2MB). Free memory was 94.8MB in the beginning and 237.4MB in the end (delta: -142.6MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2022-03-15 17:52:10,534 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.10ms. Allocated memory is still 201.3MB. Free memory was 167.2MB in the beginning and 167.2MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.37ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 165.0MB in the end (delta: -16.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.83ms. Allocated memory is still 201.3MB. Free memory was 165.0MB in the beginning and 162.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.24ms. Allocated memory is still 201.3MB. Free memory was 162.4MB in the beginning and 160.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 619.93ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 95.3MB in the end (delta: 64.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9699.90ms. Allocated memory was 201.3MB in the beginning and 399.5MB in the end (delta: 198.2MB). Free memory was 94.8MB in the beginning and 237.4MB in the end (delta: -142.6MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 129 PlacesBefore, 38 PlacesAfterwards, 121 TransitionsBefore, 29 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5716 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3143, positive: 2953, positive conditional: 0, positive unconditional: 2953, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1222, positive: 1186, positive conditional: 0, positive unconditional: 1186, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3143, positive: 1767, positive conditional: 0, positive unconditional: 1767, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 1222, unknown conditional: 0, unknown unconditional: 1222] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-2, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-1, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L766] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 846]: 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: 848]: 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: 844]: 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 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 45 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 236 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 17:52:10,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...