/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:59:04,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:59:04,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:59:04,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:59:04,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:59:04,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:59:04,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:59:04,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:59:04,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:59:04,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:59:04,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:59:04,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:59:04,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:59:04,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:59:04,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:59:04,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:59:04,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:59:04,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:59:04,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:59:04,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:59:04,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:59:04,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:59:04,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:59:04,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:59:04,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:59:04,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:59:04,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:59:04,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:59:04,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:59:04,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:59:04,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:59:04,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:59:04,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:59:04,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:59:04,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:59:04,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:59:04,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:59:04,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:59:04,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:59:04,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:59:04,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:59:04,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 14:59:04,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:59:04,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:59:04,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:59:04,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:59:04,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:59:04,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:59:04,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:59:04,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:59:04,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:59:04,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:59:04,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:59:04,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:59:04,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:59:04,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:59:04,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:59:04,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:59:04,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 14:59:04,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:59:04,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:59:04,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:59:04,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:59:04,677 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:59:04,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-03-01 14:59:04,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829d8ed74/80aa2cb56e164c9fbad9eb468ebeb53d/FLAGa9b76d55b [2022-03-01 14:59:05,163 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:59:05,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-03-01 14:59:05,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829d8ed74/80aa2cb56e164c9fbad9eb468ebeb53d/FLAGa9b76d55b [2022-03-01 14:59:05,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829d8ed74/80aa2cb56e164c9fbad9eb468ebeb53d [2022-03-01 14:59:05,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:59:05,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:59:05,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:59:05,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:59:05,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:59:05,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa4fc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05, skipping insertion in model container [2022-03-01 14:59:05,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:59:05,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:59:05,374 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-01 14:59:05,570 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-divine/ring_2w1r-1.i[39095,39108] [2022-03-01 14:59:05,574 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-divine/ring_2w1r-1.i[39180,39193] [2022-03-01 14:59:05,575 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-divine/ring_2w1r-1.i[39232,39245] [2022-03-01 14:59:05,610 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-divine/ring_2w1r-1.i[49388,49401] [2022-03-01 14:59:05,610 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-divine/ring_2w1r-1.i[49437,49450] [2022-03-01 14:59:05,612 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-divine/ring_2w1r-1.i[49565,49578] [2022-03-01 14:59:05,612 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-divine/ring_2w1r-1.i[49623,49636] [2022-03-01 14:59:05,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:59:05,622 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:59:05,629 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-03-01 14:59:05,642 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-divine/ring_2w1r-1.i[39095,39108] [2022-03-01 14:59:05,643 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-divine/ring_2w1r-1.i[39180,39193] [2022-03-01 14:59:05,643 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-divine/ring_2w1r-1.i[39232,39245] [2022-03-01 14:59:05,650 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-divine/ring_2w1r-1.i[49388,49401] [2022-03-01 14:59:05,651 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-divine/ring_2w1r-1.i[49437,49450] [2022-03-01 14:59:05,651 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-divine/ring_2w1r-1.i[49565,49578] [2022-03-01 14:59:05,652 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-divine/ring_2w1r-1.i[49623,49636] [2022-03-01 14:59:05,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:59:05,706 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:59:05,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05 WrapperNode [2022-03-01 14:59:05,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:59:05,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:59:05,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:59:05,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:59:05,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,756 INFO L137 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-03-01 14:59:05,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:59:05,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:59:05,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:59:05,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:59:05,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:59:05,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:59:05,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:59:05,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:59:05,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (1/1) ... [2022-03-01 14:59:05,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:59:05,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:59:05,821 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-01 14:59:05,823 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-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-03-01 14:59:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-03-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-03-01 14:59:05,846 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-03-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 14:59:05,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:59:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 14:59:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:59:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:59:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:59:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:59:05,849 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:59:05,964 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:59:05,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:59:06,226 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:59:06,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:59:06,234 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-01 14:59:06,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:59:06 BoogieIcfgContainer [2022-03-01 14:59:06,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:59:06,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:59:06,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:59:06,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:59:06,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:59:05" (1/3) ... [2022-03-01 14:59:06,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c5243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:59:06, skipping insertion in model container [2022-03-01 14:59:06,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:59:05" (2/3) ... [2022-03-01 14:59:06,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c5243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:59:06, skipping insertion in model container [2022-03-01 14:59:06,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:59:06" (3/3) ... [2022-03-01 14:59:06,241 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-03-01 14:59:06,244 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:59:06,244 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:59:06,244 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-01 14:59:06,244 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:59:06,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,313 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,314 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,315 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,316 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,316 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,317 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,318 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,319 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,320 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,321 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,322 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,323 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,324 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,325 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,326 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,327 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,328 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,330 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,330 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,330 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,330 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,331 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,332 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,333 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,334 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,339 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,340 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,341 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,342 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,343 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,344 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,345 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,346 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,347 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,348 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,349 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,350 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,351 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,352 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,353 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,354 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,355 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,360 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,361 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,362 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,363 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,364 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,365 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,366 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,367 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,368 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,368 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,369 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,369 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,369 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,369 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,369 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,370 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,371 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,372 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,372 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,372 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,372 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,373 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,373 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,373 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,373 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,375 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,375 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,378 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,379 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,380 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,381 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,382 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,383 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,384 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,384 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,384 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,385 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,386 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,387 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,388 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,389 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,390 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,390 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,390 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,391 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,392 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,392 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,392 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,395 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,396 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_~r~1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,397 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,397 WARN L322 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~val~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,400 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,401 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,402 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,403 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~r~2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,404 WARN L322 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:59:06,408 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-01 14:59:06,452 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:59:06,456 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 14:59:06,457 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-03-01 14:59:06,464 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 223 places, 233 transitions, 482 flow [2022-03-01 14:59:08,777 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 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-01 14:59:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 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-01 14:59:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-01 14:59:09,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:09,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:09,091 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash 508547485, now seen corresponding path program 1 times [2022-03-01 14:59:09,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:09,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628546534] [2022-03-01 14:59:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:09,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:09,688 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-01 14:59:09,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:09,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628546534] [2022-03-01 14:59:09,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628546534] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:09,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:09,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-01 14:59:09,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088357596] [2022-03-01 14:59:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:09,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 14:59:09,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 14:59:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-03-01 14:59:09,909 INFO L87 Difference]: Start difference. First operand has 105370 states, 105365 states have (on average 3.248697385279742) internal successors, (342299), 105369 states have internal predecessors, (342299), 0 states have call successors, (0), 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 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:13,122 INFO L93 Difference]: Finished difference Result 119975 states and 368792 transitions. [2022-03-01 14:59:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 14:59:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-03-01 14:59:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:13,854 INFO L225 Difference]: With dead ends: 119975 [2022-03-01 14:59:13,854 INFO L226 Difference]: Without dead ends: 119915 [2022-03-01 14:59:13,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1204, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 14:59:13,859 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1275 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:13,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1275 Valid, 4245 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 14:59:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119915 states. [2022-03-01 14:59:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119915 to 113165. [2022-03-01 14:59:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113165 states, 113161 states have (on average 3.076077447177031) internal successors, (348092), 113164 states have internal predecessors, (348092), 0 states have call successors, (0), 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-01 14:59:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113165 states to 113165 states and 348092 transitions. [2022-03-01 14:59:17,773 INFO L78 Accepts]: Start accepts. Automaton has 113165 states and 348092 transitions. Word has length 90 [2022-03-01 14:59:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:17,773 INFO L470 AbstractCegarLoop]: Abstraction has 113165 states and 348092 transitions. [2022-03-01 14:59:17,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:59:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 113165 states and 348092 transitions. [2022-03-01 14:59:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-03-01 14:59:18,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:18,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:18,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:59:18,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1144672626, now seen corresponding path program 1 times [2022-03-01 14:59:18,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:18,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954258937] [2022-03-01 14:59:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:18,473 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-01 14:59:18,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:18,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954258937] [2022-03-01 14:59:18,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954258937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:18,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:18,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-01 14:59:18,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454306482] [2022-03-01 14:59:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:18,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-01 14:59:18,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-01 14:59:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-03-01 14:59:18,475 INFO L87 Difference]: Start difference. First operand 113165 states and 348092 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 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-01 14:59:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:21,281 INFO L93 Difference]: Finished difference Result 155725 states and 478789 transitions. [2022-03-01 14:59:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 14:59:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-03-01 14:59:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:21,995 INFO L225 Difference]: With dead ends: 155725 [2022-03-01 14:59:21,995 INFO L226 Difference]: Without dead ends: 154885 [2022-03-01 14:59:21,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2022-03-01 14:59:21,997 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 2395 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:21,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2395 Valid, 5528 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 14:59:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154885 states. [2022-03-01 14:59:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154885 to 132244. [2022-03-01 14:59:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132244 states, 132240 states have (on average 3.0773744706594073) internal successors, (406952), 132243 states have internal predecessors, (406952), 0 states have call successors, (0), 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-01 14:59:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132244 states to 132244 states and 406952 transitions. [2022-03-01 14:59:25,963 INFO L78 Accepts]: Start accepts. Automaton has 132244 states and 406952 transitions. Word has length 95 [2022-03-01 14:59:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:25,963 INFO L470 AbstractCegarLoop]: Abstraction has 132244 states and 406952 transitions. [2022-03-01 14:59:25,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 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-01 14:59:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 132244 states and 406952 transitions. [2022-03-01 14:59:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 14:59:26,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:26,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:26,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:59:26,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1175061358, now seen corresponding path program 1 times [2022-03-01 14:59:26,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:26,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667623460] [2022-03-01 14:59:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:27,058 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-01 14:59:27,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:27,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667623460] [2022-03-01 14:59:27,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667623460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:27,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:27,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 14:59:27,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212538793] [2022-03-01 14:59:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:27,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 14:59:27,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 14:59:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-03-01 14:59:27,060 INFO L87 Difference]: Start difference. First operand 132244 states and 406952 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 14:59:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:34,425 INFO L93 Difference]: Finished difference Result 156625 states and 481546 transitions. [2022-03-01 14:59:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-01 14:59:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 14:59:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:35,022 INFO L225 Difference]: With dead ends: 156625 [2022-03-01 14:59:35,023 INFO L226 Difference]: Without dead ends: 156625 [2022-03-01 14:59:35,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1568, Invalid=4284, Unknown=0, NotChecked=0, Total=5852 [2022-03-01 14:59:35,026 INFO L933 BasicCegarLoop]: 1139 mSDtfsCounter, 3939 mSDsluCounter, 7701 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3939 SdHoareTripleChecker+Valid, 8840 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:35,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3939 Valid, 8840 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 14:59:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156625 states. [2022-03-01 14:59:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156625 to 133003. [2022-03-01 14:59:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133003 states, 132999 states have (on average 3.0775494552590623) internal successors, (409311), 133002 states have internal predecessors, (409311), 0 states have call successors, (0), 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-01 14:59:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133003 states to 133003 states and 409311 transitions. [2022-03-01 14:59:39,164 INFO L78 Accepts]: Start accepts. Automaton has 133003 states and 409311 transitions. Word has length 114 [2022-03-01 14:59:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:39,165 INFO L470 AbstractCegarLoop]: Abstraction has 133003 states and 409311 transitions. [2022-03-01 14:59:39,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 14:59:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 133003 states and 409311 transitions. [2022-03-01 14:59:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 14:59:39,297 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:39,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:39,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 14:59:39,298 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash 788572584, now seen corresponding path program 2 times [2022-03-01 14:59:39,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:39,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820380187] [2022-03-01 14:59:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:39,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:39,957 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-01 14:59:39,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:39,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820380187] [2022-03-01 14:59:39,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820380187] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:39,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:39,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-01 14:59:39,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387415843] [2022-03-01 14:59:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:39,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 14:59:39,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 14:59:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-03-01 14:59:39,959 INFO L87 Difference]: Start difference. First operand 133003 states and 409311 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 14:59:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:59:46,659 INFO L93 Difference]: Finished difference Result 166429 states and 511686 transitions. [2022-03-01 14:59:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-01 14:59:46,659 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 14:59:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:59:47,424 INFO L225 Difference]: With dead ends: 166429 [2022-03-01 14:59:47,425 INFO L226 Difference]: Without dead ends: 166429 [2022-03-01 14:59:47,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1293, Invalid=3129, Unknown=0, NotChecked=0, Total=4422 [2022-03-01 14:59:47,432 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 3226 mSDsluCounter, 7751 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3226 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 14:59:47,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3226 Valid, 8806 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 14:59:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166429 states. [2022-03-01 14:59:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166429 to 135742. [2022-03-01 14:59:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135742 states, 135738 states have (on average 3.077465411307077) internal successors, (417729), 135741 states have internal predecessors, (417729), 0 states have call successors, (0), 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-01 14:59:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135742 states to 135742 states and 417729 transitions. [2022-03-01 14:59:51,721 INFO L78 Accepts]: Start accepts. Automaton has 135742 states and 417729 transitions. Word has length 114 [2022-03-01 14:59:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:59:51,722 INFO L470 AbstractCegarLoop]: Abstraction has 135742 states and 417729 transitions. [2022-03-01 14:59:51,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 14:59:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 135742 states and 417729 transitions. [2022-03-01 14:59:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 14:59:51,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:59:51,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:59:51,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 14:59:51,837 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 14:59:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:59:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 124783814, now seen corresponding path program 3 times [2022-03-01 14:59:51,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:59:51,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85917713] [2022-03-01 14:59:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:59:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:59:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:59:52,509 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-01 14:59:52,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:59:52,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85917713] [2022-03-01 14:59:52,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85917713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:59:52,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:59:52,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 14:59:52,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25706101] [2022-03-01 14:59:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:59:52,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 14:59:52,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:59:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 14:59:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 14:59:52,510 INFO L87 Difference]: Start difference. First operand 135742 states and 417729 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:01,729 INFO L93 Difference]: Finished difference Result 178621 states and 549053 transitions. [2022-03-01 15:00:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-01 15:00:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:00:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:02,242 INFO L225 Difference]: With dead ends: 178621 [2022-03-01 15:00:02,242 INFO L226 Difference]: Without dead ends: 178621 [2022-03-01 15:00:02,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1794, Invalid=5012, Unknown=0, NotChecked=0, Total=6806 [2022-03-01 15:00:02,245 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 4231 mSDsluCounter, 9352 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 10557 SdHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:02,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4231 Valid, 10557 Invalid, 3330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3232 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 15:00:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178621 states. [2022-03-01 15:00:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178621 to 136501. [2022-03-01 15:00:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136501 states, 136497 states have (on average 3.077635405906357) internal successors, (420088), 136500 states have internal predecessors, (420088), 0 states have call successors, (0), 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-01 15:00:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136501 states to 136501 states and 420088 transitions. [2022-03-01 15:00:07,108 INFO L78 Accepts]: Start accepts. Automaton has 136501 states and 420088 transitions. Word has length 114 [2022-03-01 15:00:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:07,109 INFO L470 AbstractCegarLoop]: Abstraction has 136501 states and 420088 transitions. [2022-03-01 15:00:07,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 136501 states and 420088 transitions. [2022-03-01 15:00:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:00:07,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:07,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:07,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 15:00:07,225 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2145687926, now seen corresponding path program 4 times [2022-03-01 15:00:07,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:07,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032239817] [2022-03-01 15:00:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:07,866 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-01 15:00:07,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:07,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032239817] [2022-03-01 15:00:07,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032239817] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:07,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:07,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:07,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009605375] [2022-03-01 15:00:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:07,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:07,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:07,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:07,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:07,867 INFO L87 Difference]: Start difference. First operand 136501 states and 420088 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:17,483 INFO L93 Difference]: Finished difference Result 178486 states and 548701 transitions. [2022-03-01 15:00:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 15:00:17,484 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:00:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:18,045 INFO L225 Difference]: With dead ends: 178486 [2022-03-01 15:00:18,045 INFO L226 Difference]: Without dead ends: 178486 [2022-03-01 15:00:18,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1921, Invalid=5389, Unknown=0, NotChecked=0, Total=7310 [2022-03-01 15:00:18,047 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 3659 mSDsluCounter, 11889 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3659 SdHoareTripleChecker+Valid, 13155 SdHoareTripleChecker+Invalid, 4208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:18,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3659 Valid, 13155 Invalid, 4208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:00:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178486 states. [2022-03-01 15:00:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178486 to 136699. [2022-03-01 15:00:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136699 states, 136695 states have (on average 3.0777570503676066) internal successors, (420714), 136698 states have internal predecessors, (420714), 0 states have call successors, (0), 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-01 15:00:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136699 states to 136699 states and 420714 transitions. [2022-03-01 15:00:22,122 INFO L78 Accepts]: Start accepts. Automaton has 136699 states and 420714 transitions. Word has length 114 [2022-03-01 15:00:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:22,122 INFO L470 AbstractCegarLoop]: Abstraction has 136699 states and 420714 transitions. [2022-03-01 15:00:22,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 136699 states and 420714 transitions. [2022-03-01 15:00:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:00:22,571 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:22,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:22,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 15:00:22,571 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash 793775866, now seen corresponding path program 5 times [2022-03-01 15:00:22,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:22,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500915179] [2022-03-01 15:00:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:23,229 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-01 15:00:23,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:23,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500915179] [2022-03-01 15:00:23,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500915179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:23,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:23,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:23,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995573187] [2022-03-01 15:00:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:23,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:23,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:23,231 INFO L87 Difference]: Start difference. First operand 136699 states and 420714 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:33,877 INFO L93 Difference]: Finished difference Result 177595 states and 545975 transitions. [2022-03-01 15:00:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-01 15:00:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:00:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:34,413 INFO L225 Difference]: With dead ends: 177595 [2022-03-01 15:00:34,413 INFO L226 Difference]: Without dead ends: 177595 [2022-03-01 15:00:34,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2184, Invalid=6188, Unknown=0, NotChecked=0, Total=8372 [2022-03-01 15:00:34,415 INFO L933 BasicCegarLoop]: 1390 mSDtfsCounter, 3404 mSDsluCounter, 13145 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3404 SdHoareTripleChecker+Valid, 14535 SdHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:34,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3404 Valid, 14535 Invalid, 4714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:00:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177595 states. [2022-03-01 15:00:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177595 to 137062. [2022-03-01 15:00:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137062 states, 137058 states have (on average 3.077872141721023) internal successors, (421847), 137061 states have internal predecessors, (421847), 0 states have call successors, (0), 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-01 15:00:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137062 states to 137062 states and 421847 transitions. [2022-03-01 15:00:38,417 INFO L78 Accepts]: Start accepts. Automaton has 137062 states and 421847 transitions. Word has length 114 [2022-03-01 15:00:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:38,417 INFO L470 AbstractCegarLoop]: Abstraction has 137062 states and 421847 transitions. [2022-03-01 15:00:38,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 137062 states and 421847 transitions. [2022-03-01 15:00:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:00:38,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:38,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:38,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 15:00:38,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -767686718, now seen corresponding path program 6 times [2022-03-01 15:00:38,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:38,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792492144] [2022-03-01 15:00:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:38,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:39,562 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-01 15:00:39,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:39,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792492144] [2022-03-01 15:00:39,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792492144] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:39,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:39,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:39,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949451485] [2022-03-01 15:00:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:39,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:39,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:39,564 INFO L87 Difference]: Start difference. First operand 137062 states and 421847 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:00:50,755 INFO L93 Difference]: Finished difference Result 176737 states and 543243 transitions. [2022-03-01 15:00:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-03-01 15:00:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:00:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:00:51,252 INFO L225 Difference]: With dead ends: 176737 [2022-03-01 15:00:51,252 INFO L226 Difference]: Without dead ends: 176737 [2022-03-01 15:00:51,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2492, Invalid=7014, Unknown=0, NotChecked=0, Total=9506 [2022-03-01 15:00:51,255 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 3351 mSDsluCounter, 14035 mSDsCounter, 0 mSdLazyCounter, 4966 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 15531 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:00:51,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3351 Valid, 15531 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4966 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:00:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176737 states. [2022-03-01 15:00:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176737 to 137095. [2022-03-01 15:00:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137095 states, 137091 states have (on average 3.077860691073812) internal successors, (421947), 137094 states have internal predecessors, (421947), 0 states have call successors, (0), 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-01 15:00:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137095 states to 137095 states and 421947 transitions. [2022-03-01 15:00:55,739 INFO L78 Accepts]: Start accepts. Automaton has 137095 states and 421947 transitions. Word has length 114 [2022-03-01 15:00:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:00:55,739 INFO L470 AbstractCegarLoop]: Abstraction has 137095 states and 421947 transitions. [2022-03-01 15:00:55,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:00:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137095 states and 421947 transitions. [2022-03-01 15:00:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:00:55,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:00:55,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:00:55,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 15:00:55,871 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:00:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:00:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1979149546, now seen corresponding path program 7 times [2022-03-01 15:00:55,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:00:55,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147790829] [2022-03-01 15:00:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:00:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:00:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:00:57,199 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-01 15:00:57,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:00:57,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147790829] [2022-03-01 15:00:57,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147790829] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:00:57,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:00:57,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:00:57,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272753849] [2022-03-01 15:00:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:00:57,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:00:57,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:00:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:00:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:00:57,200 INFO L87 Difference]: Start difference. First operand 137095 states and 421947 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:08,688 INFO L93 Difference]: Finished difference Result 168406 states and 517694 transitions. [2022-03-01 15:01:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:01:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:01:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:09,151 INFO L225 Difference]: With dead ends: 168406 [2022-03-01 15:01:09,151 INFO L226 Difference]: Without dead ends: 168406 [2022-03-01 15:01:09,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2323, Invalid=5687, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:01:09,153 INFO L933 BasicCegarLoop]: 1500 mSDtfsCounter, 3033 mSDsluCounter, 11199 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 12699 SdHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:09,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3033 Valid, 12699 Invalid, 3977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:01:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168406 states. [2022-03-01 15:01:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168406 to 142999. [2022-03-01 15:01:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142999 states, 142995 states have (on average 3.0793943844190355) internal successors, (440338), 142998 states have internal predecessors, (440338), 0 states have call successors, (0), 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-01 15:01:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142999 states to 142999 states and 440338 transitions. [2022-03-01 15:01:13,301 INFO L78 Accepts]: Start accepts. Automaton has 142999 states and 440338 transitions. Word has length 114 [2022-03-01 15:01:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:13,301 INFO L470 AbstractCegarLoop]: Abstraction has 142999 states and 440338 transitions. [2022-03-01 15:01:13,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 142999 states and 440338 transitions. [2022-03-01 15:01:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:01:13,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:13,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:13,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 15:01:13,430 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -386091310, now seen corresponding path program 8 times [2022-03-01 15:01:13,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:13,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138574685] [2022-03-01 15:01:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:14,097 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-01 15:01:14,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:14,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138574685] [2022-03-01 15:01:14,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138574685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:14,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:14,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:14,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477020843] [2022-03-01 15:01:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:14,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:14,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:14,098 INFO L87 Difference]: Start difference. First operand 142999 states and 440338 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:21,797 INFO L93 Difference]: Finished difference Result 187159 states and 575304 transitions. [2022-03-01 15:01:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:01:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:01:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:22,395 INFO L225 Difference]: With dead ends: 187159 [2022-03-01 15:01:22,411 INFO L226 Difference]: Without dead ends: 187159 [2022-03-01 15:01:22,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-01 15:01:22,413 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3419 mSDsluCounter, 9889 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3419 SdHoareTripleChecker+Valid, 11024 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:22,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3419 Valid, 11024 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 15:01:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187159 states. [2022-03-01 15:01:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187159 to 144220. [2022-03-01 15:01:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144220 states, 144216 states have (on average 3.079387862650469) internal successors, (444097), 144219 states have internal predecessors, (444097), 0 states have call successors, (0), 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-01 15:01:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144220 states to 144220 states and 444097 transitions. [2022-03-01 15:01:26,507 INFO L78 Accepts]: Start accepts. Automaton has 144220 states and 444097 transitions. Word has length 114 [2022-03-01 15:01:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:26,507 INFO L470 AbstractCegarLoop]: Abstraction has 144220 states and 444097 transitions. [2022-03-01 15:01:26,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 144220 states and 444097 transitions. [2022-03-01 15:01:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:01:27,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:27,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:27,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 15:01:27,007 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1049880080, now seen corresponding path program 9 times [2022-03-01 15:01:27,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:27,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946232969] [2022-03-01 15:01:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:27,665 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-01 15:01:27,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:27,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946232969] [2022-03-01 15:01:27,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946232969] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:27,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:27,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:27,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3579652] [2022-03-01 15:01:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:27,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:27,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:27,666 INFO L87 Difference]: Start difference. First operand 144220 states and 444097 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:36,270 INFO L93 Difference]: Finished difference Result 197656 states and 607643 transitions. [2022-03-01 15:01:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-01 15:01:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:01:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:36,932 INFO L225 Difference]: With dead ends: 197656 [2022-03-01 15:01:36,933 INFO L226 Difference]: Without dead ends: 197656 [2022-03-01 15:01:36,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-01 15:01:36,933 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3309 mSDsluCounter, 12865 mSDsCounter, 0 mSdLazyCounter, 4582 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3309 SdHoareTripleChecker+Valid, 14061 SdHoareTripleChecker+Invalid, 4655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:36,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3309 Valid, 14061 Invalid, 4655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4582 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:01:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197656 states. [2022-03-01 15:01:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197656 to 144253. [2022-03-01 15:01:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144253 states, 144249 states have (on average 3.079376633460197) internal successors, (444197), 144252 states have internal predecessors, (444197), 0 states have call successors, (0), 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-01 15:01:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144253 states to 144253 states and 444197 transitions. [2022-03-01 15:01:41,702 INFO L78 Accepts]: Start accepts. Automaton has 144253 states and 444197 transitions. Word has length 114 [2022-03-01 15:01:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:41,702 INFO L470 AbstractCegarLoop]: Abstraction has 144253 states and 444197 transitions. [2022-03-01 15:01:41,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 144253 states and 444197 transitions. [2022-03-01 15:01:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:01:41,887 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:41,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:41,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 15:01:41,888 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 974615476, now seen corresponding path program 10 times [2022-03-01 15:01:41,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:41,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727509158] [2022-03-01 15:01:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:42,844 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-01 15:01:42,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:42,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727509158] [2022-03-01 15:01:42,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727509158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:42,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:42,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:42,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986882092] [2022-03-01 15:01:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:42,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:42,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:42,845 INFO L87 Difference]: Start difference. First operand 144253 states and 444197 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:01:52,592 INFO L93 Difference]: Finished difference Result 196795 states and 605032 transitions. [2022-03-01 15:01:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-01 15:01:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:01:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:01:53,301 INFO L225 Difference]: With dead ends: 196795 [2022-03-01 15:01:53,301 INFO L226 Difference]: Without dead ends: 196795 [2022-03-01 15:01:53,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-01 15:01:53,302 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3302 mSDsluCounter, 13275 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3302 SdHoareTripleChecker+Valid, 14532 SdHoareTripleChecker+Invalid, 4823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:01:53,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3302 Valid, 14532 Invalid, 4823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:01:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196795 states. [2022-03-01 15:01:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196795 to 144451. [2022-03-01 15:01:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144451 states, 144447 states have (on average 3.0794893628805027) internal successors, (444823), 144450 states have internal predecessors, (444823), 0 states have call successors, (0), 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-01 15:01:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144451 states to 144451 states and 444823 transitions. [2022-03-01 15:01:57,757 INFO L78 Accepts]: Start accepts. Automaton has 144451 states and 444823 transitions. Word has length 114 [2022-03-01 15:01:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:01:57,758 INFO L470 AbstractCegarLoop]: Abstraction has 144451 states and 444823 transitions. [2022-03-01 15:01:57,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:01:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 144451 states and 444823 transitions. [2022-03-01 15:01:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:01:57,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:01:57,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:01:57,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 15:01:57,892 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:01:57,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:01:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -380888028, now seen corresponding path program 11 times [2022-03-01 15:01:57,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:01:57,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450876262] [2022-03-01 15:01:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:01:57,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:01:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:01:58,850 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-01 15:01:58,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:01:58,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450876262] [2022-03-01 15:01:58,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450876262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:01:58,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:01:58,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:01:58,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891017848] [2022-03-01 15:01:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:01:58,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:01:58,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:01:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:01:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:01:58,852 INFO L87 Difference]: Start difference. First operand 144451 states and 444823 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:08,874 INFO L93 Difference]: Finished difference Result 195904 states and 602306 transitions. [2022-03-01 15:02:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-01 15:02:08,875 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:02:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:09,753 INFO L225 Difference]: With dead ends: 195904 [2022-03-01 15:02:09,753 INFO L226 Difference]: Without dead ends: 195904 [2022-03-01 15:02:09,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-01 15:02:09,754 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3295 mSDsluCounter, 14691 mSDsCounter, 0 mSdLazyCounter, 5180 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 16072 SdHoareTripleChecker+Invalid, 5257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 5180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:09,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3295 Valid, 16072 Invalid, 5257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 5180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:02:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195904 states. [2022-03-01 15:02:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195904 to 144814. [2022-03-01 15:02:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144814 states, 144810 states have (on average 3.079593950694013) internal successors, (445956), 144813 states have internal predecessors, (445956), 0 states have call successors, (0), 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-01 15:02:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144814 states to 144814 states and 445956 transitions. [2022-03-01 15:02:14,061 INFO L78 Accepts]: Start accepts. Automaton has 144814 states and 445956 transitions. Word has length 114 [2022-03-01 15:02:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:14,062 INFO L470 AbstractCegarLoop]: Abstraction has 144814 states and 445956 transitions. [2022-03-01 15:02:14,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 144814 states and 445956 transitions. [2022-03-01 15:02:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:02:14,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:14,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:14,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 15:02:14,214 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1942350612, now seen corresponding path program 12 times [2022-03-01 15:02:14,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:14,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378516151] [2022-03-01 15:02:14,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:14,838 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-01 15:02:14,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:14,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378516151] [2022-03-01 15:02:14,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378516151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:14,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:14,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:02:14,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386973308] [2022-03-01 15:02:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:14,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:02:14,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:02:14,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:02:14,840 INFO L87 Difference]: Start difference. First operand 144814 states and 445956 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:25,994 INFO L93 Difference]: Finished difference Result 195046 states and 599574 transitions. [2022-03-01 15:02:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-01 15:02:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:02:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:26,779 INFO L225 Difference]: With dead ends: 195046 [2022-03-01 15:02:26,779 INFO L226 Difference]: Without dead ends: 195046 [2022-03-01 15:02:26,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-01 15:02:26,780 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3048 mSDsluCounter, 17165 mSDsCounter, 0 mSdLazyCounter, 6128 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 18652 SdHoareTripleChecker+Invalid, 6207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 6128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:26,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 18652 Invalid, 6207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 6128 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-01 15:02:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195046 states. [2022-03-01 15:02:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195046 to 144847. [2022-03-01 15:02:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144847 states, 144843 states have (on average 3.0795827206009263) internal successors, (446056), 144846 states have internal predecessors, (446056), 0 states have call successors, (0), 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-01 15:02:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144847 states to 144847 states and 446056 transitions. [2022-03-01 15:02:31,495 INFO L78 Accepts]: Start accepts. Automaton has 144847 states and 446056 transitions. Word has length 114 [2022-03-01 15:02:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:31,495 INFO L470 AbstractCegarLoop]: Abstraction has 144847 states and 446056 transitions. [2022-03-01 15:02:31,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 144847 states and 446056 transitions. [2022-03-01 15:02:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:02:31,702 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:31,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:31,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 15:02:31,703 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 804485652, now seen corresponding path program 13 times [2022-03-01 15:02:31,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:31,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092981418] [2022-03-01 15:02:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:32,802 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-01 15:02:32,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:32,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092981418] [2022-03-01 15:02:32,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092981418] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:32,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:32,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:02:32,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313019157] [2022-03-01 15:02:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:32,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:02:32,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:02:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:02:32,816 INFO L87 Difference]: Start difference. First operand 144847 states and 446056 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:43,495 INFO L93 Difference]: Finished difference Result 196747 states and 605065 transitions. [2022-03-01 15:02:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-01 15:02:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:02:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:44,109 INFO L225 Difference]: With dead ends: 196747 [2022-03-01 15:02:44,109 INFO L226 Difference]: Without dead ends: 196747 [2022-03-01 15:02:44,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2358, Invalid=5652, Unknown=0, NotChecked=0, Total=8010 [2022-03-01 15:02:44,110 INFO L933 BasicCegarLoop]: 1492 mSDtfsCounter, 3385 mSDsluCounter, 11055 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3385 SdHoareTripleChecker+Valid, 12547 SdHoareTripleChecker+Invalid, 3999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:44,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3385 Valid, 12547 Invalid, 3999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:02:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196747 states. [2022-03-01 15:02:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196747 to 155155. [2022-03-01 15:02:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155155 states, 155151 states have (on average 3.0811531991414816) internal successors, (478044), 155154 states have internal predecessors, (478044), 0 states have call successors, (0), 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-01 15:02:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155155 states to 155155 states and 478044 transitions. [2022-03-01 15:02:48,886 INFO L78 Accepts]: Start accepts. Automaton has 155155 states and 478044 transitions. Word has length 114 [2022-03-01 15:02:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:02:48,886 INFO L470 AbstractCegarLoop]: Abstraction has 155155 states and 478044 transitions. [2022-03-01 15:02:48,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 155155 states and 478044 transitions. [2022-03-01 15:02:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:02:49,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:02:49,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:02:49,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 15:02:49,024 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:02:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:02:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1129835852, now seen corresponding path program 14 times [2022-03-01 15:02:49,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:02:49,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158641504] [2022-03-01 15:02:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:02:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:02:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:02:49,631 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-01 15:02:49,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:02:49,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158641504] [2022-03-01 15:02:49,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158641504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:02:49,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:02:49,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:02:49,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118999326] [2022-03-01 15:02:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:02:49,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:02:49,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:02:49,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:02:49,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:02:49,632 INFO L87 Difference]: Start difference. First operand 155155 states and 478044 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:02:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:02:57,023 INFO L93 Difference]: Finished difference Result 198292 states and 609910 transitions. [2022-03-01 15:02:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 15:02:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:02:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:02:57,631 INFO L225 Difference]: With dead ends: 198292 [2022-03-01 15:02:57,631 INFO L226 Difference]: Without dead ends: 198292 [2022-03-01 15:02:57,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-01 15:02:57,632 INFO L933 BasicCegarLoop]: 1086 mSDtfsCounter, 3488 mSDsluCounter, 9696 mSDsCounter, 0 mSdLazyCounter, 3355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 10782 SdHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 3355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 15:02:57,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3488 Valid, 10782 Invalid, 3428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 3355 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 15:02:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198292 states. [2022-03-01 15:03:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198292 to 156343. [2022-03-01 15:03:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156343 states, 156339 states have (on average 3.0811441802749155) internal successors, (481703), 156342 states have internal predecessors, (481703), 0 states have call successors, (0), 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-01 15:03:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156343 states to 156343 states and 481703 transitions. [2022-03-01 15:03:02,394 INFO L78 Accepts]: Start accepts. Automaton has 156343 states and 481703 transitions. Word has length 114 [2022-03-01 15:03:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:02,394 INFO L470 AbstractCegarLoop]: Abstraction has 156343 states and 481703 transitions. [2022-03-01 15:03:02,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 156343 states and 481703 transitions. [2022-03-01 15:03:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:03:02,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:02,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:02,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 15:03:02,532 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 894659704, now seen corresponding path program 15 times [2022-03-01 15:03:02,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:02,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949718966] [2022-03-01 15:03:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:03,140 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-01 15:03:03,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:03,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949718966] [2022-03-01 15:03:03,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949718966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:03,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:03,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:03:03,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381527124] [2022-03-01 15:03:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:03,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:03:03,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:03:03,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:03:03,142 INFO L87 Difference]: Start difference. First operand 156343 states and 481703 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:11,430 INFO L93 Difference]: Finished difference Result 207565 states and 638538 transitions. [2022-03-01 15:03:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-01 15:03:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:03:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:12,339 INFO L225 Difference]: With dead ends: 207565 [2022-03-01 15:03:12,339 INFO L226 Difference]: Without dead ends: 207565 [2022-03-01 15:03:12,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-01 15:03:12,340 INFO L933 BasicCegarLoop]: 1147 mSDtfsCounter, 3195 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 13498 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:12,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3195 Valid, 13498 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:03:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207565 states. [2022-03-01 15:03:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207565 to 156541. [2022-03-01 15:03:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156541 states, 156537 states have (on average 3.081245967407067) internal successors, (482329), 156540 states have internal predecessors, (482329), 0 states have call successors, (0), 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-01 15:03:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156541 states to 156541 states and 482329 transitions. [2022-03-01 15:03:17,451 INFO L78 Accepts]: Start accepts. Automaton has 156541 states and 482329 transitions. Word has length 114 [2022-03-01 15:03:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:17,451 INFO L470 AbstractCegarLoop]: Abstraction has 156541 states and 482329 transitions. [2022-03-01 15:03:17,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 156541 states and 482329 transitions. [2022-03-01 15:03:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:03:17,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:17,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:17,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 15:03:17,598 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:17,601 INFO L85 PathProgramCache]: Analyzing trace with hash -460843800, now seen corresponding path program 16 times [2022-03-01 15:03:17,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:17,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090598855] [2022-03-01 15:03:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:18,801 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-01 15:03:18,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:18,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090598855] [2022-03-01 15:03:18,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090598855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:18,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:18,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:03:18,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176828088] [2022-03-01 15:03:18,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:18,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:03:18,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:03:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:03:18,803 INFO L87 Difference]: Start difference. First operand 156541 states and 482329 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:28,110 INFO L93 Difference]: Finished difference Result 206416 states and 634995 transitions. [2022-03-01 15:03:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 15:03:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:03:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:29,061 INFO L225 Difference]: With dead ends: 206416 [2022-03-01 15:03:29,061 INFO L226 Difference]: Without dead ends: 206416 [2022-03-01 15:03:29,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1541, Invalid=3715, Unknown=0, NotChecked=0, Total=5256 [2022-03-01 15:03:29,062 INFO L933 BasicCegarLoop]: 1252 mSDtfsCounter, 3201 mSDsluCounter, 11630 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 12882 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:29,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3201 Valid, 12882 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:03:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206416 states. [2022-03-01 15:03:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206416 to 158389. [2022-03-01 15:03:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158389 states, 158385 states have (on average 3.0818133030274333) internal successors, (488113), 158388 states have internal predecessors, (488113), 0 states have call successors, (0), 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-01 15:03:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158389 states to 158389 states and 488113 transitions. [2022-03-01 15:03:33,546 INFO L78 Accepts]: Start accepts. Automaton has 158389 states and 488113 transitions. Word has length 114 [2022-03-01 15:03:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:33,547 INFO L470 AbstractCegarLoop]: Abstraction has 158389 states and 488113 transitions. [2022-03-01 15:03:33,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 158389 states and 488113 transitions. [2022-03-01 15:03:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:03:34,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:34,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:34,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 15:03:34,057 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2022306384, now seen corresponding path program 17 times [2022-03-01 15:03:34,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:34,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652305330] [2022-03-01 15:03:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:34,666 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-01 15:03:34,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:34,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652305330] [2022-03-01 15:03:34,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652305330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:34,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:34,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:03:34,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761919832] [2022-03-01 15:03:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:34,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:03:34,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:03:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:03:34,667 INFO L87 Difference]: Start difference. First operand 158389 states and 488113 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:03:44,750 INFO L93 Difference]: Finished difference Result 209887 states and 645493 transitions. [2022-03-01 15:03:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-01 15:03:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:03:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:03:45,372 INFO L225 Difference]: With dead ends: 209887 [2022-03-01 15:03:45,372 INFO L226 Difference]: Without dead ends: 209887 [2022-03-01 15:03:45,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-01 15:03:45,373 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 3008 mSDsluCounter, 13420 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 14797 SdHoareTripleChecker+Invalid, 4890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 4812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:03:45,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3008 Valid, 14797 Invalid, 4890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:03:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209887 states. [2022-03-01 15:03:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209887 to 158158. [2022-03-01 15:03:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158158 states, 158154 states have (on average 3.0816798816343565) internal successors, (487380), 158157 states have internal predecessors, (487380), 0 states have call successors, (0), 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-01 15:03:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158158 states to 158158 states and 487380 transitions. [2022-03-01 15:03:50,095 INFO L78 Accepts]: Start accepts. Automaton has 158158 states and 487380 transitions. Word has length 114 [2022-03-01 15:03:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:03:50,095 INFO L470 AbstractCegarLoop]: Abstraction has 158158 states and 487380 transitions. [2022-03-01 15:03:50,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:03:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 158158 states and 487380 transitions. [2022-03-01 15:03:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:03:50,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:03:50,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:03:50,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 15:03:50,267 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:03:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:03:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 724529880, now seen corresponding path program 18 times [2022-03-01 15:03:50,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:03:50,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944419163] [2022-03-01 15:03:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:03:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:03:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:03:50,958 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-01 15:03:50,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:03:50,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944419163] [2022-03-01 15:03:50,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944419163] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:03:50,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:03:50,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:03:50,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691634136] [2022-03-01 15:03:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:03:50,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:03:50,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:03:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:03:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:03:50,959 INFO L87 Difference]: Start difference. First operand 158158 states and 487380 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:01,952 INFO L93 Difference]: Finished difference Result 209068 states and 643271 transitions. [2022-03-01 15:04:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-01 15:04:01,953 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:04:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:02,987 INFO L225 Difference]: With dead ends: 209068 [2022-03-01 15:04:02,987 INFO L226 Difference]: Without dead ends: 209068 [2022-03-01 15:04:02,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2414, Invalid=5776, Unknown=0, NotChecked=0, Total=8190 [2022-03-01 15:04:02,988 INFO L933 BasicCegarLoop]: 1521 mSDtfsCounter, 3679 mSDsluCounter, 12331 mSDsCounter, 0 mSdLazyCounter, 4522 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3679 SdHoareTripleChecker+Valid, 13852 SdHoareTripleChecker+Invalid, 4630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 4522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:02,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3679 Valid, 13852 Invalid, 4630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 4522 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:04:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209068 states. [2022-03-01 15:04:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209068 to 155254. [2022-03-01 15:04:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155254 states, 155250 states have (on average 3.0811207729468597) internal successors, (478344), 155253 states have internal predecessors, (478344), 0 states have call successors, (0), 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-01 15:04:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155254 states to 155254 states and 478344 transitions. [2022-03-01 15:04:07,789 INFO L78 Accepts]: Start accepts. Automaton has 155254 states and 478344 transitions. Word has length 114 [2022-03-01 15:04:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:07,790 INFO L470 AbstractCegarLoop]: Abstraction has 155254 states and 478344 transitions. [2022-03-01 15:04:07,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 155254 states and 478344 transitions. [2022-03-01 15:04:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:04:07,932 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:07,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:07,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 15:04:07,933 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1771845934, now seen corresponding path program 19 times [2022-03-01 15:04:07,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:07,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848788387] [2022-03-01 15:04:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:08,829 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-01 15:04:08,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:08,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848788387] [2022-03-01 15:04:08,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848788387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:08,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:08,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:04:08,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34586016] [2022-03-01 15:04:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:08,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:04:08,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:08,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:04:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:04:08,830 INFO L87 Difference]: Start difference. First operand 155254 states and 478344 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:16,098 INFO L93 Difference]: Finished difference Result 195424 states and 601182 transitions. [2022-03-01 15:04:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 15:04:16,098 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:04:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:16,708 INFO L225 Difference]: With dead ends: 195424 [2022-03-01 15:04:16,708 INFO L226 Difference]: Without dead ends: 195424 [2022-03-01 15:04:16,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1074, Invalid=2708, Unknown=0, NotChecked=0, Total=3782 [2022-03-01 15:04:16,709 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 2437 mSDsluCounter, 9591 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 10609 SdHoareTripleChecker+Invalid, 3550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:16,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2437 Valid, 10609 Invalid, 3550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3482 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-01 15:04:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195424 states. [2022-03-01 15:04:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195424 to 159412. [2022-03-01 15:04:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159412 states, 159408 states have (on average 3.082862842517314) internal successors, (491433), 159411 states have internal predecessors, (491433), 0 states have call successors, (0), 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-01 15:04:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159412 states to 159412 states and 491433 transitions. [2022-03-01 15:04:21,478 INFO L78 Accepts]: Start accepts. Automaton has 159412 states and 491433 transitions. Word has length 114 [2022-03-01 15:04:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:21,478 INFO L470 AbstractCegarLoop]: Abstraction has 159412 states and 491433 transitions. [2022-03-01 15:04:21,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 159412 states and 491433 transitions. [2022-03-01 15:04:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:04:21,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:21,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:21,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-01 15:04:21,632 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1167617858, now seen corresponding path program 20 times [2022-03-01 15:04:21,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:21,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966260267] [2022-03-01 15:04:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:22,220 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-01 15:04:22,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:22,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966260267] [2022-03-01 15:04:22,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966260267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:22,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:22,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:22,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156560896] [2022-03-01 15:04:22,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:22,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:22,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:22,222 INFO L87 Difference]: Start difference. First operand 159412 states and 491433 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:30,633 INFO L93 Difference]: Finished difference Result 206287 states and 634740 transitions. [2022-03-01 15:04:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-01 15:04:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:04:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:31,567 INFO L225 Difference]: With dead ends: 206287 [2022-03-01 15:04:31,568 INFO L226 Difference]: Without dead ends: 206287 [2022-03-01 15:04:31,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1527, Invalid=4325, Unknown=0, NotChecked=0, Total=5852 [2022-03-01 15:04:31,568 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 3098 mSDsluCounter, 11991 mSDsCounter, 0 mSdLazyCounter, 4314 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3098 SdHoareTripleChecker+Valid, 13152 SdHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:31,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3098 Valid, 13152 Invalid, 4382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 4314 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:04:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206287 states. [2022-03-01 15:04:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206287 to 160270. [2022-03-01 15:04:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160270 states, 160266 states have (on average 3.082993273682503) internal successors, (494099), 160269 states have internal predecessors, (494099), 0 states have call successors, (0), 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-01 15:04:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160270 states to 160270 states and 494099 transitions. [2022-03-01 15:04:36,083 INFO L78 Accepts]: Start accepts. Automaton has 160270 states and 494099 transitions. Word has length 114 [2022-03-01 15:04:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:36,084 INFO L470 AbstractCegarLoop]: Abstraction has 160270 states and 494099 transitions. [2022-03-01 15:04:36,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 160270 states and 494099 transitions. [2022-03-01 15:04:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:04:36,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:36,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:36,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-01 15:04:36,606 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash -393844726, now seen corresponding path program 21 times [2022-03-01 15:04:36,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:36,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83301330] [2022-03-01 15:04:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:37,165 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-01 15:04:37,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:37,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83301330] [2022-03-01 15:04:37,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83301330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:37,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:37,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:37,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479897487] [2022-03-01 15:04:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:37,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:37,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:37,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:37,166 INFO L87 Difference]: Start difference. First operand 160270 states and 494099 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:04:46,025 INFO L93 Difference]: Finished difference Result 204988 states and 630661 transitions. [2022-03-01 15:04:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-01 15:04:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:04:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:04:47,137 INFO L225 Difference]: With dead ends: 204988 [2022-03-01 15:04:47,137 INFO L226 Difference]: Without dead ends: 204988 [2022-03-01 15:04:47,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1799, Invalid=5007, Unknown=0, NotChecked=0, Total=6806 [2022-03-01 15:04:47,138 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 3650 mSDsluCounter, 11000 mSDsCounter, 0 mSdLazyCounter, 3919 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3650 SdHoareTripleChecker+Valid, 12267 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:04:47,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3650 Valid, 12267 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3919 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-01 15:04:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204988 states. [2022-03-01 15:04:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204988 to 160303. [2022-03-01 15:04:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160303 states, 160299 states have (on average 3.082982426590309) internal successors, (494199), 160302 states have internal predecessors, (494199), 0 states have call successors, (0), 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-01 15:04:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160303 states to 160303 states and 494199 transitions. [2022-03-01 15:04:52,100 INFO L78 Accepts]: Start accepts. Automaton has 160303 states and 494199 transitions. Word has length 114 [2022-03-01 15:04:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:04:52,100 INFO L470 AbstractCegarLoop]: Abstraction has 160303 states and 494199 transitions. [2022-03-01 15:04:52,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:04:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 160303 states and 494199 transitions. [2022-03-01 15:04:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:04:52,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:04:52,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:04:52,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-01 15:04:52,245 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:04:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:04:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1941975758, now seen corresponding path program 22 times [2022-03-01 15:04:52,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:04:52,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943954286] [2022-03-01 15:04:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:04:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:04:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:04:53,286 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-01 15:04:53,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:04:53,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943954286] [2022-03-01 15:04:53,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943954286] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:04:53,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:04:53,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:04:53,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807361191] [2022-03-01 15:04:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:04:53,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:04:53,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:04:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:04:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:04:53,288 INFO L87 Difference]: Start difference. First operand 160303 states and 494199 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:04,872 INFO L93 Difference]: Finished difference Result 205831 states and 633552 transitions. [2022-03-01 15:05:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-01 15:05:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:05:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:05,774 INFO L225 Difference]: With dead ends: 205831 [2022-03-01 15:05:05,774 INFO L226 Difference]: Without dead ends: 205831 [2022-03-01 15:05:05,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2489, Invalid=6067, Unknown=0, NotChecked=0, Total=8556 [2022-03-01 15:05:05,775 INFO L933 BasicCegarLoop]: 1550 mSDtfsCounter, 3311 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 14051 SdHoareTripleChecker+Invalid, 4531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:05,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3311 Valid, 14051 Invalid, 4531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:05:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205831 states. [2022-03-01 15:05:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205831 to 155848. [2022-03-01 15:05:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155848 states, 155844 states have (on average 3.0814275814275813) internal successors, (480222), 155847 states have internal predecessors, (480222), 0 states have call successors, (0), 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-01 15:05:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155848 states to 155848 states and 480222 transitions. [2022-03-01 15:05:10,114 INFO L78 Accepts]: Start accepts. Automaton has 155848 states and 480222 transitions. Word has length 114 [2022-03-01 15:05:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:10,114 INFO L470 AbstractCegarLoop]: Abstraction has 155848 states and 480222 transitions. [2022-03-01 15:05:10,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 155848 states and 480222 transitions. [2022-03-01 15:05:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:05:10,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:10,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:10,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-01 15:05:10,249 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1860149644, now seen corresponding path program 23 times [2022-03-01 15:05:10,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:10,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864931220] [2022-03-01 15:05:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:10,820 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-01 15:05:10,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:10,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864931220] [2022-03-01 15:05:10,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864931220] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:10,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:10,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:10,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140904575] [2022-03-01 15:05:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:10,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:10,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:10,822 INFO L87 Difference]: Start difference. First operand 155848 states and 480222 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:17,603 INFO L93 Difference]: Finished difference Result 195547 states and 601977 transitions. [2022-03-01 15:05:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-01 15:05:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:05:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:18,125 INFO L225 Difference]: With dead ends: 195547 [2022-03-01 15:05:18,126 INFO L226 Difference]: Without dead ends: 195547 [2022-03-01 15:05:18,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1089, Invalid=3333, Unknown=0, NotChecked=0, Total=4422 [2022-03-01 15:05:18,126 INFO L933 BasicCegarLoop]: 927 mSDtfsCounter, 3195 mSDsluCounter, 10478 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 11405 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:18,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3195 Valid, 11405 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-01 15:05:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195547 states. [2022-03-01 15:05:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195547 to 162019. [2022-03-01 15:05:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162019 states, 162015 states have (on average 3.082942937382341) internal successors, (499483), 162018 states have internal predecessors, (499483), 0 states have call successors, (0), 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-01 15:05:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162019 states to 162019 states and 499483 transitions. [2022-03-01 15:05:22,765 INFO L78 Accepts]: Start accepts. Automaton has 162019 states and 499483 transitions. Word has length 114 [2022-03-01 15:05:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:22,766 INFO L470 AbstractCegarLoop]: Abstraction has 162019 states and 499483 transitions. [2022-03-01 15:05:22,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 162019 states and 499483 transitions. [2022-03-01 15:05:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:05:22,922 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:22,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:22,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-01 15:05:22,922 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:22,923 INFO L85 PathProgramCache]: Analyzing trace with hash 873355068, now seen corresponding path program 24 times [2022-03-01 15:05:22,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:22,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971986665] [2022-03-01 15:05:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:22,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:05:23,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:23,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971986665] [2022-03-01 15:05:23,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971986665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:23,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:23,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:23,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211639453] [2022-03-01 15:05:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:23,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:23,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:23,505 INFO L87 Difference]: Start difference. First operand 162019 states and 499483 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:31,724 INFO L93 Difference]: Finished difference Result 197494 states and 608240 transitions. [2022-03-01 15:05:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 15:05:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:05:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:32,684 INFO L225 Difference]: With dead ends: 197494 [2022-03-01 15:05:32,684 INFO L226 Difference]: Without dead ends: 197494 [2022-03-01 15:05:32,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1334, Invalid=3922, Unknown=0, NotChecked=0, Total=5256 [2022-03-01 15:05:32,685 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 2742 mSDsluCounter, 12683 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 13716 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 4637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:32,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2742 Valid, 13716 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:05:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197494 states. [2022-03-01 15:05:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197494 to 162052. [2022-03-01 15:05:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162052 states, 162048 states have (on average 3.082932217614534) internal successors, (499583), 162051 states have internal predecessors, (499583), 0 states have call successors, (0), 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-01 15:05:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162052 states to 162052 states and 499583 transitions. [2022-03-01 15:05:37,557 INFO L78 Accepts]: Start accepts. Automaton has 162052 states and 499583 transitions. Word has length 114 [2022-03-01 15:05:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:37,557 INFO L470 AbstractCegarLoop]: Abstraction has 162052 states and 499583 transitions. [2022-03-01 15:05:37,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 162052 states and 499583 transitions. [2022-03-01 15:05:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:05:37,702 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:37,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:37,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-01 15:05:37,702 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash -674775964, now seen corresponding path program 25 times [2022-03-01 15:05:37,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:37,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165382167] [2022-03-01 15:05:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:38,665 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-01 15:05:38,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:38,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165382167] [2022-03-01 15:05:38,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165382167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:38,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:38,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:05:38,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807271731] [2022-03-01 15:05:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:38,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:05:38,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:38,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:05:38,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:05:38,667 INFO L87 Difference]: Start difference. First operand 162052 states and 499583 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:05:49,957 INFO L93 Difference]: Finished difference Result 196723 states and 605555 transitions. [2022-03-01 15:05:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-01 15:05:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:05:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:05:50,648 INFO L225 Difference]: With dead ends: 196723 [2022-03-01 15:05:50,649 INFO L226 Difference]: Without dead ends: 196723 [2022-03-01 15:05:50,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2558, Invalid=6184, Unknown=0, NotChecked=0, Total=8742 [2022-03-01 15:05:50,650 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 3048 mSDsluCounter, 14074 mSDsCounter, 0 mSdLazyCounter, 5002 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 15683 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 5002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:05:50,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3048 Valid, 15683 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 5002 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-01 15:05:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196723 states. [2022-03-01 15:05:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196723 to 157432. [2022-03-01 15:05:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157432 states, 157428 states have (on average 3.0819612775363976) internal successors, (485187), 157431 states have internal predecessors, (485187), 0 states have call successors, (0), 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-01 15:05:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157432 states to 157432 states and 485187 transitions. [2022-03-01 15:05:55,276 INFO L78 Accepts]: Start accepts. Automaton has 157432 states and 485187 transitions. Word has length 114 [2022-03-01 15:05:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:05:55,277 INFO L470 AbstractCegarLoop]: Abstraction has 157432 states and 485187 transitions. [2022-03-01 15:05:55,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:05:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 157432 states and 485187 transitions. [2022-03-01 15:05:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:05:55,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:05:55,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:05:55,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-01 15:05:55,433 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:05:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:05:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -939404236, now seen corresponding path program 26 times [2022-03-01 15:05:55,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:05:55,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922878814] [2022-03-01 15:05:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:05:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:05:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:05:56,003 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-01 15:05:56,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:05:56,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922878814] [2022-03-01 15:05:56,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922878814] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:05:56,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:05:56,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:05:56,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802425561] [2022-03-01 15:05:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:05:56,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:05:56,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:05:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:05:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:05:56,005 INFO L87 Difference]: Start difference. First operand 157432 states and 485187 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:01,877 INFO L93 Difference]: Finished difference Result 186637 states and 574086 transitions. [2022-03-01 15:06:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 15:06:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:06:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:02,536 INFO L225 Difference]: With dead ends: 186637 [2022-03-01 15:06:02,536 INFO L226 Difference]: Without dead ends: 186637 [2022-03-01 15:06:02,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=874, Invalid=3032, Unknown=0, NotChecked=0, Total=3906 [2022-03-01 15:06:02,537 INFO L933 BasicCegarLoop]: 818 mSDtfsCounter, 2715 mSDsluCounter, 10812 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 11630 SdHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:02,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2715 Valid, 11630 Invalid, 3840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:06:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186637 states. [2022-03-01 15:06:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186637 to 158026. [2022-03-01 15:06:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158026 states, 158022 states have (on average 3.081767095720849) internal successors, (486987), 158025 states have internal predecessors, (486987), 0 states have call successors, (0), 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-01 15:06:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158026 states to 158026 states and 486987 transitions. [2022-03-01 15:06:07,137 INFO L78 Accepts]: Start accepts. Automaton has 158026 states and 486987 transitions. Word has length 114 [2022-03-01 15:06:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:07,137 INFO L470 AbstractCegarLoop]: Abstraction has 158026 states and 486987 transitions. [2022-03-01 15:06:07,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 158026 states and 486987 transitions. [2022-03-01 15:06:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:06:07,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:07,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:07,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-01 15:06:07,284 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1807432028, now seen corresponding path program 27 times [2022-03-01 15:06:07,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:07,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975775244] [2022-03-01 15:06:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:07,887 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-01 15:06:07,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:07,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975775244] [2022-03-01 15:06:07,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975775244] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:07,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:07,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-03-01 15:06:07,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430723218] [2022-03-01 15:06:07,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:07,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 15:06:07,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:07,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 15:06:07,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-03-01 15:06:07,889 INFO L87 Difference]: Start difference. First operand 158026 states and 486987 transitions. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:18,428 INFO L93 Difference]: Finished difference Result 188077 states and 578431 transitions. [2022-03-01 15:06:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-01 15:06:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:06:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:19,421 INFO L225 Difference]: With dead ends: 188077 [2022-03-01 15:06:19,421 INFO L226 Difference]: Without dead ends: 188077 [2022-03-01 15:06:19,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2244, Invalid=5412, Unknown=0, NotChecked=0, Total=7656 [2022-03-01 15:06:19,424 INFO L933 BasicCegarLoop]: 1502 mSDtfsCounter, 3040 mSDsluCounter, 13790 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 15292 SdHoareTripleChecker+Invalid, 5048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:19,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3040 Valid, 15292 Invalid, 5048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:06:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188077 states. [2022-03-01 15:06:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188077 to 156211. [2022-03-01 15:06:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156211 states, 156207 states have (on average 3.081609658978151) internal successors, (481369), 156210 states have internal predecessors, (481369), 0 states have call successors, (0), 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-01 15:06:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156211 states to 156211 states and 481369 transitions. [2022-03-01 15:06:24,143 INFO L78 Accepts]: Start accepts. Automaton has 156211 states and 481369 transitions. Word has length 114 [2022-03-01 15:06:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:24,143 INFO L470 AbstractCegarLoop]: Abstraction has 156211 states and 481369 transitions. [2022-03-01 15:06:24,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 156211 states and 481369 transitions. [2022-03-01 15:06:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:06:24,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:24,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:24,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-01 15:06:24,289 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -825115224, now seen corresponding path program 28 times [2022-03-01 15:06:24,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:24,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724417926] [2022-03-01 15:06:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:25,285 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-01 15:06:25,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:25,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724417926] [2022-03-01 15:06:25,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724417926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:25,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:25,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:25,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994103153] [2022-03-01 15:06:25,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:25,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:25,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:25,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:25,286 INFO L87 Difference]: Start difference. First operand 156211 states and 481369 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:32,742 INFO L93 Difference]: Finished difference Result 228202 states and 702439 transitions. [2022-03-01 15:06:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-01 15:06:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:06:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:33,741 INFO L225 Difference]: With dead ends: 228202 [2022-03-01 15:06:33,741 INFO L226 Difference]: Without dead ends: 228202 [2022-03-01 15:06:33,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1471, Invalid=4079, Unknown=0, NotChecked=0, Total=5550 [2022-03-01 15:06:33,742 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 3412 mSDsluCounter, 9505 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3412 SdHoareTripleChecker+Valid, 10640 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:33,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3412 Valid, 10640 Invalid, 3392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 15:06:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228202 states. [2022-03-01 15:06:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228202 to 157828. [2022-03-01 15:06:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157828 states, 157824 states have (on average 3.0814578264395784) internal successors, (486328), 157827 states have internal predecessors, (486328), 0 states have call successors, (0), 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-01 15:06:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157828 states to 157828 states and 486328 transitions. [2022-03-01 15:06:38,293 INFO L78 Accepts]: Start accepts. Automaton has 157828 states and 486328 transitions. Word has length 114 [2022-03-01 15:06:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:38,293 INFO L470 AbstractCegarLoop]: Abstraction has 157828 states and 486328 transitions. [2022-03-01 15:06:38,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 157828 states and 486328 transitions. [2022-03-01 15:06:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:06:38,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:38,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:38,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-01 15:06:38,795 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1488903994, now seen corresponding path program 29 times [2022-03-01 15:06:38,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:38,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642458721] [2022-03-01 15:06:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:39,363 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-01 15:06:39,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:39,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642458721] [2022-03-01 15:06:39,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642458721] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:39,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:39,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:39,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843787793] [2022-03-01 15:06:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:39,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:39,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:39,364 INFO L87 Difference]: Start difference. First operand 157828 states and 486328 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:06:48,139 INFO L93 Difference]: Finished difference Result 247378 states and 761904 transitions. [2022-03-01 15:06:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-01 15:06:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:06:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:06:49,209 INFO L225 Difference]: With dead ends: 247378 [2022-03-01 15:06:49,209 INFO L226 Difference]: Without dead ends: 247378 [2022-03-01 15:06:49,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1587, Invalid=4419, Unknown=0, NotChecked=0, Total=6006 [2022-03-01 15:06:49,210 INFO L933 BasicCegarLoop]: 1196 mSDtfsCounter, 3199 mSDsluCounter, 13013 mSDsCounter, 0 mSdLazyCounter, 4805 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3199 SdHoareTripleChecker+Valid, 14209 SdHoareTripleChecker+Invalid, 4870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:06:49,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3199 Valid, 14209 Invalid, 4870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4805 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:06:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247378 states. [2022-03-01 15:06:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247378 to 157861. [2022-03-01 15:06:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157861 states, 157857 states have (on average 3.0814471325313417) internal successors, (486428), 157860 states have internal predecessors, (486428), 0 states have call successors, (0), 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-01 15:06:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157861 states to 157861 states and 486428 transitions. [2022-03-01 15:06:54,278 INFO L78 Accepts]: Start accepts. Automaton has 157861 states and 486428 transitions. Word has length 114 [2022-03-01 15:06:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:06:54,279 INFO L470 AbstractCegarLoop]: Abstraction has 157861 states and 486428 transitions. [2022-03-01 15:06:54,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:06:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 157861 states and 486428 transitions. [2022-03-01 15:06:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:06:54,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:06:54,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:06:54,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-01 15:06:54,441 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:06:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:06:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 535591562, now seen corresponding path program 30 times [2022-03-01 15:06:54,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:06:54,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841780009] [2022-03-01 15:06:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:06:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:06:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:06:55,024 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-01 15:06:55,025 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:06:55,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841780009] [2022-03-01 15:06:55,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841780009] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:06:55,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:06:55,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:06:55,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756212732] [2022-03-01 15:06:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:06:55,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:06:55,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:06:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:06:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:06:55,026 INFO L87 Difference]: Start difference. First operand 157861 states and 486428 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:04,454 INFO L93 Difference]: Finished difference Result 245923 states and 757415 transitions. [2022-03-01 15:07:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-01 15:07:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:07:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:05,299 INFO L225 Difference]: With dead ends: 245923 [2022-03-01 15:07:05,299 INFO L226 Difference]: Without dead ends: 245923 [2022-03-01 15:07:05,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1708, Invalid=4772, Unknown=0, NotChecked=0, Total=6480 [2022-03-01 15:07:05,300 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 3141 mSDsluCounter, 12656 mSDsCounter, 0 mSdLazyCounter, 4536 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3141 SdHoareTripleChecker+Valid, 13913 SdHoareTripleChecker+Invalid, 4606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:05,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3141 Valid, 13913 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4536 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-01 15:07:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245923 states. [2022-03-01 15:07:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245923 to 158059. [2022-03-01 15:07:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158059 states, 158055 states have (on average 3.0815475625573376) internal successors, (487054), 158058 states have internal predecessors, (487054), 0 states have call successors, (0), 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-01 15:07:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158059 states to 158059 states and 487054 transitions. [2022-03-01 15:07:10,403 INFO L78 Accepts]: Start accepts. Automaton has 158059 states and 487054 transitions. Word has length 114 [2022-03-01 15:07:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:10,403 INFO L470 AbstractCegarLoop]: Abstraction has 158059 states and 487054 transitions. [2022-03-01 15:07:10,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 158059 states and 487054 transitions. [2022-03-01 15:07:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:07:10,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:10,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:10,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-01 15:07:10,547 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash -819911942, now seen corresponding path program 31 times [2022-03-01 15:07:10,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:10,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041420054] [2022-03-01 15:07:10,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:10,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:11,111 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-01 15:07:11,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:11,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041420054] [2022-03-01 15:07:11,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041420054] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:11,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:11,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:07:11,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111593587] [2022-03-01 15:07:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:11,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:07:11,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:07:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:07:11,113 INFO L87 Difference]: Start difference. First operand 158059 states and 487054 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:21,299 INFO L93 Difference]: Finished difference Result 244339 states and 752589 transitions. [2022-03-01 15:07:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-01 15:07:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:07:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:22,353 INFO L225 Difference]: With dead ends: 244339 [2022-03-01 15:07:22,353 INFO L226 Difference]: Without dead ends: 244339 [2022-03-01 15:07:22,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1965, Invalid=5517, Unknown=0, NotChecked=0, Total=7482 [2022-03-01 15:07:22,354 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 3121 mSDsluCounter, 13184 mSDsCounter, 0 mSdLazyCounter, 4731 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 14565 SdHoareTripleChecker+Invalid, 4801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:22,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3121 Valid, 14565 Invalid, 4801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4731 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-01 15:07:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244339 states. [2022-03-01 15:07:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244339 to 158422. [2022-03-01 15:07:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158422 states, 158418 states have (on average 3.0816384501761163) internal successors, (488187), 158421 states have internal predecessors, (488187), 0 states have call successors, (0), 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-01 15:07:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158422 states to 158422 states and 488187 transitions. [2022-03-01 15:07:26,876 INFO L78 Accepts]: Start accepts. Automaton has 158422 states and 488187 transitions. Word has length 114 [2022-03-01 15:07:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:26,877 INFO L470 AbstractCegarLoop]: Abstraction has 158422 states and 488187 transitions. [2022-03-01 15:07:26,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 158422 states and 488187 transitions. [2022-03-01 15:07:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:07:27,398 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:27,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:27,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-01 15:07:27,399 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1913592770, now seen corresponding path program 32 times [2022-03-01 15:07:27,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:27,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918677056] [2022-03-01 15:07:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:27,961 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-01 15:07:27,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:27,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918677056] [2022-03-01 15:07:27,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918677056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:27,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:27,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:07:27,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317428945] [2022-03-01 15:07:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:27,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:07:27,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:07:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:07:27,963 INFO L87 Difference]: Start difference. First operand 158422 states and 488187 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:39,237 INFO L93 Difference]: Finished difference Result 242986 states and 748258 transitions. [2022-03-01 15:07:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-01 15:07:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:07:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:40,335 INFO L225 Difference]: With dead ends: 242986 [2022-03-01 15:07:40,335 INFO L226 Difference]: Without dead ends: 242986 [2022-03-01 15:07:40,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2261, Invalid=6295, Unknown=0, NotChecked=0, Total=8556 [2022-03-01 15:07:40,336 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 3304 mSDsluCounter, 16636 mSDsCounter, 0 mSdLazyCounter, 6077 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3304 SdHoareTripleChecker+Valid, 18123 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 6077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:40,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3304 Valid, 18123 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 6077 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 15:07:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242986 states. [2022-03-01 15:07:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242986 to 158455. [2022-03-01 15:07:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158455 states, 158451 states have (on average 3.0816277587392946) internal successors, (488287), 158454 states have internal predecessors, (488287), 0 states have call successors, (0), 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-01 15:07:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158455 states to 158455 states and 488287 transitions. [2022-03-01 15:07:44,854 INFO L78 Accepts]: Start accepts. Automaton has 158455 states and 488287 transitions. Word has length 114 [2022-03-01 15:07:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:07:44,854 INFO L470 AbstractCegarLoop]: Abstraction has 158455 states and 488287 transitions. [2022-03-01 15:07:44,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 158455 states and 488287 transitions. [2022-03-01 15:07:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:07:45,467 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:07:45,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:07:45,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-01 15:07:45,467 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:07:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:07:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash 365461738, now seen corresponding path program 33 times [2022-03-01 15:07:45,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:07:45,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869850027] [2022-03-01 15:07:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:07:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:07:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:07:46,403 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-01 15:07:46,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:07:46,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869850027] [2022-03-01 15:07:46,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869850027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:07:46,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:07:46,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-03-01 15:07:46,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256380887] [2022-03-01 15:07:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:07:46,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-01 15:07:46,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:07:46,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-01 15:07:46,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2022-03-01 15:07:46,404 INFO L87 Difference]: Start difference. First operand 158455 states and 488287 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:07:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:07:56,812 INFO L93 Difference]: Finished difference Result 243895 states and 751021 transitions. [2022-03-01 15:07:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-01 15:07:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:07:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:07:57,606 INFO L225 Difference]: With dead ends: 243895 [2022-03-01 15:07:57,606 INFO L226 Difference]: Without dead ends: 243895 [2022-03-01 15:07:57,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2071, Invalid=4901, Unknown=0, NotChecked=0, Total=6972 [2022-03-01 15:07:57,607 INFO L933 BasicCegarLoop]: 1482 mSDtfsCounter, 2503 mSDsluCounter, 12258 mSDsCounter, 0 mSdLazyCounter, 4532 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2503 SdHoareTripleChecker+Valid, 13740 SdHoareTripleChecker+Invalid, 4606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:07:57,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2503 Valid, 13740 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4532 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-01 15:07:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243895 states. [2022-03-01 15:08:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243895 to 168025. [2022-03-01 15:08:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168025 states, 168021 states have (on average 3.0829182066527396) internal successors, (517995), 168024 states have internal predecessors, (517995), 0 states have call successors, (0), 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-01 15:08:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168025 states to 168025 states and 517995 transitions. [2022-03-01 15:08:02,960 INFO L78 Accepts]: Start accepts. Automaton has 168025 states and 517995 transitions. Word has length 114 [2022-03-01 15:08:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:02,961 INFO L470 AbstractCegarLoop]: Abstraction has 168025 states and 517995 transitions. [2022-03-01 15:08:02,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 168025 states and 517995 transitions. [2022-03-01 15:08:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:08:03,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:03,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:03,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-01 15:08:03,604 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1568859766, now seen corresponding path program 34 times [2022-03-01 15:08:03,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:03,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401765073] [2022-03-01 15:08:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:04,193 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-01 15:08:04,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:04,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401765073] [2022-03-01 15:08:04,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401765073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:04,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:04,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:08:04,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571147508] [2022-03-01 15:08:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:04,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:08:04,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:08:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:08:04,195 INFO L87 Difference]: Start difference. First operand 168025 states and 517995 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:11,596 INFO L93 Difference]: Finished difference Result 268819 states and 828324 transitions. [2022-03-01 15:08:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-01 15:08:11,596 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:08:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:12,435 INFO L225 Difference]: With dead ends: 268819 [2022-03-01 15:08:12,435 INFO L226 Difference]: Without dead ends: 268819 [2022-03-01 15:08:12,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1377, Invalid=3879, Unknown=0, NotChecked=0, Total=5256 [2022-03-01 15:08:12,436 INFO L933 BasicCegarLoop]: 1095 mSDtfsCounter, 3810 mSDsluCounter, 7979 mSDsCounter, 0 mSdLazyCounter, 2838 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 9074 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:12,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3810 Valid, 9074 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2838 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 15:08:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268819 states. [2022-03-01 15:08:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268819 to 169213. [2022-03-01 15:08:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169213 states, 169209 states have (on average 3.082897481812433) internal successors, (521654), 169212 states have internal predecessors, (521654), 0 states have call successors, (0), 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-01 15:08:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169213 states to 169213 states and 521654 transitions. [2022-03-01 15:08:18,086 INFO L78 Accepts]: Start accepts. Automaton has 169213 states and 521654 transitions. Word has length 114 [2022-03-01 15:08:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:18,086 INFO L470 AbstractCegarLoop]: Abstraction has 169213 states and 521654 transitions. [2022-03-01 15:08:18,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 169213 states and 521654 transitions. [2022-03-01 15:08:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:08:18,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:18,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:18,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-01 15:08:18,289 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 455635790, now seen corresponding path program 35 times [2022-03-01 15:08:18,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:18,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383086902] [2022-03-01 15:08:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:18,862 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-01 15:08:18,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:18,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383086902] [2022-03-01 15:08:18,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383086902] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:18,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:18,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:08:18,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28230273] [2022-03-01 15:08:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:18,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:08:18,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:08:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:08:18,864 INFO L87 Difference]: Start difference. First operand 169213 states and 521654 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:27,090 INFO L93 Difference]: Finished difference Result 285814 states and 881100 transitions. [2022-03-01 15:08:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-01 15:08:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:08:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:28,331 INFO L225 Difference]: With dead ends: 285814 [2022-03-01 15:08:28,331 INFO L226 Difference]: Without dead ends: 285814 [2022-03-01 15:08:28,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1495, Invalid=4205, Unknown=0, NotChecked=0, Total=5700 [2022-03-01 15:08:28,332 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 3503 mSDsluCounter, 11421 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3503 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:28,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3503 Valid, 12577 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4183 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:08:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285814 states. [2022-03-01 15:08:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285814 to 169411. [2022-03-01 15:08:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169411 states, 169407 states have (on average 3.0829894868570955) internal successors, (522280), 169410 states have internal predecessors, (522280), 0 states have call successors, (0), 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-01 15:08:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169411 states to 169411 states and 522280 transitions. [2022-03-01 15:08:34,232 INFO L78 Accepts]: Start accepts. Automaton has 169411 states and 522280 transitions. Word has length 114 [2022-03-01 15:08:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:34,232 INFO L470 AbstractCegarLoop]: Abstraction has 169411 states and 522280 transitions. [2022-03-01 15:08:34,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 169411 states and 522280 transitions. [2022-03-01 15:08:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:08:34,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:34,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:34,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-01 15:08:34,462 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash -899867714, now seen corresponding path program 36 times [2022-03-01 15:08:34,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:34,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155937557] [2022-03-01 15:08:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:35,615 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-01 15:08:35,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:35,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155937557] [2022-03-01 15:08:35,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155937557] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:35,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:35,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:08:35,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553501625] [2022-03-01 15:08:35,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:35,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:08:35,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:08:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:08:35,618 INFO L87 Difference]: Start difference. First operand 169411 states and 522280 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:08:45,881 INFO L93 Difference]: Finished difference Result 284230 states and 876274 transitions. [2022-03-01 15:08:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-01 15:08:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:08:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:08:46,833 INFO L225 Difference]: With dead ends: 284230 [2022-03-01 15:08:46,834 INFO L226 Difference]: Without dead ends: 284230 [2022-03-01 15:08:46,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1746, Invalid=4896, Unknown=0, NotChecked=0, Total=6642 [2022-03-01 15:08:46,834 INFO L933 BasicCegarLoop]: 1280 mSDtfsCounter, 3130 mSDsluCounter, 15348 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3130 SdHoareTripleChecker+Valid, 16628 SdHoareTripleChecker+Invalid, 5745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 5676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:08:46,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3130 Valid, 16628 Invalid, 5745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-01 15:08:47,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284230 states. [2022-03-01 15:08:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284230 to 169774. [2022-03-01 15:08:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169774 states, 169770 states have (on average 3.0830712139954057) internal successors, (523413), 169773 states have internal predecessors, (523413), 0 states have call successors, (0), 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-01 15:08:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169774 states to 169774 states and 523413 transitions. [2022-03-01 15:08:52,483 INFO L78 Accepts]: Start accepts. Automaton has 169774 states and 523413 transitions. Word has length 114 [2022-03-01 15:08:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:08:52,483 INFO L470 AbstractCegarLoop]: Abstraction has 169774 states and 523413 transitions. [2022-03-01 15:08:52,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:08:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 169774 states and 523413 transitions. [2022-03-01 15:08:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:08:52,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:08:52,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:08:52,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-01 15:08:52,686 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:08:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:08:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1833636998, now seen corresponding path program 37 times [2022-03-01 15:08:52,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:08:52,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119166884] [2022-03-01 15:08:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:08:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:08:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:08:53,242 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-01 15:08:53,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:08:53,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119166884] [2022-03-01 15:08:53,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119166884] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:08:53,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:08:53,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:08:53,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114279925] [2022-03-01 15:08:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:08:53,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:08:53,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:08:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:08:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:08:53,243 INFO L87 Difference]: Start difference. First operand 169774 states and 523413 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:09:03,785 INFO L93 Difference]: Finished difference Result 282877 states and 871943 transitions. [2022-03-01 15:09:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-01 15:09:03,786 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:09:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:09:05,009 INFO L225 Difference]: With dead ends: 282877 [2022-03-01 15:09:05,009 INFO L226 Difference]: Without dead ends: 282877 [2022-03-01 15:09:05,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2030, Invalid=5626, Unknown=0, NotChecked=0, Total=7656 [2022-03-01 15:09:05,010 INFO L933 BasicCegarLoop]: 1386 mSDtfsCounter, 3310 mSDsluCounter, 14103 mSDsCounter, 0 mSdLazyCounter, 5163 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3310 SdHoareTripleChecker+Valid, 15489 SdHoareTripleChecker+Invalid, 5249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:05,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3310 Valid, 15489 Invalid, 5249 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [86 Valid, 5163 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-01 15:09:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282877 states. [2022-03-01 15:09:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282877 to 169807. [2022-03-01 15:09:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169807 states, 169803 states have (on average 3.083060958875874) internal successors, (523513), 169806 states have internal predecessors, (523513), 0 states have call successors, (0), 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-01 15:09:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169807 states to 169807 states and 523513 transitions. [2022-03-01 15:09:10,851 INFO L78 Accepts]: Start accepts. Automaton has 169807 states and 523513 transitions. Word has length 114 [2022-03-01 15:09:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:10,851 INFO L470 AbstractCegarLoop]: Abstraction has 169807 states and 523513 transitions. [2022-03-01 15:09:10,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 169807 states and 523513 transitions. [2022-03-01 15:09:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:09:11,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:11,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:11,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-01 15:09:11,075 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 285505966, now seen corresponding path program 38 times [2022-03-01 15:09:11,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:11,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970265784] [2022-03-01 15:09:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:12,167 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-01 15:09:12,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:12,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970265784] [2022-03-01 15:09:12,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970265784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:12,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:12,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:09:12,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507576700] [2022-03-01 15:09:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:12,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:09:12,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:09:12,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:09:12,168 INFO L87 Difference]: Start difference. First operand 169807 states and 523513 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:09:24,079 INFO L93 Difference]: Finished difference Result 279508 states and 861524 transitions. [2022-03-01 15:09:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 15:09:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:09:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:09:25,419 INFO L225 Difference]: With dead ends: 279508 [2022-03-01 15:09:25,419 INFO L226 Difference]: Without dead ends: 279508 [2022-03-01 15:09:25,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2149, Invalid=5161, Unknown=0, NotChecked=0, Total=7310 [2022-03-01 15:09:25,420 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 2993 mSDsluCounter, 14138 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2993 SdHoareTripleChecker+Valid, 15649 SdHoareTripleChecker+Invalid, 5412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:25,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2993 Valid, 15649 Invalid, 5412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-01 15:09:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279508 states. [2022-03-01 15:09:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279508 to 168124. [2022-03-01 15:09:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168124 states, 168120 states have (on average 3.0828872234118485) internal successors, (518295), 168123 states have internal predecessors, (518295), 0 states have call successors, (0), 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-01 15:09:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168124 states to 168124 states and 518295 transitions. [2022-03-01 15:09:30,973 INFO L78 Accepts]: Start accepts. Automaton has 168124 states and 518295 transitions. Word has length 114 [2022-03-01 15:09:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:30,973 INFO L470 AbstractCegarLoop]: Abstraction has 168124 states and 518295 transitions. [2022-03-01 15:09:30,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 168124 states and 518295 transitions. [2022-03-01 15:09:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:09:31,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:31,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:31,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-01 15:09:31,550 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2084097448, now seen corresponding path program 39 times [2022-03-01 15:09:31,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:31,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073912415] [2022-03-01 15:09:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:32,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-01 15:09:32,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:32,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073912415] [2022-03-01 15:09:32,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073912415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:32,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:32,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:09:32,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149064705] [2022-03-01 15:09:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:32,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:09:32,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:09:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:09:32,148 INFO L87 Difference]: Start difference. First operand 168124 states and 518295 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:09:39,967 INFO L93 Difference]: Finished difference Result 266110 states and 820035 transitions. [2022-03-01 15:09:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-01 15:09:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-03-01 15:09:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:09:40,912 INFO L225 Difference]: With dead ends: 266110 [2022-03-01 15:09:40,913 INFO L226 Difference]: Without dead ends: 266110 [2022-03-01 15:09:40,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1282, Invalid=3688, Unknown=0, NotChecked=0, Total=4970 [2022-03-01 15:09:40,913 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 3112 mSDsluCounter, 11864 mSDsCounter, 0 mSdLazyCounter, 4461 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3112 SdHoareTripleChecker+Valid, 12910 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:40,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3112 Valid, 12910 Invalid, 4524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4461 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 15:09:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266110 states. [2022-03-01 15:09:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266110 to 171589. [2022-03-01 15:09:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171589 states, 171585 states have (on average 3.0842905848413324) internal successors, (529218), 171588 states have internal predecessors, (529218), 0 states have call successors, (0), 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-01 15:09:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171589 states to 171589 states and 529218 transitions. [2022-03-01 15:09:46,570 INFO L78 Accepts]: Start accepts. Automaton has 171589 states and 529218 transitions. Word has length 114 [2022-03-01 15:09:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:09:46,570 INFO L470 AbstractCegarLoop]: Abstraction has 171589 states and 529218 transitions. [2022-03-01 15:09:46,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 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-01 15:09:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 171589 states and 529218 transitions. [2022-03-01 15:09:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-01 15:09:46,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:09:46,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 15:09:46,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-01 15:09:46,818 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-03-01 15:09:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:09:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 728593944, now seen corresponding path program 40 times [2022-03-01 15:09:46,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:09:46,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107892894] [2022-03-01 15:09:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:09:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:09:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:09:47,404 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-01 15:09:47,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:09:47,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107892894] [2022-03-01 15:09:47,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107892894] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:09:47,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:09:47,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-03-01 15:09:47,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51526667] [2022-03-01 15:09:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:09:47,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-01 15:09:47,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:09:47,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-01 15:09:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2022-03-01 15:09:47,405 INFO L87 Difference]: Start difference. First operand 171589 states and 529218 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-01 15:09:52,599 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 15:09:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-01 15:09:52,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1112, Invalid=2670, Unknown=0, NotChecked=0, Total=3782 [2022-03-01 15:09:52,600 INFO L933 BasicCegarLoop]: 527 mSDtfsCounter, 1668 mSDsluCounter, 5438 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 5965 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:09:52,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1668 Valid, 5965 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 15:09:52,601 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2022-03-01 15:09:52,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-01 15:09:52,608 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2022-03-01 15:09:52,610 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2022-03-01 15:09:52,619 INFO L732 BasicCegarLoop]: Path program histogram: [40, 1, 1] [2022-03-01 15:09:52,622 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 15:09:52,622 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 15:09:52,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 03:09:52 BasicIcfg [2022-03-01 15:09:52,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 15:09:52,627 INFO L158 Benchmark]: Toolchain (without parser) took 647428.83ms. Allocated memory was 183.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 127.0MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.58ms. Allocated memory was 183.5MB in the beginning and 294.6MB in the end (delta: 111.1MB). Free memory was 126.9MB in the beginning and 241.3MB in the end (delta: -114.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.19ms. Allocated memory is still 294.6MB. Free memory was 241.3MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 294.6MB. Free memory was 238.2MB in the beginning and 236.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: RCFGBuilder took 447.32ms. Allocated memory is still 294.6MB. Free memory was 236.1MB in the beginning and 216.9MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L158 Benchmark]: TraceAbstraction took 646389.43ms. Allocated memory was 294.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 216.2MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-03-01 15:09:52,627 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 507.58ms. Allocated memory was 183.5MB in the beginning and 294.6MB in the end (delta: 111.1MB). Free memory was 126.9MB in the beginning and 241.3MB in the end (delta: -114.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.19ms. Allocated memory is still 294.6MB. Free memory was 241.3MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 294.6MB. Free memory was 238.2MB in the beginning and 236.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 447.32ms. Allocated memory is still 294.6MB. Free memory was 236.1MB in the beginning and 216.9MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 646389.43ms. Allocated memory was 294.6MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 216.2MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (171589states) and FLOYD_HOARE automaton (currently 37 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (29102 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 646.2s, OverallIterations: 42, TraceHistogramMax: 1, PathProgramHistogramMax: 40, EmptinessCheckTime: 10.3s, AutomataDifference: 407.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132284 SdHoareTripleChecker+Valid, 78.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132284 mSDsluCounter, 537882 SdHoareTripleChecker+Invalid, 66.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486600 mSDsCounter, 3272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174155 IncrementalHoareTripleChecker+Invalid, 177427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3272 mSolverCounterUnsat, 51282 mSDtfsCounter, 174155 mSolverCounterSat, 1.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3348 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 3230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42555 ImplicationChecksByTransitivity, 254.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171589occurred in iteration=41, InterpolantAutomatonStates: 2256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 194.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 2300247 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 4745 NumberOfCodeBlocks, 4745 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 4703 ConstructedInterpolants, 0 QuantifiedInterpolants, 72849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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 could not prove your program: Timeout Completed graceful shutdown