/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/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:52:51,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:52:51,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:52:51,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:52:51,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:52:51,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:52:51,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:52:51,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:52:51,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:52:51,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:52:51,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:52:51,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:52:51,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:52:51,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:52:51,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:52:51,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:52:51,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:52:51,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:52:51,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:52:51,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:52:51,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:52:51,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:52:51,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:52:51,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:52:51,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:52:51,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:52:51,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:52:51,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:52:51,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:52:51,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:52:51,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:52:51,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:52:51,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:52:51,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:52:51,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:52:51,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:52:51,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:52:51,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:52:51,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:52:51,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:52:51,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:52:51,266 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:52:51,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:52:51,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:52:51,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:52:51,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:52:51,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:52:51,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:52:51,295 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:52:51,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:52:51,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:52:51,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:52:51,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:52:51,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:52:51,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:52:51,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:52:51,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:52:51,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:51,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:52:51,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:52:51,299 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:52:51,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:52:51,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:52:51,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:52:51,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:52:51,507 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:52:51,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-03-15 17:52:51,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0cb39902/d2c7db1801144624a732756d7a29ccb4/FLAG812ed18f8 [2022-03-15 17:52:51,944 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:52:51,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-03-15 17:52:51,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0cb39902/d2c7db1801144624a732756d7a29ccb4/FLAG812ed18f8 [2022-03-15 17:52:52,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0cb39902/d2c7db1801144624a732756d7a29ccb4 [2022-03-15 17:52:52,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:52:52,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:52:52,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:52,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:52:52,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:52:52,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:52" (1/1) ... [2022-03-15 17:52:52,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d67e417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:52, skipping insertion in model container [2022-03-15 17:52:52,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:52" (1/1) ... [2022-03-15 17:52:52,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:52:52,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:52:52,579 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/mix046.opt.i[944,957] [2022-03-15 17:52:52,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:52,726 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:52:52,734 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/mix046.opt.i[944,957] [2022-03-15 17:52:52,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:52,822 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:52:52,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:52 WrapperNode [2022-03-15 17:52:52,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:52,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:52,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:52:52,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:52:52,828 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:52" (1/1) ... [2022-03-15 17:52:52,853 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:52" (1/1) ... [2022-03-15 17:52:52,890 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-03-15 17:52:52,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:52,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:52:52,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:52:52,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:52:52,898 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:52" (1/1) ... [2022-03-15 17:52:52,898 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:52" (1/1) ... [2022-03-15 17:52:52,907 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:52" (1/1) ... [2022-03-15 17:52:52,907 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:52" (1/1) ... [2022-03-15 17:52:52,912 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:52" (1/1) ... [2022-03-15 17:52:52,913 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:52" (1/1) ... [2022-03-15 17:52:52,932 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:52" (1/1) ... [2022-03-15 17:52:52,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:52:52,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:52:52,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:52:52,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:52:52,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:52" (1/1) ... [2022-03-15 17:52:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:52:52,957 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:52,973 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:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:52:52,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:52:52,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:52:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:52:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:52:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:52:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-15 17:52:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-15 17:52:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:52:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:52:52,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:52:52,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:52:52,989 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:53,094 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:52:53,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:52:53,532 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:52:53,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:52:53,769 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:52:53,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:53 BoogieIcfgContainer [2022-03-15 17:52:53,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:52:53,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:52:53,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:52:53,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:52:53,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:52:52" (1/3) ... [2022-03-15 17:52:53,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96b3c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:53, skipping insertion in model container [2022-03-15 17:52:53,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:52" (2/3) ... [2022-03-15 17:52:53,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96b3c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:53, skipping insertion in model container [2022-03-15 17:52:53,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:53" (3/3) ... [2022-03-15 17:52:53,778 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-03-15 17:52:53,781 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:52:53,781 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:52:53,782 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:52:53,782 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:52:53,827 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,827 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,827 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,827 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,828 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,829 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,829 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,829 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,830 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,831 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,831 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,832 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,832 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,832 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,833 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,834 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,835 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,836 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,836 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,836 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,837 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,837 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,837 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,837 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,837 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,838 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,839 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,839 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,839 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,839 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,839 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,840 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,840 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,840 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,840 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,841 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,842 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,843 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,844 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,846 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,847 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,847 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,854 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,855 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,856 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:53,858 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:52:53,903 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:52:53,909 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:53,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 17:52:53,924 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:52:53,934 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-03-15 17:52:53,936 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-03-15 17:52:53,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-03-15 17:52:53,991 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-03-15 17:52:53,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:52:53,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-03-15 17:52:54,000 INFO L116 LiptonReduction]: Number of co-enabled transitions 3168 [2022-03-15 17:53:07,361 INFO L131 LiptonReduction]: Checked pairs total: 6552 [2022-03-15 17:53:07,361 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-03-15 17:53:07,385 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2022-03-15 17:53:07,530 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2602 states, 2599 states have (on average 3.841477491342824) internal successors, (9984), 2601 states have internal predecessors, (9984), 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:53:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 2602 states, 2599 states have (on average 3.841477491342824) internal successors, (9984), 2601 states have internal predecessors, (9984), 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:53:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:53:07,548 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:07,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:07,549 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2025843606, now seen corresponding path program 1 times [2022-03-15 17:53:07,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:07,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003372371] [2022-03-15 17:53:07,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:07,817 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:53:07,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:07,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003372371] [2022-03-15 17:53:07,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003372371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:07,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:07,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:07,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615065209] [2022-03-15 17:53:07,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:07,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:07,829 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 17:53:07,829 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:07,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:07,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:07,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:07,851 INFO L87 Difference]: Start difference. First operand has 2602 states, 2599 states have (on average 3.841477491342824) internal successors, (9984), 2601 states have internal predecessors, (9984), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:53:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:07,941 INFO L93 Difference]: Finished difference Result 2202 states and 8344 transitions. [2022-03-15 17:53:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-03-15 17:53:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:07,965 INFO L225 Difference]: With dead ends: 2202 [2022-03-15 17:53:07,965 INFO L226 Difference]: Without dead ends: 2122 [2022-03-15 17:53:07,966 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:53:07,968 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:07,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-03-15 17:53:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2022-03-15 17:53:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 3.8095238095238093) internal successors, (8080), 2121 states have internal predecessors, (8080), 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:53:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2022-03-15 17:53:08,066 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2022-03-15 17:53:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:08,067 INFO L470 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2022-03-15 17:53:08,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:53:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2022-03-15 17:53:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:53:08,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:08,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:08,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:53:08,069 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1215613815, now seen corresponding path program 1 times [2022-03-15 17:53:08,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:08,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893229396] [2022-03-15 17:53:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:08,157 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:53:08,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:08,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893229396] [2022-03-15 17:53:08,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893229396] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:08,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:08,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:08,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1023836791] [2022-03-15 17:53:08,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:08,159 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:08,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 17:53:08,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:08,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:08,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:08,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:08,163 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:53:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:08,212 INFO L93 Difference]: Finished difference Result 2074 states and 7860 transitions. [2022-03-15 17:53:08,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:08,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:53:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:08,223 INFO L225 Difference]: With dead ends: 2074 [2022-03-15 17:53:08,223 INFO L226 Difference]: Without dead ends: 2074 [2022-03-15 17:53:08,224 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:53:08,228 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:08,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-03-15 17:53:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2022-03-15 17:53:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 3.7916063675832126) internal successors, (7860), 2073 states have internal predecessors, (7860), 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:53:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7860 transitions. [2022-03-15 17:53:08,278 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 7860 transitions. Word has length 11 [2022-03-15 17:53:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:08,278 INFO L470 AbstractCegarLoop]: Abstraction has 2074 states and 7860 transitions. [2022-03-15 17:53:08,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:53:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 7860 transitions. [2022-03-15 17:53:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:53:08,283 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:08,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:08,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:53:08,283 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -940209845, now seen corresponding path program 1 times [2022-03-15 17:53:08,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:08,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300954862] [2022-03-15 17:53:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:08,405 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:53:08,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:08,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300954862] [2022-03-15 17:53:08,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300954862] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:08,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:08,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:53:08,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28674665] [2022-03-15 17:53:08,406 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:08,407 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:08,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2022-03-15 17:53:08,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:08,524 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:08,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:08,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:08,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:08,525 INFO L87 Difference]: Start difference. First operand 2074 states and 7860 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:53:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:08,587 INFO L93 Difference]: Finished difference Result 1930 states and 7248 transitions. [2022-03-15 17:53:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:53:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:08,597 INFO L225 Difference]: With dead ends: 1930 [2022-03-15 17:53:08,597 INFO L226 Difference]: Without dead ends: 1930 [2022-03-15 17:53:08,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:53:08,601 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:08,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-03-15 17:53:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2022-03-15 17:53:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 3.7573872472783827) internal successors, (7248), 1929 states have internal predecessors, (7248), 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:53:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions. [2022-03-15 17:53:08,658 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 12 [2022-03-15 17:53:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions. [2022-03-15 17:53:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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:53:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions. [2022-03-15 17:53:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:53:08,661 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:08,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:08,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:53:08,661 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1598523512, now seen corresponding path program 1 times [2022-03-15 17:53:08,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:08,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889566455] [2022-03-15 17:53:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:08,757 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:53:08,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:08,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889566455] [2022-03-15 17:53:08,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889566455] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:08,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:08,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:08,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471608996] [2022-03-15 17:53:08,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:08,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:08,763 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2022-03-15 17:53:08,763 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:08,947 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:08,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:53:08,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:53:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:08,948 INFO L87 Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:53:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:09,015 INFO L93 Difference]: Finished difference Result 1882 states and 7036 transitions. [2022-03-15 17:53:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:53:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:53:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:09,025 INFO L225 Difference]: With dead ends: 1882 [2022-03-15 17:53:09,025 INFO L226 Difference]: Without dead ends: 1882 [2022-03-15 17:53:09,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:53:09,026 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:09,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 15 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-03-15 17:53:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-03-15 17:53:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1881 states have (on average 3.7405635300372144) internal successors, (7036), 1881 states have internal predecessors, (7036), 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:53:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 7036 transitions. [2022-03-15 17:53:09,065 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 7036 transitions. Word has length 14 [2022-03-15 17:53:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:09,065 INFO L470 AbstractCegarLoop]: Abstraction has 1882 states and 7036 transitions. [2022-03-15 17:53:09,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:53:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 7036 transitions. [2022-03-15 17:53:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:53:09,067 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:09,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:09,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:53:09,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1264159866, now seen corresponding path program 1 times [2022-03-15 17:53:09,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:09,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334533403] [2022-03-15 17:53:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:09,147 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:53:09,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:09,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334533403] [2022-03-15 17:53:09,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334533403] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:09,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:09,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:53:09,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [780406236] [2022-03-15 17:53:09,148 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:09,150 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:09,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 27 transitions. [2022-03-15 17:53:09,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:09,213 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:09,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:53:09,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:53:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:53:09,214 INFO L87 Difference]: Start difference. First operand 1882 states and 7036 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:53:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:09,313 INFO L93 Difference]: Finished difference Result 1850 states and 6892 transitions. [2022-03-15 17:53:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:53:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 15 [2022-03-15 17:53:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:09,322 INFO L225 Difference]: With dead ends: 1850 [2022-03-15 17:53:09,322 INFO L226 Difference]: Without dead ends: 1850 [2022-03-15 17:53:09,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:09,323 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 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:53:09,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2022-03-15 17:53:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2022-03-15 17:53:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 3.727420227149811) internal successors, (6892), 1849 states have internal predecessors, (6892), 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:53:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6892 transitions. [2022-03-15 17:53:09,362 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6892 transitions. Word has length 15 [2022-03-15 17:53:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:09,362 INFO L470 AbstractCegarLoop]: Abstraction has 1850 states and 6892 transitions. [2022-03-15 17:53:09,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:53:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6892 transitions. [2022-03-15 17:53:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:53:09,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:09,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:09,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:53:09,365 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 700535049, now seen corresponding path program 1 times [2022-03-15 17:53:09,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:09,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878018794] [2022-03-15 17:53:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:09,558 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:53:09,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:09,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878018794] [2022-03-15 17:53:09,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878018794] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:09,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:09,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:53:09,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798419413] [2022-03-15 17:53:09,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:09,561 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:09,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 34 transitions. [2022-03-15 17:53:09,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:11,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [35042#(and (<= 0 ~z$r_buff0_thd0~0) (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (<= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (<= 0 ~z$w_buff0_used~0) (<= ~z$w_buff0_used~0 0))] [2022-03-15 17:53:11,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:53:11,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:53:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:11,030 INFO L87 Difference]: Start difference. First operand 1850 states and 6892 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:53:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:11,165 INFO L93 Difference]: Finished difference Result 2282 states and 8548 transitions. [2022-03-15 17:53:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 16 [2022-03-15 17:53:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:11,177 INFO L225 Difference]: With dead ends: 2282 [2022-03-15 17:53:11,178 INFO L226 Difference]: Without dead ends: 2282 [2022-03-15 17:53:11,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:11,178 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:11,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2022-03-15 17:53:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2138. [2022-03-15 17:53:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 3.7192325690219934) internal successors, (7948), 2137 states have internal predecessors, (7948), 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:53:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 7948 transitions. [2022-03-15 17:53:11,235 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 7948 transitions. Word has length 16 [2022-03-15 17:53:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:11,235 INFO L470 AbstractCegarLoop]: Abstraction has 2138 states and 7948 transitions. [2022-03-15 17:53:11,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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:53:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 7948 transitions. [2022-03-15 17:53:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:53:11,238 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:11,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:11,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:53:11,238 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 534247309, now seen corresponding path program 2 times [2022-03-15 17:53:11,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:11,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806769906] [2022-03-15 17:53:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:53:11,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:11,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806769906] [2022-03-15 17:53:11,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806769906] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:11,344 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:11,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:53:11,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1681869298] [2022-03-15 17:53:11,344 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:11,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:11,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2022-03-15 17:53:11,351 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:11,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:11,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:53:11,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:53:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:11,452 INFO L87 Difference]: Start difference. First operand 2138 states and 7948 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:53:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:11,553 INFO L93 Difference]: Finished difference Result 2570 states and 9604 transitions. [2022-03-15 17:53:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 16 [2022-03-15 17:53:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:11,563 INFO L225 Difference]: With dead ends: 2570 [2022-03-15 17:53:11,563 INFO L226 Difference]: Without dead ends: 2570 [2022-03-15 17:53:11,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:11,564 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:11,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-03-15 17:53:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2282. [2022-03-15 17:53:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 3.7474791758000876) internal successors, (8548), 2281 states have internal predecessors, (8548), 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:53:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8548 transitions. [2022-03-15 17:53:11,607 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8548 transitions. Word has length 16 [2022-03-15 17:53:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:11,607 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 8548 transitions. [2022-03-15 17:53:11,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:53:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8548 transitions. [2022-03-15 17:53:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:53:11,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:11,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:11,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:53:11,610 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1417113959, now seen corresponding path program 1 times [2022-03-15 17:53:11,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:11,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117064492] [2022-03-15 17:53:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:11,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:53:11,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:11,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117064492] [2022-03-15 17:53:11,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117064492] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:11,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:11,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:11,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351631533] [2022-03-15 17:53:11,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:11,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:11,658 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2022-03-15 17:53:11,658 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:11,723 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:11,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:53:11,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:53:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:53:11,724 INFO L87 Difference]: Start difference. First operand 2282 states and 8548 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:53:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:11,801 INFO L93 Difference]: Finished difference Result 2390 states and 8162 transitions. [2022-03-15 17:53:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:53:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 16 [2022-03-15 17:53:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:11,808 INFO L225 Difference]: With dead ends: 2390 [2022-03-15 17:53:11,808 INFO L226 Difference]: Without dead ends: 1766 [2022-03-15 17:53:11,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:53:11,809 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:11,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 25 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2022-03-15 17:53:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2022-03-15 17:53:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 3.3813031161473086) internal successors, (5968), 1765 states have internal predecessors, (5968), 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:53:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5968 transitions. [2022-03-15 17:53:11,840 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 5968 transitions. Word has length 16 [2022-03-15 17:53:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:11,841 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 5968 transitions. [2022-03-15 17:53:11,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:53:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 5968 transitions. [2022-03-15 17:53:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:53:11,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:11,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:11,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:53:11,843 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1593575180, now seen corresponding path program 1 times [2022-03-15 17:53:11,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:11,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785864897] [2022-03-15 17:53:11,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:11,893 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:53:11,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:11,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785864897] [2022-03-15 17:53:11,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785864897] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:11,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:11,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:53:11,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947139936] [2022-03-15 17:53:11,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:11,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:11,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2022-03-15 17:53:11,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:12,009 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:12,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:53:12,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:53:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:53:12,011 INFO L87 Difference]: Start difference. First operand 1766 states and 5968 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:53:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:12,102 INFO L93 Difference]: Finished difference Result 1537 states and 4780 transitions. [2022-03-15 17:53:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:53:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 17 [2022-03-15 17:53:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:12,105 INFO L225 Difference]: With dead ends: 1537 [2022-03-15 17:53:12,105 INFO L226 Difference]: Without dead ends: 1147 [2022-03-15 17:53:12,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:53:12,106 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:12,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-03-15 17:53:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2022-03-15 17:53:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1146 states have (on average 3.0471204188481678) internal successors, (3492), 1146 states have internal predecessors, (3492), 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:53:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 3492 transitions. [2022-03-15 17:53:12,129 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 3492 transitions. Word has length 17 [2022-03-15 17:53:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:12,129 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 3492 transitions. [2022-03-15 17:53:12,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:53:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 3492 transitions. [2022-03-15 17:53:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 17:53:12,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:12,132 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:53:12,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:53:12,132 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 554280561, now seen corresponding path program 1 times [2022-03-15 17:53:12,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:12,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483260099] [2022-03-15 17:53:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:12,177 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:53:12,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:12,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483260099] [2022-03-15 17:53:12,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483260099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:12,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:12,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:53:12,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157973753] [2022-03-15 17:53:12,178 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:12,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:12,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 67 transitions. [2022-03-15 17:53:12,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:12,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:12,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:53:12,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:53:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:53:12,277 INFO L87 Difference]: Start difference. First operand 1147 states and 3492 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:53:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:12,325 INFO L93 Difference]: Finished difference Result 1657 states and 4919 transitions. [2022-03-15 17:53:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:53:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:53:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:12,327 INFO L225 Difference]: With dead ends: 1657 [2022-03-15 17:53:12,327 INFO L226 Difference]: Without dead ends: 1161 [2022-03-15 17:53:12,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:53:12,328 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:12,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:53:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-03-15 17:53:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1141. [2022-03-15 17:53:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 2.8780701754385967) internal successors, (3281), 1140 states have internal predecessors, (3281), 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:53:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3281 transitions. [2022-03-15 17:53:12,346 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3281 transitions. Word has length 19 [2022-03-15 17:53:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:12,346 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 3281 transitions. [2022-03-15 17:53:12,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:53:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3281 transitions. [2022-03-15 17:53:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:53:12,348 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:12,348 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] [2022-03-15 17:53:12,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:53:12,348 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:12,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2037751013, now seen corresponding path program 1 times [2022-03-15 17:53:12,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:12,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566168601] [2022-03-15 17:53:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:12,406 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:53:12,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:12,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566168601] [2022-03-15 17:53:12,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566168601] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:12,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:12,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:53:12,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636431174] [2022-03-15 17:53:12,407 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:12,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:12,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 139 transitions. [2022-03-15 17:53:12,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:12,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [62456#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:53:12,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:53:12,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:53:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:53:12,703 INFO L87 Difference]: Start difference. First operand 1141 states and 3281 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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:53:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:12,799 INFO L93 Difference]: Finished difference Result 1003 states and 2841 transitions. [2022-03-15 17:53:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:53:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 20 [2022-03-15 17:53:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:12,801 INFO L225 Difference]: With dead ends: 1003 [2022-03-15 17:53:12,801 INFO L226 Difference]: Without dead ends: 877 [2022-03-15 17:53:12,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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:53:12,801 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:12,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 44 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-03-15 17:53:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 805. [2022-03-15 17:53:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.8694029850746268) internal successors, (2307), 804 states have internal predecessors, (2307), 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:53:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2307 transitions. [2022-03-15 17:53:12,813 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 2307 transitions. Word has length 20 [2022-03-15 17:53:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:12,834 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 2307 transitions. [2022-03-15 17:53:12,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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:53:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 2307 transitions. [2022-03-15 17:53:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:53:12,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:12,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:12,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:53:12,837 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 566876883, now seen corresponding path program 1 times [2022-03-15 17:53:12,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:12,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89965865] [2022-03-15 17:53:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:12,876 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:53:12,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:12,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89965865] [2022-03-15 17:53:12,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89965865] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:12,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:12,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:12,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103381198] [2022-03-15 17:53:12,876 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:12,879 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:12,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 189 states and 455 transitions. [2022-03-15 17:53:12,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:13,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:13,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:53:13,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:53:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:53:13,729 INFO L87 Difference]: Start difference. First operand 805 states and 2307 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:13,795 INFO L93 Difference]: Finished difference Result 1032 states and 2891 transitions. [2022-03-15 17:53:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 23 [2022-03-15 17:53:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:13,796 INFO L225 Difference]: With dead ends: 1032 [2022-03-15 17:53:13,796 INFO L226 Difference]: Without dead ends: 592 [2022-03-15 17:53:13,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 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:53:13,797 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:13,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-03-15 17:53:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 589. [2022-03-15 17:53:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 2.608843537414966) internal successors, (1534), 588 states have internal predecessors, (1534), 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:53:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1534 transitions. [2022-03-15 17:53:13,806 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1534 transitions. Word has length 23 [2022-03-15 17:53:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:13,807 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1534 transitions. [2022-03-15 17:53:13,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:53:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1534 transitions. [2022-03-15 17:53:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:53:13,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:13,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:13,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 17:53:13,808 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash 271618282, now seen corresponding path program 1 times [2022-03-15 17:53:13,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:13,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131718580] [2022-03-15 17:53:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:13,864 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:53:13,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:13,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131718580] [2022-03-15 17:53:13,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131718580] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:13,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:13,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:53:13,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834614675] [2022-03-15 17:53:13,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:13,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:13,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 241 states and 610 transitions. [2022-03-15 17:53:13,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:14,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:53:14,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:53:14,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:53:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:53:14,883 INFO L87 Difference]: Start difference. First operand 589 states and 1534 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:53:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:14,951 INFO L93 Difference]: Finished difference Result 791 states and 1991 transitions. [2022-03-15 17:53:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:53:14,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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 23 [2022-03-15 17:53:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:14,953 INFO L225 Difference]: With dead ends: 791 [2022-03-15 17:53:14,953 INFO L226 Difference]: Without dead ends: 490 [2022-03-15 17:53:14,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 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:53:14,954 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:14,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-15 17:53:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 464. [2022-03-15 17:53:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.3304535637149026) internal successors, (1079), 463 states have internal predecessors, (1079), 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:53:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1079 transitions. [2022-03-15 17:53:14,963 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1079 transitions. Word has length 23 [2022-03-15 17:53:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:14,963 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1079 transitions. [2022-03-15 17:53:14,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 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:53:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1079 transitions. [2022-03-15 17:53:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 17:53:14,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:14,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:14,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 17:53:14,965 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1035832766, now seen corresponding path program 1 times [2022-03-15 17:53:14,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:14,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764169264] [2022-03-15 17:53:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:15,042 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:53:15,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:15,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764169264] [2022-03-15 17:53:15,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764169264] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:15,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:15,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:53:15,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201068473] [2022-03-15 17:53:15,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:15,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:15,084 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 154 transitions. [2022-03-15 17:53:15,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:15,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [69022#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:53:15,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:53:15,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:53:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:53:15,479 INFO L87 Difference]: Start difference. First operand 464 states and 1079 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:53:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:15,571 INFO L93 Difference]: Finished difference Result 439 states and 1030 transitions. [2022-03-15 17:53:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:53:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 23 [2022-03-15 17:53:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:15,572 INFO L225 Difference]: With dead ends: 439 [2022-03-15 17:53:15,572 INFO L226 Difference]: Without dead ends: 92 [2022-03-15 17:53:15,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:53:15,573 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 102 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:15,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 28 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-15 17:53:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-03-15 17:53:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1758241758241756) internal successors, (198), 91 states have internal predecessors, (198), 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:53:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2022-03-15 17:53:15,574 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 23 [2022-03-15 17:53:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:15,575 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2022-03-15 17:53:15,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:53:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2022-03-15 17:53:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 17:53:15,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:15,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:15,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 17:53:15,575 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 751775604, now seen corresponding path program 1 times [2022-03-15 17:53:15,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:15,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965475253] [2022-03-15 17:53:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:53:15,759 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:53:15,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:53:15,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965475253] [2022-03-15 17:53:15,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965475253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:53:15,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:53:15,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:53:15,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004246418] [2022-03-15 17:53:15,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:53:15,763 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:53:15,785 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 135 transitions. [2022-03-15 17:53:15,785 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:53:16,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [69656#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (not (= (mod ~z$r_buff0_thd4~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (not (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$w_buff0_used~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< 0 (+ (div ~z$w_buff1_used~0 256) 1)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (or (not (= (mod ~z$r_buff1_thd4~0 256) 0)) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))] [2022-03-15 17:53:16,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:53:16,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:53:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:53:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:53:16,548 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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:53:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:53:16,660 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2022-03-15 17:53:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:53:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 26 [2022-03-15 17:53:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:53:16,660 INFO L225 Difference]: With dead ends: 118 [2022-03-15 17:53:16,660 INFO L226 Difference]: Without dead ends: 64 [2022-03-15 17:53:16,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:53:16,661 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:53:16,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:53:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-15 17:53:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-03-15 17:53:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9365079365079365) internal successors, (122), 63 states have internal predecessors, (122), 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:53:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2022-03-15 17:53:16,662 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2022-03-15 17:53:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:53:16,663 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2022-03-15 17:53:16,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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:53:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2022-03-15 17:53:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 17:53:16,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:53:16,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:16,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 17:53:16,663 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 17:53:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:53:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1490567244, now seen corresponding path program 2 times [2022-03-15 17:53:16,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:53:16,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350891009] [2022-03-15 17:53:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:53:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:53:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:16,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:53:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:53:16,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:53:16,778 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:53:16,779 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-15 17:53:16,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-15 17:53:16,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-15 17:53:16,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-15 17:53:16,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-15 17:53:16,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-15 17:53:16,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-15 17:53:16,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 17:53:16,783 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:53:16,786 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:53:16,786 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:53:16,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:53:16 BasicIcfg [2022-03-15 17:53:16,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:53:16,861 INFO L158 Benchmark]: Toolchain (without parser) took 24538.64ms. Allocated memory was 216.0MB in the beginning and 507.5MB in the end (delta: 291.5MB). Free memory was 156.7MB in the beginning and 226.9MB in the end (delta: -70.2MB). Peak memory consumption was 222.0MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,862 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory was 174.9MB in the beginning and 174.9MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:53:16,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.63ms. Allocated memory was 216.0MB in the beginning and 351.3MB in the end (delta: 135.3MB). Free memory was 156.4MB in the beginning and 307.4MB in the end (delta: -150.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.75ms. Allocated memory is still 351.3MB. Free memory was 307.4MB in the beginning and 304.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,862 INFO L158 Benchmark]: Boogie Preprocessor took 44.05ms. Allocated memory is still 351.3MB. Free memory was 304.2MB in the beginning and 302.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,862 INFO L158 Benchmark]: RCFGBuilder took 836.41ms. Allocated memory is still 351.3MB. Free memory was 302.1MB in the beginning and 227.7MB in the end (delta: 74.4MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,863 INFO L158 Benchmark]: TraceAbstraction took 23088.06ms. Allocated memory was 351.3MB in the beginning and 507.5MB in the end (delta: 156.2MB). Free memory was 227.1MB in the beginning and 226.9MB in the end (delta: 267.6kB). Peak memory consumption was 156.5MB. Max. memory is 8.0GB. [2022-03-15 17:53:16,866 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 216.0MB. Free memory was 174.9MB in the beginning and 174.9MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.63ms. Allocated memory was 216.0MB in the beginning and 351.3MB in the end (delta: 135.3MB). Free memory was 156.4MB in the beginning and 307.4MB in the end (delta: -150.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.75ms. Allocated memory is still 351.3MB. Free memory was 307.4MB in the beginning and 304.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.05ms. Allocated memory is still 351.3MB. Free memory was 304.2MB in the beginning and 302.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 836.41ms. Allocated memory is still 351.3MB. Free memory was 302.1MB in the beginning and 227.7MB in the end (delta: 74.4MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * TraceAbstraction took 23088.06ms. Allocated memory was 351.3MB in the beginning and 507.5MB in the end (delta: 156.2MB). Free memory was 227.1MB in the beginning and 226.9MB in the end (delta: 267.6kB). Peak memory consumption was 156.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4s, 148 PlacesBefore, 45 PlacesAfterwards, 137 TransitionsBefore, 32 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, 6552 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2954, positive: 2784, positive conditional: 0, positive unconditional: 2784, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1623, positive: 1569, positive conditional: 0, positive unconditional: 1569, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2954, positive: 1215, positive conditional: 0, positive unconditional: 1215, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 1623, unknown conditional: 0, unknown unconditional: 1623] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [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$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-2, t1221={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-1, t1221={5:0}, t1222={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=1, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=1, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L788] 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) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] 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) [L788] 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) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 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 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 853]: 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: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 22.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1316 IncrementalHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 123 mSDtfsCounter, 1316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 455 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 553 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-15 17:53:16,903 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...