/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:43:46,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:43:46,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:43:46,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:43:46,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:43:46,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:43:46,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:43:46,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:43:46,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:43:46,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:43:46,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:43:46,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:43:46,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:43:46,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:43:46,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:43:46,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:43:46,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:43:46,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:43:46,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:43:46,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:43:46,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:43:46,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:43:46,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:43:46,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:43:46,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:43:46,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:43:46,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:43:46,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:43:46,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:43:46,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:43:46,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:43:46,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:43:46,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:43:46,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:43:46,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:43:46,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:43:46,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:43:46,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:43:46,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:43:46,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:43:46,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:43:46,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:43:46,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:43:46,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:43:46,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:43:46,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:43:46,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:43:46,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:43:46,581 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:43:46,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:43:46,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:43:46,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:43:46,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:43:46,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:43:46,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:46,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:43:46,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:43:46,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:43:46,585 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:43:46,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:43:46,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:43:46,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:43:46,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:43:46,844 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:43:46,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-03-15 19:43:46,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992c28dcb/6a5e17d7a0fa4f65a3cc05e22aae24af/FLAG7759f27a5 [2022-03-15 19:43:47,328 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:43:47,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-03-15 19:43:47,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992c28dcb/6a5e17d7a0fa4f65a3cc05e22aae24af/FLAG7759f27a5 [2022-03-15 19:43:47,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992c28dcb/6a5e17d7a0fa4f65a3cc05e22aae24af [2022-03-15 19:43:47,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:43:47,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:43:47,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:47,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:43:47,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:43:47,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be5b79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47, skipping insertion in model container [2022-03-15 19:43:47,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:43:47,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:43:47,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/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-03-15 19:43:47,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:47,660 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:43:47,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2650,2663] [2022-03-15 19:43:47,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:47,712 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:43:47,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47 WrapperNode [2022-03-15 19:43:47,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:47,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:47,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:43:47,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:43:47,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,768 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-03-15 19:43:47,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:47,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:43:47,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:43:47,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:43:47,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:43:47,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:43:47,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:43:47,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:43:47,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (1/1) ... [2022-03-15 19:43:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:47,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:43:47,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:43:47,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:43:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:43:47,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:43:47,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:43:47,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:43:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:43:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:43:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:43:47,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:43:47,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:43:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:43:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:43:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:43:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:43:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:43:47,909 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:43:48,015 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:43:48,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:43:48,264 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:43:48,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:43:48,349 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:43:48,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:48 BoogieIcfgContainer [2022-03-15 19:43:48,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:43:48,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:43:48,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:43:48,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:43:48,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:43:47" (1/3) ... [2022-03-15 19:43:48,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508c61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:48, skipping insertion in model container [2022-03-15 19:43:48,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:47" (2/3) ... [2022-03-15 19:43:48,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508c61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:48, skipping insertion in model container [2022-03-15 19:43:48,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:48" (3/3) ... [2022-03-15 19:43:48,363 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-03-15 19:43:48,373 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:43:48,373 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:43:48,373 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:43:48,373 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:43:48,421 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,429 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,430 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,431 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,431 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,431 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,431 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,432 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,433 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,435 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,435 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,435 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,436 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,436 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,436 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,436 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,445 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,446 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,446 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,447 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,447 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,447 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,448 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,448 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:48,452 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:43:48,496 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:43:48,503 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:43:48,505 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:43:48,525 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:43:48,533 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 133 transitions, 282 flow [2022-03-15 19:43:48,536 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 133 transitions, 282 flow [2022-03-15 19:43:48,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 133 transitions, 282 flow [2022-03-15 19:43:48,605 INFO L129 PetriNetUnfolder]: 11/131 cut-off events. [2022-03-15 19:43:48,605 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:43:48,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 131 events. 11/131 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-03-15 19:43:48,614 INFO L116 LiptonReduction]: Number of co-enabled transitions 732 [2022-03-15 19:43:52,690 INFO L131 LiptonReduction]: Checked pairs total: 792 [2022-03-15 19:43:52,691 INFO L133 LiptonReduction]: Total number of compositions: 134 [2022-03-15 19:43:52,698 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 54 flow [2022-03-15 19:43:52,710 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:43:52,717 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:52,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:52,717 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash 107740850, now seen corresponding path program 1 times [2022-03-15 19:43:52,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:52,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217549204] [2022-03-15 19:43:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:52,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:52,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217549204] [2022-03-15 19:43:52,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217549204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:52,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:52,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:43:52,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697817837] [2022-03-15 19:43:52,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:52,949 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:52,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 41 transitions. [2022-03-15 19:43:52,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:53,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:53,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:43:53,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:43:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:43:53,204 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:53,245 INFO L93 Difference]: Finished difference Result 50 states and 107 transitions. [2022-03-15 19:43:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:43:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-03-15 19:43:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:53,254 INFO L225 Difference]: With dead ends: 50 [2022-03-15 19:43:53,255 INFO L226 Difference]: Without dead ends: 35 [2022-03-15 19:43:53,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:43:53,259 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:53,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-15 19:43:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-03-15 19:43:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 75 transitions. [2022-03-15 19:43:53,295 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 75 transitions. Word has length 13 [2022-03-15 19:43:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:53,296 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 75 transitions. [2022-03-15 19:43:53,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 75 transitions. [2022-03-15 19:43:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:43:53,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:53,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:53,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:43:53,300 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1796504966, now seen corresponding path program 1 times [2022-03-15 19:43:53,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:53,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049190241] [2022-03-15 19:43:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:53,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:53,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049190241] [2022-03-15 19:43:53,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049190241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:53,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:53,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:43:53,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965097036] [2022-03-15 19:43:53,399 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:53,401 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:53,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 54 transitions. [2022-03-15 19:43:53,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:53,555 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:53,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:43:53,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:43:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:43:53,557 INFO L87 Difference]: Start difference. First operand 35 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:53,583 INFO L93 Difference]: Finished difference Result 29 states and 55 transitions. [2022-03-15 19:43:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:43:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:43:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:53,584 INFO L225 Difference]: With dead ends: 29 [2022-03-15 19:43:53,584 INFO L226 Difference]: Without dead ends: 27 [2022-03-15 19:43:53,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:43:53,585 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:53,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-15 19:43:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-15 19:43:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 52 transitions. [2022-03-15 19:43:53,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 52 transitions. Word has length 14 [2022-03-15 19:43:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:53,590 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 52 transitions. [2022-03-15 19:43:53,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 52 transitions. [2022-03-15 19:43:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:43:53,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:53,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:53,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:43:53,591 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1398736720, now seen corresponding path program 1 times [2022-03-15 19:43:53,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:53,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502573818] [2022-03-15 19:43:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:53,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:53,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502573818] [2022-03-15 19:43:53,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502573818] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:53,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:53,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:43:53,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318768960] [2022-03-15 19:43:53,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:53,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:53,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 39 transitions. [2022-03-15 19:43:53,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:53,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:53,863 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:53,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:53,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:43:53,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:43:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:43:53,879 INFO L87 Difference]: Start difference. First operand 27 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:53,937 INFO L93 Difference]: Finished difference Result 35 states and 61 transitions. [2022-03-15 19:43:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:43:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:53,939 INFO L225 Difference]: With dead ends: 35 [2022-03-15 19:43:53,939 INFO L226 Difference]: Without dead ends: 28 [2022-03-15 19:43:53,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:53,942 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:53,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 3 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-15 19:43:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-03-15 19:43:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2022-03-15 19:43:53,950 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 15 [2022-03-15 19:43:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:53,950 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 53 transitions. [2022-03-15 19:43:53,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2022-03-15 19:43:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:43:53,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:53,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:53,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:43:53,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1652768944, now seen corresponding path program 1 times [2022-03-15 19:43:53,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:53,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195967385] [2022-03-15 19:43:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:54,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:54,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195967385] [2022-03-15 19:43:54,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195967385] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:54,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651032331] [2022-03-15 19:43:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:54,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:54,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:43:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:54,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:43:54,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:54,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:43:54,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:43:54,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:43:54,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:43:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:54,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:55,560 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:55,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2022-03-15 19:43:55,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:55,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 462 [2022-03-15 19:43:55,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:55,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 446 treesize of output 426 [2022-03-15 19:43:55,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:55,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 410 treesize of output 354 [2022-03-15 19:43:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:56,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651032331] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:56,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:56,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-03-15 19:43:56,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460287756] [2022-03-15 19:43:56,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:56,051 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:56,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 40 transitions. [2022-03-15 19:43:56,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:56,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [604#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 605#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:43:56,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:43:56,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:43:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=432, Unknown=3, NotChecked=0, Total=552 [2022-03-15 19:43:56,697 INFO L87 Difference]: Start difference. First operand 28 states and 53 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:56,912 INFO L93 Difference]: Finished difference Result 53 states and 103 transitions. [2022-03-15 19:43:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:43:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:43:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:56,914 INFO L225 Difference]: With dead ends: 53 [2022-03-15 19:43:56,914 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 19:43:56,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=506, Unknown=3, NotChecked=0, Total=650 [2022-03-15 19:43:56,915 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:56,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 19:43:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-03-15 19:43:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 74 transitions. [2022-03-15 19:43:56,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 74 transitions. Word has length 16 [2022-03-15 19:43:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:56,919 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 74 transitions. [2022-03-15 19:43:56,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2022-03-15 19:43:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:43:56,920 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:56,921 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:56,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:57,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:57,136 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1145274308, now seen corresponding path program 2 times [2022-03-15 19:43:57,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:57,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740898699] [2022-03-15 19:43:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:57,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:57,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740898699] [2022-03-15 19:43:57,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740898699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:57,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838588739] [2022-03-15 19:43:57,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:57,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:57,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:57,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:43:57,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:57,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:57,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:43:57,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:57,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:57,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838588739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:57,656 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:57,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 19:43:57,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [177262130] [2022-03-15 19:43:57,657 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:57,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:57,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 48 transitions. [2022-03-15 19:43:57,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:57,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:43:57,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:57,859 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:57,871 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:57,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [856#(and (or (< ~back~0 0) (<= ~n~0 ~back~0) (<= ~n~0 1)) (or (< ~back~0 0) (< 0 (+ ~front~0 1)) (<= ~n~0 ~back~0)))] [2022-03-15 19:43:57,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:43:57,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:57,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:43:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:43:57,928 INFO L87 Difference]: Start difference. First operand 40 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:58,027 INFO L93 Difference]: Finished difference Result 44 states and 80 transitions. [2022-03-15 19:43:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:43:58,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:43:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:58,028 INFO L225 Difference]: With dead ends: 44 [2022-03-15 19:43:58,028 INFO L226 Difference]: Without dead ends: 29 [2022-03-15 19:43:58,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:43:58,029 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:58,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-15 19:43:58,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-03-15 19:43:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2022-03-15 19:43:58,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 17 [2022-03-15 19:43:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:58,033 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. [2022-03-15 19:43:58,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. [2022-03-15 19:43:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:43:58,034 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:58,034 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:58,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:58,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:58,247 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1760164016, now seen corresponding path program 3 times [2022-03-15 19:43:58,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:58,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143085196] [2022-03-15 19:43:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:58,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:58,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:58,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143085196] [2022-03-15 19:43:58,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143085196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:58,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614846739] [2022-03-15 19:43:58,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:58,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:58,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:58,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:43:58,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:43:58,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:58,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:43:58,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:58,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:43:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:58,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:59,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:59,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 54 [2022-03-15 19:43:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:43:59,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614846739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:59,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:59,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 16 [2022-03-15 19:43:59,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762618375] [2022-03-15 19:43:59,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:59,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:59,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2022-03-15 19:43:59,301 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:59,911 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1078#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 1077#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (<= 0 ~back~0))))] [2022-03-15 19:43:59,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:43:59,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:59,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:43:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:43:59,912 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:00,151 INFO L93 Difference]: Finished difference Result 54 states and 104 transitions. [2022-03-15 19:44:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:44:00,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:44:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:00,155 INFO L225 Difference]: With dead ends: 54 [2022-03-15 19:44:00,155 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 19:44:00,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:44:00,156 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:00,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 19:44:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-03-15 19:44:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2022-03-15 19:44:00,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 17 [2022-03-15 19:44:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:00,160 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2022-03-15 19:44:00,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2022-03-15 19:44:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:44:00,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:00,161 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:00,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:00,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:00,371 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2110994372, now seen corresponding path program 4 times [2022-03-15 19:44:00,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:00,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385521518] [2022-03-15 19:44:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:00,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:00,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385521518] [2022-03-15 19:44:00,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385521518] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:00,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473949723] [2022-03-15 19:44:00,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:00,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:00,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:44:00,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:00,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:00,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:44:00,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:00,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 88 [2022-03-15 19:44:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:00,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:00,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2022-03-15 19:44:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:00,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473949723] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:00,770 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:00,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 9 [2022-03-15 19:44:00,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995247867] [2022-03-15 19:44:00,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:00,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:00,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 19:44:00,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:00,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:44:01,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:44:01,101 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1335#(or (< ~back~0 0) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0))] [2022-03-15 19:44:01,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:44:01,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:01,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:44:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:44:01,102 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:01,159 INFO L93 Difference]: Finished difference Result 81 states and 157 transitions. [2022-03-15 19:44:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:44:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 18 [2022-03-15 19:44:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:01,160 INFO L225 Difference]: With dead ends: 81 [2022-03-15 19:44:01,160 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 19:44:01,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:44:01,161 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:01,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 19:44:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2022-03-15 19:44:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.111111111111111) internal successors, (114), 54 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-15 19:44:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 114 transitions. [2022-03-15 19:44:01,166 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 114 transitions. Word has length 18 [2022-03-15 19:44:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:01,167 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 114 transitions. [2022-03-15 19:44:01,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 114 transitions. [2022-03-15 19:44:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:44:01,168 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:01,168 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:01,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:01,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:01,387 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 794443952, now seen corresponding path program 5 times [2022-03-15 19:44:01,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:01,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474041748] [2022-03-15 19:44:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:01,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:01,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474041748] [2022-03-15 19:44:01,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474041748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:01,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367050580] [2022-03-15 19:44:01,964 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:01,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:01,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:01,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:01,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:44:02,035 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:02,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:02,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:44:02,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:02,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:44:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:02,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:02,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:02,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 52 [2022-03-15 19:44:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:02,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367050580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:02,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:02,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 18 [2022-03-15 19:44:02,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066790875] [2022-03-15 19:44:02,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:02,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:02,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 42 transitions. [2022-03-15 19:44:02,485 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:02,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1649#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 1650#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:44:02,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:02,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:02,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:02,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:44:02,953 INFO L87 Difference]: Start difference. First operand 55 states and 114 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:03,503 INFO L93 Difference]: Finished difference Result 92 states and 198 transitions. [2022-03-15 19:44:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:44:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:03,505 INFO L225 Difference]: With dead ends: 92 [2022-03-15 19:44:03,505 INFO L226 Difference]: Without dead ends: 79 [2022-03-15 19:44:03,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:44:03,506 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:03,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 7 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-03-15 19:44:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-03-15 19:44:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.109090909090909) internal successors, (116), 55 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 116 transitions. [2022-03-15 19:44:03,511 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 116 transitions. Word has length 18 [2022-03-15 19:44:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:03,511 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 116 transitions. [2022-03-15 19:44:03,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 116 transitions. [2022-03-15 19:44:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:03,512 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:03,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:03,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:03,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:03,720 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2087745294, now seen corresponding path program 6 times [2022-03-15 19:44:03,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:03,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217615737] [2022-03-15 19:44:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:04,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:04,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217615737] [2022-03-15 19:44:04,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217615737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:04,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348879006] [2022-03-15 19:44:04,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:04,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:04,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:44:04,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:44:04,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:04,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:44:04,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:04,473 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:04,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-03-15 19:44:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:04,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:04,768 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:44:04,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 190 [2022-03-15 19:44:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:05,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348879006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:05,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:05,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2022-03-15 19:44:05,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874918652] [2022-03-15 19:44:05,479 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:05,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:05,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 52 transitions. [2022-03-15 19:44:05,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:06,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2007#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0)))), 2008#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 2009#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:44:06,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:06,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:06,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:44:06,672 INFO L87 Difference]: Start difference. First operand 56 states and 116 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:07,029 INFO L93 Difference]: Finished difference Result 96 states and 202 transitions. [2022-03-15 19:44:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:44:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:44:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:07,030 INFO L225 Difference]: With dead ends: 96 [2022-03-15 19:44:07,030 INFO L226 Difference]: Without dead ends: 87 [2022-03-15 19:44:07,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:44:07,032 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:07,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-03-15 19:44:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2022-03-15 19:44:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 68 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 140 transitions. [2022-03-15 19:44:07,037 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 140 transitions. Word has length 19 [2022-03-15 19:44:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:07,037 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 140 transitions. [2022-03-15 19:44:07,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 140 transitions. [2022-03-15 19:44:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:07,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:07,038 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:07,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:07,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:07,248 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1086681220, now seen corresponding path program 7 times [2022-03-15 19:44:07,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:07,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622937816] [2022-03-15 19:44:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:07,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:07,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622937816] [2022-03-15 19:44:07,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622937816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:07,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593868792] [2022-03-15 19:44:07,720 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:07,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:07,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:07,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:07,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:44:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:07,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:44:07,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:08,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:08,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:08,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 16 [2022-03-15 19:44:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:08,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:08,619 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:44:08,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 186 [2022-03-15 19:44:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:09,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593868792] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:09,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:09,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2022-03-15 19:44:09,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985330728] [2022-03-15 19:44:09,560 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:09,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:09,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2022-03-15 19:44:09,570 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:10,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2393#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0))), 2392#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:44:10,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:44:10,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:44:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:44:10,218 INFO L87 Difference]: Start difference. First operand 69 states and 140 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:10,600 INFO L93 Difference]: Finished difference Result 114 states and 249 transitions. [2022-03-15 19:44:10,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:44:10,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:44:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:10,601 INFO L225 Difference]: With dead ends: 114 [2022-03-15 19:44:10,601 INFO L226 Difference]: Without dead ends: 101 [2022-03-15 19:44:10,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:44:10,602 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:10,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 6 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-15 19:44:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2022-03-15 19:44:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.0588235294117645) internal successors, (140), 68 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 140 transitions. [2022-03-15 19:44:10,610 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 140 transitions. Word has length 19 [2022-03-15 19:44:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:10,610 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 140 transitions. [2022-03-15 19:44:10,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 140 transitions. [2022-03-15 19:44:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:10,611 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:10,611 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:10,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:10,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:10,824 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 921893040, now seen corresponding path program 8 times [2022-03-15 19:44:10,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:10,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009538970] [2022-03-15 19:44:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:11,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:11,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009538970] [2022-03-15 19:44:11,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009538970] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:11,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808278716] [2022-03-15 19:44:11,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:11,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:11,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:11,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:11,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:44:11,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:11,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:11,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:44:11,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:11,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:44:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:11,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:11,469 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:11,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 54 [2022-03-15 19:44:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:11,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808278716] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:11,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:11,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 4] total 19 [2022-03-15 19:44:11,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965862498] [2022-03-15 19:44:11,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:11,615 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:11,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 43 transitions. [2022-03-15 19:44:11,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:11,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2788#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 2787#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:44:11,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:44:11,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:44:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:44:11,958 INFO L87 Difference]: Start difference. First operand 69 states and 140 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:12,396 INFO L93 Difference]: Finished difference Result 124 states and 265 transitions. [2022-03-15 19:44:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:44:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:44:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:12,398 INFO L225 Difference]: With dead ends: 124 [2022-03-15 19:44:12,398 INFO L226 Difference]: Without dead ends: 111 [2022-03-15 19:44:12,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:44:12,399 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:12,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-15 19:44:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-03-15 19:44:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 69 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2022-03-15 19:44:12,403 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 19 [2022-03-15 19:44:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:12,403 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2022-03-15 19:44:12,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2022-03-15 19:44:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:12,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:12,404 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:12,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:12,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:44:12,623 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1137098694, now seen corresponding path program 9 times [2022-03-15 19:44:12,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:12,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580114337] [2022-03-15 19:44:12,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:12,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:12,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580114337] [2022-03-15 19:44:12,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580114337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:12,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438975175] [2022-03-15 19:44:12,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:12,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:12,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:12,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:44:12,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:44:12,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:12,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:44:12,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:12,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:13,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438975175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:13,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:13,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 19:44:13,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854299034] [2022-03-15 19:44:13,152 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:13,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:13,162 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 60 transitions. [2022-03-15 19:44:13,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:13,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:44:13,212 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:44:13,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:44:13,310 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:44:13,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3206#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ 2 ~front~0))), 3181#(or (< ~back~0 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)))] [2022-03-15 19:44:13,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:44:13,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:44:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:44:13,480 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:13,547 INFO L93 Difference]: Finished difference Result 88 states and 175 transitions. [2022-03-15 19:44:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:44:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:44:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:13,548 INFO L225 Difference]: With dead ends: 88 [2022-03-15 19:44:13,548 INFO L226 Difference]: Without dead ends: 57 [2022-03-15 19:44:13,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:44:13,549 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:13,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 5 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-15 19:44:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-03-15 19:44:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 56 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 117 transitions. [2022-03-15 19:44:13,553 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 117 transitions. Word has length 20 [2022-03-15 19:44:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:13,553 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 117 transitions. [2022-03-15 19:44:13,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 117 transitions. [2022-03-15 19:44:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:13,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:13,554 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:13,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:13,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:13,759 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1863176434, now seen corresponding path program 10 times [2022-03-15 19:44:13,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:13,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937550079] [2022-03-15 19:44:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:14,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:14,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937550079] [2022-03-15 19:44:14,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937550079] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:14,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139559522] [2022-03-15 19:44:14,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:14,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:14,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:14,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:44:14,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:14,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:14,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:44:14,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:14,789 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:44:14,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:44:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:14,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:15,230 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:44:15,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 186 [2022-03-15 19:44:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:15,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139559522] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:15,772 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:15,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 5] total 23 [2022-03-15 19:44:15,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322809962] [2022-03-15 19:44:15,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:15,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:15,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2022-03-15 19:44:15,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:17,584 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [3552#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 3551#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~front~0 4) 4)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 (+ ~front~0 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~front~0 0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 3550#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~front~0 4) 4) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (* ~front~0 4) 4) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)) (not (<= 0 ~back~0))))] [2022-03-15 19:44:17,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:44:17,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:44:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:44:17,585 INFO L87 Difference]: Start difference. First operand 57 states and 117 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:17,976 INFO L93 Difference]: Finished difference Result 97 states and 203 transitions. [2022-03-15 19:44:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:44:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:17,977 INFO L225 Difference]: With dead ends: 97 [2022-03-15 19:44:17,977 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 19:44:17,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:44:17,979 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:17,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 19:44:17,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2022-03-15 19:44:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 69 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 141 transitions. [2022-03-15 19:44:17,983 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 141 transitions. Word has length 20 [2022-03-15 19:44:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:17,983 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 141 transitions. [2022-03-15 19:44:17,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 141 transitions. [2022-03-15 19:44:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:17,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:17,984 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:18,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:18,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:44:18,210 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1430726788, now seen corresponding path program 11 times [2022-03-15 19:44:18,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:18,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668797318] [2022-03-15 19:44:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:18,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:18,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668797318] [2022-03-15 19:44:18,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668797318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:18,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068860953] [2022-03-15 19:44:18,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:18,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:18,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:18,761 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:18,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:44:18,911 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:18,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:18,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:44:18,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:19,108 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:19,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:44:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:19,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:19,412 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:44:19,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 192 [2022-03-15 19:44:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:19,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068860953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:19,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:19,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 5] total 22 [2022-03-15 19:44:19,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850315922] [2022-03-15 19:44:19,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:19,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:19,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2022-03-15 19:44:19,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:20,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3934#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 3935#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:44:20,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:44:20,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:44:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:44:20,529 INFO L87 Difference]: Start difference. First operand 70 states and 141 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:20,901 INFO L93 Difference]: Finished difference Result 115 states and 250 transitions. [2022-03-15 19:44:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:20,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:44:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:20,902 INFO L225 Difference]: With dead ends: 115 [2022-03-15 19:44:20,902 INFO L226 Difference]: Without dead ends: 102 [2022-03-15 19:44:20,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:44:20,902 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:20,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-03-15 19:44:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-03-15 19:44:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 69 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 141 transitions. [2022-03-15 19:44:20,906 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 141 transitions. Word has length 20 [2022-03-15 19:44:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:20,906 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 141 transitions. [2022-03-15 19:44:20,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 141 transitions. [2022-03-15 19:44:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:20,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:20,907 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:20,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:21,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:44:21,116 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 577847472, now seen corresponding path program 12 times [2022-03-15 19:44:21,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:21,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063532393] [2022-03-15 19:44:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:21,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:21,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063532393] [2022-03-15 19:44:21,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063532393] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:21,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382006327] [2022-03-15 19:44:21,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:21,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:21,504 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:44:21,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:21,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:21,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:44:21,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:21,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:44:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:44:21,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:21,842 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:21,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 54 [2022-03-15 19:44:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:44:22,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382006327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:22,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:22,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 16 [2022-03-15 19:44:22,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033141326] [2022-03-15 19:44:22,007 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:22,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:22,015 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 44 transitions. [2022-03-15 19:44:22,015 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:22,345 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4336#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 4335#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:44:22,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:44:22,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:22,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:44:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:44:22,346 INFO L87 Difference]: Start difference. First operand 70 states and 141 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:22,610 INFO L93 Difference]: Finished difference Result 119 states and 258 transitions. [2022-03-15 19:44:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:44:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:44:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:22,611 INFO L225 Difference]: With dead ends: 119 [2022-03-15 19:44:22,612 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 19:44:22,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:44:22,612 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:22,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 6 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 19:44:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2022-03-15 19:44:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.111111111111111) internal successors, (133), 63 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 133 transitions. [2022-03-15 19:44:22,619 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 133 transitions. Word has length 20 [2022-03-15 19:44:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:22,620 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 133 transitions. [2022-03-15 19:44:22,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 133 transitions. [2022-03-15 19:44:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:44:22,620 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:22,620 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:22,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:44:22,831 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1082390586, now seen corresponding path program 13 times [2022-03-15 19:44:22,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:22,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774980911] [2022-03-15 19:44:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:22,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:22,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774980911] [2022-03-15 19:44:22,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774980911] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:22,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699198801] [2022-03-15 19:44:22,924 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:22,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:22,928 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:22,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:44:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:23,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:44:23,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:23,154 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:23,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 116 [2022-03-15 19:44:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:23,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:23,405 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-03-15 19:44:23,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 145 [2022-03-15 19:44:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:23,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699198801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:23,484 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:23,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2022-03-15 19:44:23,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [185131797] [2022-03-15 19:44:23,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:23,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:23,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 61 transitions. [2022-03-15 19:44:23,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:23,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:44:23,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:44:23,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:44:23,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:44:23,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4732#(or (< ~back~0 0) (<= ~back~0 (+ ~front~0 1))), 4733#(or (< ~back~0 0) (<= ~back~0 ~front~0))] [2022-03-15 19:44:23,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:44:23,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:44:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:44:23,843 INFO L87 Difference]: Start difference. First operand 64 states and 133 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:23,931 INFO L93 Difference]: Finished difference Result 136 states and 286 transitions. [2022-03-15 19:44:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:44:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:44:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:23,933 INFO L225 Difference]: With dead ends: 136 [2022-03-15 19:44:23,933 INFO L226 Difference]: Without dead ends: 130 [2022-03-15 19:44:23,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:44:23,933 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:23,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-15 19:44:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2022-03-15 19:44:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.2337662337662336) internal successors, (172), 77 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 172 transitions. [2022-03-15 19:44:23,938 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 172 transitions. Word has length 21 [2022-03-15 19:44:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:23,938 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 172 transitions. [2022-03-15 19:44:23,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 172 transitions. [2022-03-15 19:44:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:44:23,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:23,939 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:23,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 19:44:24,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:44:24,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -212301582, now seen corresponding path program 14 times [2022-03-15 19:44:24,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:24,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935821095] [2022-03-15 19:44:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:24,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:24,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935821095] [2022-03-15 19:44:24,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935821095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:24,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492864920] [2022-03-15 19:44:24,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:24,960 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:24,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:44:25,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:25,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:25,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:44:25,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:25,300 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:25,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-03-15 19:44:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:25,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:25,531 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:44:25,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 192 [2022-03-15 19:44:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:25,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492864920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:25,871 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:25,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 5] total 24 [2022-03-15 19:44:25,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927102105] [2022-03-15 19:44:25,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:25,873 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:25,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 54 transitions. [2022-03-15 19:44:25,879 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:27,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [5175#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= 2 ~front~0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= ~front~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)))), 5174#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~front~0 2) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= 2 ~front~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= 2 ~front~0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)))), 5176#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:44:27,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:44:27,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:44:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:44:27,799 INFO L87 Difference]: Start difference. First operand 78 states and 172 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:28,555 INFO L93 Difference]: Finished difference Result 169 states and 391 transitions. [2022-03-15 19:44:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:44:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:44:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:28,556 INFO L225 Difference]: With dead ends: 169 [2022-03-15 19:44:28,556 INFO L226 Difference]: Without dead ends: 154 [2022-03-15 19:44:28,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=223, Invalid=1259, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:44:28,557 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:28,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 8 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-03-15 19:44:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 88. [2022-03-15 19:44:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.160919540229885) internal successors, (188), 87 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 188 transitions. [2022-03-15 19:44:28,561 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 188 transitions. Word has length 21 [2022-03-15 19:44:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:28,561 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 188 transitions. [2022-03-15 19:44:28,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 188 transitions. [2022-03-15 19:44:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:44:28,562 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:28,562 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:28,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:28,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,775 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 788762492, now seen corresponding path program 15 times [2022-03-15 19:44:28,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:28,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978077312] [2022-03-15 19:44:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:29,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:29,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978077312] [2022-03-15 19:44:29,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978077312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:29,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284319172] [2022-03-15 19:44:29,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:29,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:29,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:44:29,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:29,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:29,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:44:29,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:29,780 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:29,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:44:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:29,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:30,052 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:44:30,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 180 [2022-03-15 19:44:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:30,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284319172] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:30,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:30,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 22 [2022-03-15 19:44:30,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181717842] [2022-03-15 19:44:30,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:30,434 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:30,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 49 transitions. [2022-03-15 19:44:30,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:31,263 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [5686#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ ~queue~0.offset (* ~back~0 4)) 3) (not (<= ~front~0 1)) (not (<= 0 ~back~0)) (= (+ (* ~back~0 8) ~queue~0.offset 8) (+ (* ~front~0 4) 12))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0) (= 8 (+ ~queue~0.offset (* ~back~0 4)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0)))), 5687#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ ~queue~0.offset (* ~back~0 4)) 3) (not (<= ~front~0 1)) (not (<= 0 ~back~0)) (= (+ (* ~back~0 8) ~queue~0.offset 8) (+ (* ~front~0 4) 12))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0) (= 8 (+ ~queue~0.offset (* ~back~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0))))] [2022-03-15 19:44:31,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:44:31,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:44:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:44:31,264 INFO L87 Difference]: Start difference. First operand 88 states and 188 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:31,674 INFO L93 Difference]: Finished difference Result 163 states and 374 transitions. [2022-03-15 19:44:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:44:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 21 [2022-03-15 19:44:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:31,676 INFO L225 Difference]: With dead ends: 163 [2022-03-15 19:44:31,676 INFO L226 Difference]: Without dead ends: 150 [2022-03-15 19:44:31,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:44:31,677 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:31,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 8 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-03-15 19:44:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 79. [2022-03-15 19:44:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.230769230769231) internal successors, (174), 78 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 174 transitions. [2022-03-15 19:44:31,680 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 174 transitions. Word has length 21 [2022-03-15 19:44:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:31,680 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 174 transitions. [2022-03-15 19:44:31,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 174 transitions. [2022-03-15 19:44:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:44:31,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:31,681 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:31,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:31,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:44:31,891 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash -184880272, now seen corresponding path program 16 times [2022-03-15 19:44:31,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:31,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777797605] [2022-03-15 19:44:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:32,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:32,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777797605] [2022-03-15 19:44:32,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777797605] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:32,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744856657] [2022-03-15 19:44:32,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:32,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:32,427 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:32,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:44:32,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:32,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:32,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:44:32,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:33,012 INFO L353 Elim1Store]: treesize reduction 166, result has 4.0 percent of original size [2022-03-15 19:44:33,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 24 [2022-03-15 19:44:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:33,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:35,514 INFO L353 Elim1Store]: treesize reduction 171, result has 30.5 percent of original size [2022-03-15 19:44:35,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 288 treesize of output 248 [2022-03-15 19:44:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:36,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744856657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:36,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:36,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:44:36,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819809756] [2022-03-15 19:44:36,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:36,535 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:36,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 64 transitions. [2022-03-15 19:44:36,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:38,656 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [6186#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 6184#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 6185#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 6183#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:44:38,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:44:38,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:44:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:44:38,657 INFO L87 Difference]: Start difference. First operand 79 states and 174 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:39,119 INFO L93 Difference]: Finished difference Result 115 states and 252 transitions. [2022-03-15 19:44:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:44:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:44:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:39,120 INFO L225 Difference]: With dead ends: 115 [2022-03-15 19:44:39,120 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 19:44:39,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=337, Invalid=1643, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:44:39,121 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:39,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 8 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 19:44:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2022-03-15 19:44:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.182795698924731) internal successors, (203), 93 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 203 transitions. [2022-03-15 19:44:39,125 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 203 transitions. Word has length 22 [2022-03-15 19:44:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:39,125 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 203 transitions. [2022-03-15 19:44:39,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 203 transitions. [2022-03-15 19:44:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:44:39,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:39,126 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:39,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:39,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:39,335 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash 783334950, now seen corresponding path program 17 times [2022-03-15 19:44:39,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:39,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670668167] [2022-03-15 19:44:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:39,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:39,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670668167] [2022-03-15 19:44:39,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670668167] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:39,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908301817] [2022-03-15 19:44:39,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:39,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:39,782 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:39,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:44:39,868 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:39,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:39,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:44:39,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:39,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:44:40,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:44:40,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:44:40,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:40,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:40,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:40,406 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:40,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 18 [2022-03-15 19:44:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:40,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:41,411 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:41,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 176 [2022-03-15 19:44:41,465 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:44:41,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1106 treesize of output 1028 [2022-03-15 19:44:41,524 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:44:41,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 950 treesize of output 788 [2022-03-15 19:44:41,586 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:44:41,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 710 treesize of output 668 [2022-03-15 19:44:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:45,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908301817] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:45,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:45,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-03-15 19:44:45,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802295885] [2022-03-15 19:44:45,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:45,404 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:45,414 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 59 transitions. [2022-03-15 19:44:45,414 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:46,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6662#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 6661#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~back~0 4) 8))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4)))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 6663#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:44:46,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:46,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1331, Unknown=5, NotChecked=0, Total=1722 [2022-03-15 19:44:46,519 INFO L87 Difference]: Start difference. First operand 94 states and 203 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:48,039 INFO L93 Difference]: Finished difference Result 340 states and 732 transitions. [2022-03-15 19:44:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:44:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:44:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:48,040 INFO L225 Difference]: With dead ends: 340 [2022-03-15 19:44:48,040 INFO L226 Difference]: Without dead ends: 276 [2022-03-15 19:44:48,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=590, Invalid=2267, Unknown=5, NotChecked=0, Total=2862 [2022-03-15 19:44:48,041 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 134 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:48,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 8 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:44:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-03-15 19:44:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 152. [2022-03-15 19:44:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.4701986754966887) internal successors, (373), 151 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 373 transitions. [2022-03-15 19:44:48,051 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 373 transitions. Word has length 22 [2022-03-15 19:44:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:48,052 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 373 transitions. [2022-03-15 19:44:48,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 373 transitions. [2022-03-15 19:44:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:44:48,053 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:48,053 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:48,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:48,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:48,274 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -886498434, now seen corresponding path program 18 times [2022-03-15 19:44:48,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:48,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390274417] [2022-03-15 19:44:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:48,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:48,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390274417] [2022-03-15 19:44:48,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390274417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:48,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477899979] [2022-03-15 19:44:48,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:48,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:48,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:48,820 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:48,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:44:49,100 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:44:49,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:49,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:44:49,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:49,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:44:49,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:44:49,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:44:49,696 INFO L353 Elim1Store]: treesize reduction 166, result has 4.0 percent of original size [2022-03-15 19:44:49,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 24 [2022-03-15 19:44:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:49,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:53,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:53,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 172 [2022-03-15 19:44:53,934 INFO L353 Elim1Store]: treesize reduction 172, result has 31.5 percent of original size [2022-03-15 19:44:53,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1074 treesize of output 1004 [2022-03-15 19:44:54,024 INFO L353 Elim1Store]: treesize reduction 172, result has 31.5 percent of original size [2022-03-15 19:44:54,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 926 treesize of output 780 [2022-03-15 19:44:54,111 INFO L353 Elim1Store]: treesize reduction 172, result has 31.5 percent of original size [2022-03-15 19:44:54,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 702 treesize of output 668 [2022-03-15 19:44:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:58,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477899979] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:58,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:58,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-03-15 19:44:58,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006128678] [2022-03-15 19:44:58,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:58,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:58,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2022-03-15 19:44:58,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:59,252 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7498#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 7497#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0)) (<= (+ ~front~0 1) ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (<= ~n~0 ~back~0))), 7499#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:44:59,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:59,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=1345, Unknown=4, NotChecked=0, Total=1722 [2022-03-15 19:44:59,253 INFO L87 Difference]: Start difference. First operand 152 states and 373 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:01,256 INFO L93 Difference]: Finished difference Result 370 states and 793 transitions. [2022-03-15 19:45:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:45:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:45:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:01,258 INFO L225 Difference]: With dead ends: 370 [2022-03-15 19:45:01,258 INFO L226 Difference]: Without dead ends: 328 [2022-03-15 19:45:01,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=672, Invalid=2864, Unknown=4, NotChecked=0, Total=3540 [2022-03-15 19:45:01,259 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 132 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:01,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 8 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-15 19:45:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 144. [2022-03-15 19:45:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.3636363636363638) internal successors, (338), 143 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 338 transitions. [2022-03-15 19:45:01,270 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 338 transitions. Word has length 22 [2022-03-15 19:45:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:01,271 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 338 transitions. [2022-03-15 19:45:01,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 338 transitions. [2022-03-15 19:45:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:45:01,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:01,272 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:01,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:01,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:01,490 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 743738864, now seen corresponding path program 19 times [2022-03-15 19:45:01,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:01,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849816674] [2022-03-15 19:45:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:02,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:02,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849816674] [2022-03-15 19:45:02,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849816674] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:02,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171400395] [2022-03-15 19:45:02,201 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:02,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:02,202 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:45:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:02,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:45:02,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:02,785 INFO L353 Elim1Store]: treesize reduction 166, result has 4.0 percent of original size [2022-03-15 19:45:02,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 24 [2022-03-15 19:45:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:02,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:04,765 INFO L353 Elim1Store]: treesize reduction 171, result has 30.5 percent of original size [2022-03-15 19:45:04,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 288 treesize of output 248 [2022-03-15 19:45:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:05,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171400395] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:05,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:05,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:45:05,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [15158069] [2022-03-15 19:45:05,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:05,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:05,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 59 transitions. [2022-03-15 19:45:05,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:06,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8358#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) 12) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0)))), 8359#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) 12) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 (+ 2 ~front~0))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0))))] [2022-03-15 19:45:06,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:06,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:45:06,612 INFO L87 Difference]: Start difference. First operand 144 states and 338 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:07,415 INFO L93 Difference]: Finished difference Result 293 states and 667 transitions. [2022-03-15 19:45:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:45:07,415 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:45:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:07,416 INFO L225 Difference]: With dead ends: 293 [2022-03-15 19:45:07,416 INFO L226 Difference]: Without dead ends: 278 [2022-03-15 19:45:07,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=345, Invalid=1547, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:45:07,417 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:07,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 10 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-15 19:45:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 168. [2022-03-15 19:45:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.4550898203592815) internal successors, (410), 167 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 410 transitions. [2022-03-15 19:45:07,423 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 410 transitions. Word has length 22 [2022-03-15 19:45:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:07,423 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 410 transitions. [2022-03-15 19:45:07,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 410 transitions. [2022-03-15 19:45:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:45:07,424 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:07,424 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:07,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:07,643 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -926094520, now seen corresponding path program 20 times [2022-03-15 19:45:07,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:07,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446968197] [2022-03-15 19:45:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:08,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:08,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446968197] [2022-03-15 19:45:08,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446968197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:08,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509632482] [2022-03-15 19:45:08,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:08,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:08,191 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:08,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:45:08,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:08,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:08,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:45:08,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:08,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:08,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:08,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:08,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:08,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 21 [2022-03-15 19:45:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:08,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:09,301 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:45:09,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 286 treesize of output 250 [2022-03-15 19:45:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:10,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509632482] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:10,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:10,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-03-15 19:45:10,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305933346] [2022-03-15 19:45:10,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:10,351 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:10,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2022-03-15 19:45:10,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:11,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [9159#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0)))), 9160#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (* ~front~0 4) (* ~back~0 4))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:45:11,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:11,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:11,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:45:11,168 INFO L87 Difference]: Start difference. First operand 168 states and 410 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:12,015 INFO L93 Difference]: Finished difference Result 420 states and 984 transitions. [2022-03-15 19:45:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:45:12,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:45:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:12,017 INFO L225 Difference]: With dead ends: 420 [2022-03-15 19:45:12,017 INFO L226 Difference]: Without dead ends: 354 [2022-03-15 19:45:12,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:45:12,018 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:12,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 7 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-03-15 19:45:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2022-03-15 19:45:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.5736040609137056) internal successors, (507), 197 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 507 transitions. [2022-03-15 19:45:12,025 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 507 transitions. Word has length 22 [2022-03-15 19:45:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:12,025 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 507 transitions. [2022-03-15 19:45:12,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 507 transitions. [2022-03-15 19:45:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:45:12,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:12,026 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:12,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 19:45:12,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:45:12,239 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -127610638, now seen corresponding path program 21 times [2022-03-15 19:45:12,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:12,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605391264] [2022-03-15 19:45:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:12,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:12,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605391264] [2022-03-15 19:45:12,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605391264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:12,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053605050] [2022-03-15 19:45:12,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:12,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:12,859 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:12,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:45:13,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:45:13,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:13,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:45:13,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:13,238 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:45:13,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:45:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:45:13,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:13,545 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:45:13,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 186 [2022-03-15 19:45:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:45:14,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053605050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:14,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:14,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 22 [2022-03-15 19:45:14,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835600914] [2022-03-15 19:45:14,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:14,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:14,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2022-03-15 19:45:14,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:14,976 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10148#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 10149#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 10147#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:45:14,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:14,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:45:14,977 INFO L87 Difference]: Start difference. First operand 198 states and 507 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:15,330 INFO L93 Difference]: Finished difference Result 291 states and 736 transitions. [2022-03-15 19:45:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:45:15,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:45:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:15,332 INFO L225 Difference]: With dead ends: 291 [2022-03-15 19:45:15,332 INFO L226 Difference]: Without dead ends: 276 [2022-03-15 19:45:15,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:45:15,333 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:15,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:45:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-03-15 19:45:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 202. [2022-03-15 19:45:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.5621890547263684) internal successors, (515), 201 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 515 transitions. [2022-03-15 19:45:15,340 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 515 transitions. Word has length 22 [2022-03-15 19:45:15,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:15,340 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 515 transitions. [2022-03-15 19:45:15,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 515 transitions. [2022-03-15 19:45:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:45:15,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:15,341 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:15,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:15,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:45:15,559 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 873453436, now seen corresponding path program 22 times [2022-03-15 19:45:15,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:15,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046522474] [2022-03-15 19:45:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:16,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:16,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046522474] [2022-03-15 19:45:16,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046522474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:16,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498702476] [2022-03-15 19:45:16,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:16,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:16,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:16,124 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:16,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:45:16,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:16,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:16,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:45:16,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:16,483 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:45:16,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:45:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:16,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:16,830 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:45:16,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 186 [2022-03-15 19:45:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:45:17,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498702476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:17,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:17,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 5] total 27 [2022-03-15 19:45:17,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284850432] [2022-03-15 19:45:17,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:17,315 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:17,323 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 50 transitions. [2022-03-15 19:45:17,323 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:17,899 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11015#(and (or (< ~back~0 0) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (* ~front~0 4) (* ~back~0 4))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 11014#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0))))] [2022-03-15 19:45:17,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:17,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:45:17,900 INFO L87 Difference]: Start difference. First operand 202 states and 515 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:18,317 INFO L93 Difference]: Finished difference Result 289 states and 724 transitions. [2022-03-15 19:45:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:45:18,317 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:45:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:18,318 INFO L225 Difference]: With dead ends: 289 [2022-03-15 19:45:18,318 INFO L226 Difference]: Without dead ends: 276 [2022-03-15 19:45:18,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:45:18,319 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 55 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:18,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 8 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:45:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-03-15 19:45:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 203. [2022-03-15 19:45:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.5594059405940595) internal successors, (517), 202 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 517 transitions. [2022-03-15 19:45:18,325 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 517 transitions. Word has length 22 [2022-03-15 19:45:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:18,325 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 517 transitions. [2022-03-15 19:45:18,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 517 transitions. [2022-03-15 19:45:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:18,326 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:18,326 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:18,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:18,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:18,548 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2017142140, now seen corresponding path program 23 times [2022-03-15 19:45:18,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:18,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824814] [2022-03-15 19:45:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:45:18,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:18,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824814] [2022-03-15 19:45:18,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:18,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129863714] [2022-03-15 19:45:18,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:18,664 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:45:18,782 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:45:18,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:18,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:45:18,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:45:18,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:45:19,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129863714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:19,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:19,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:45:19,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648376101] [2022-03-15 19:45:19,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:19,243 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:19,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 72 transitions. [2022-03-15 19:45:19,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:19,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:45:19,503 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:45:19,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:45:19,610 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:45:19,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:45:19,708 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:45:19,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [11859#(or (< ~back~0 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0))), 11889#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0))), 11888#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ 3 ~front~0)))] [2022-03-15 19:45:19,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:45:19,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:45:19,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:45:19,765 INFO L87 Difference]: Start difference. First operand 203 states and 517 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:19,883 INFO L93 Difference]: Finished difference Result 271 states and 628 transitions. [2022-03-15 19:45:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:45:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:19,884 INFO L225 Difference]: With dead ends: 271 [2022-03-15 19:45:19,884 INFO L226 Difference]: Without dead ends: 241 [2022-03-15 19:45:19,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:45:19,885 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:19,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 8 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:45:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-03-15 19:45:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 153. [2022-03-15 19:45:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.2565789473684212) internal successors, (343), 152 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 343 transitions. [2022-03-15 19:45:19,891 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 343 transitions. Word has length 23 [2022-03-15 19:45:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:19,891 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 343 transitions. [2022-03-15 19:45:19,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 343 transitions. [2022-03-15 19:45:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:19,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:19,892 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:19,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 19:45:20,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:20,114 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428304, now seen corresponding path program 24 times [2022-03-15 19:45:20,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:20,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778174617] [2022-03-15 19:45:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:20,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:20,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778174617] [2022-03-15 19:45:20,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778174617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:20,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761976105] [2022-03-15 19:45:20,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:45:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:20,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:20,900 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:20,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:45:21,149 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:45:21,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:21,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:45:21,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:21,460 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:45:21,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 22 [2022-03-15 19:45:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:21,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:21,954 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:45:21,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:45:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:45:22,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761976105] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:22,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:22,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 31 [2022-03-15 19:45:22,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416859006] [2022-03-15 19:45:22,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:22,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:22,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 65 transitions. [2022-03-15 19:45:22,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:25,073 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [12636#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0)))), 12637#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~front~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 12639#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 12638#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))))] [2022-03-15 19:45:25,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:25,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:45:25,075 INFO L87 Difference]: Start difference. First operand 153 states and 343 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:25,631 INFO L93 Difference]: Finished difference Result 211 states and 466 transitions. [2022-03-15 19:45:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:45:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:25,632 INFO L225 Difference]: With dead ends: 211 [2022-03-15 19:45:25,632 INFO L226 Difference]: Without dead ends: 202 [2022-03-15 19:45:25,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:45:25,633 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:25,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-03-15 19:45:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 168. [2022-03-15 19:45:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.2275449101796405) internal successors, (372), 167 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 372 transitions. [2022-03-15 19:45:25,637 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 372 transitions. Word has length 23 [2022-03-15 19:45:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:25,637 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 372 transitions. [2022-03-15 19:45:25,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 372 transitions. [2022-03-15 19:45:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:25,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:25,638 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:25,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 19:45:25,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:45:25,861 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash -886213082, now seen corresponding path program 25 times [2022-03-15 19:45:25,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:25,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545956164] [2022-03-15 19:45:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:28,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:28,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545956164] [2022-03-15 19:45:28,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545956164] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:28,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724440628] [2022-03-15 19:45:28,811 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:28,812 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:28,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:45:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:28,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:45:29,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:29,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:29,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:29,561 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:29,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 21 [2022-03-15 19:45:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:29,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:30,258 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:45:30,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 286 treesize of output 250 [2022-03-15 19:45:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:31,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724440628] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:31,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:31,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 39 [2022-03-15 19:45:31,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771071876] [2022-03-15 19:45:31,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:31,470 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:31,479 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 60 transitions. [2022-03-15 19:45:31,479 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:35,081 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [13373#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= ~front~0 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (select (select |#memory_int| ~queue~0.base) 12) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 (+ ~front~0 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8))) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 13374#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8))) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (select (select |#memory_int| ~queue~0.base) 12) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 13372#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 12)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8))) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8))) (<= ~front~0 0) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0)) (<= (select (select |#memory_int| ~queue~0.base) 12) 1)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 12) (select (select |#memory_int| ~queue~0.base) 8))) (<= ~front~0 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= ~front~0 0)) (not (<= 0 ~back~0))))] [2022-03-15 19:45:35,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:35,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1511, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:45:35,082 INFO L87 Difference]: Start difference. First operand 168 states and 372 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:36,167 INFO L93 Difference]: Finished difference Result 241 states and 549 transitions. [2022-03-15 19:45:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:45:36,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:36,168 INFO L225 Difference]: With dead ends: 241 [2022-03-15 19:45:36,168 INFO L226 Difference]: Without dead ends: 226 [2022-03-15 19:45:36,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=496, Invalid=2156, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:45:36,169 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:36,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 12 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-15 19:45:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2022-03-15 19:45:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.2275449101796405) internal successors, (372), 167 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 372 transitions. [2022-03-15 19:45:36,175 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 372 transitions. Word has length 23 [2022-03-15 19:45:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:36,175 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 372 transitions. [2022-03-15 19:45:36,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 372 transitions. [2022-03-15 19:45:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:36,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:36,176 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:36,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:36,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:45:36,399 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1738920830, now seen corresponding path program 26 times [2022-03-15 19:45:36,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:36,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584174957] [2022-03-15 19:45:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:37,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:37,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584174957] [2022-03-15 19:45:37,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584174957] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:37,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913027580] [2022-03-15 19:45:37,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:37,490 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:37,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:45:37,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:37,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:37,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:45:37,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:37,919 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:45:37,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:45:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:37,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:38,474 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:45:38,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:45:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:45:39,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913027580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:39,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:39,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 32 [2022-03-15 19:45:39,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171123338] [2022-03-15 19:45:39,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:39,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:39,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2022-03-15 19:45:39,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:41,079 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [14136#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8))))), 14135#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 14134#(and (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) 1) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (<= 0 ~back~0)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)))] [2022-03-15 19:45:41,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:41,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:45:41,080 INFO L87 Difference]: Start difference. First operand 168 states and 372 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:41,759 INFO L93 Difference]: Finished difference Result 235 states and 534 transitions. [2022-03-15 19:45:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:45:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:41,760 INFO L225 Difference]: With dead ends: 235 [2022-03-15 19:45:41,760 INFO L226 Difference]: Without dead ends: 222 [2022-03-15 19:45:41,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:45:41,761 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:41,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-03-15 19:45:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 168. [2022-03-15 19:45:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.2275449101796405) internal successors, (372), 167 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 372 transitions. [2022-03-15 19:45:41,766 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 372 transitions. Word has length 23 [2022-03-15 19:45:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:41,766 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 372 transitions. [2022-03-15 19:45:41,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 372 transitions. [2022-03-15 19:45:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:41,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:41,767 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:41,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-15 19:45:41,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:45:41,987 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -925809168, now seen corresponding path program 27 times [2022-03-15 19:45:41,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:41,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883139430] [2022-03-15 19:45:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:42,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:42,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883139430] [2022-03-15 19:45:42,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883139430] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:42,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445661627] [2022-03-15 19:45:42,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:42,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:42,623 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:42,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:45:42,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:45:42,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:45:42,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:42,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:45:42,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:45:43,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:45:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:43,357 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:43,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 18 [2022-03-15 19:45:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:43,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:44,491 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:44,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 176 [2022-03-15 19:45:44,549 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:45:44,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 528 treesize of output 528 [2022-03-15 19:45:44,604 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:45:44,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 450 treesize of output 408 [2022-03-15 19:45:44,663 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:45:44,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 330 treesize of output 348 [2022-03-15 19:45:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:48,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445661627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:48,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:48,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2022-03-15 19:45:48,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446288245] [2022-03-15 19:45:48,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:48,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:48,536 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 60 transitions. [2022-03-15 19:45:48,536 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:49,533 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14897#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0))), 14896#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:45:49,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:49,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1468, Unknown=5, NotChecked=0, Total=1892 [2022-03-15 19:45:49,534 INFO L87 Difference]: Start difference. First operand 168 states and 372 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:50,036 INFO L93 Difference]: Finished difference Result 225 states and 517 transitions. [2022-03-15 19:45:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:45:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:50,038 INFO L225 Difference]: With dead ends: 225 [2022-03-15 19:45:50,038 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 19:45:50,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=535, Invalid=2010, Unknown=5, NotChecked=0, Total=2550 [2022-03-15 19:45:50,039 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:50,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 11 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:45:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 19:45:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2022-03-15 19:45:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.2275449101796405) internal successors, (372), 167 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 372 transitions. [2022-03-15 19:45:50,043 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 372 transitions. Word has length 23 [2022-03-15 19:45:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:50,044 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 372 transitions. [2022-03-15 19:45:50,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 372 transitions. [2022-03-15 19:45:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:50,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:50,044 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:50,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:50,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:50,259 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1699324744, now seen corresponding path program 28 times [2022-03-15 19:45:50,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:50,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994201417] [2022-03-15 19:45:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:51,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:51,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994201417] [2022-03-15 19:45:51,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994201417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:51,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335200713] [2022-03-15 19:45:51,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:51,767 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:51,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:45:51,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:51,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:51,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:45:51,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:52,185 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:45:52,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:45:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:52,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:52,704 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:45:52,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:45:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:45:53,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335200713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:53,390 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:53,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 8] total 32 [2022-03-15 19:45:53,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173939659] [2022-03-15 19:45:53,390 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:53,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:53,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2022-03-15 19:45:53,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:54,467 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [15640#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= (* (div (+ (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4) (- 5)) 4) 4) (+ (* ~front~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (+ ~queue~0.offset (* ~back~0 4) 4) (* (div (+ (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4) (- 5)) 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8)))), 15639#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* (div (+ (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4) (- 5)) 4) 4) (+ (* ~front~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ ~queue~0.offset (* ~back~0 4) 4) (* (div (+ (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4) (- 5)) 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* (div (+ (- 1) (* ~back~0 (- 4)) (* ~n~0 4) (* ~front~0 4)) 4) 4) (+ (* ~front~0 4) 8))))] [2022-03-15 19:45:54,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:45:54,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:45:54,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:45:54,469 INFO L87 Difference]: Start difference. First operand 168 states and 372 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:55,525 INFO L93 Difference]: Finished difference Result 352 states and 799 transitions. [2022-03-15 19:45:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:45:55,525 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:55,526 INFO L225 Difference]: With dead ends: 352 [2022-03-15 19:45:55,527 INFO L226 Difference]: Without dead ends: 330 [2022-03-15 19:45:55,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=1707, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:45:55,528 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:55,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 8 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-03-15 19:45:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 188. [2022-03-15 19:45:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.3957219251336896) internal successors, (448), 187 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 448 transitions. [2022-03-15 19:45:55,533 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 448 transitions. Word has length 23 [2022-03-15 19:45:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:55,533 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 448 transitions. [2022-03-15 19:45:55,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 448 transitions. [2022-03-15 19:45:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:45:55,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:55,534 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:55,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:45:55,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:55,751 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -796094596, now seen corresponding path program 29 times [2022-03-15 19:45:55,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:55,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685297018] [2022-03-15 19:45:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:56,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:56,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685297018] [2022-03-15 19:45:56,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685297018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:56,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098133138] [2022-03-15 19:45:56,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:56,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:56,990 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:56,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:45:57,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:45:57,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:57,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:45:57,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:57,389 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:57,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:45:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:57,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:57,650 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:45:57,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 190 [2022-03-15 19:45:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:45:57,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098133138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:57,963 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:57,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 5] total 28 [2022-03-15 19:45:57,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682232729] [2022-03-15 19:45:57,964 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:57,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:57,973 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 51 transitions. [2022-03-15 19:45:57,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:58,899 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [16549#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ ~queue~0.offset (* ~back~0 4)) 3) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= 13 (+ (* ~front~0 4) ~queue~0.offset)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 16550#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= 13 (+ (* ~front~0 4) ~queue~0.offset)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ ~queue~0.offset (* ~back~0 4)) 3) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:45:58,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:58,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:45:58,900 INFO L87 Difference]: Start difference. First operand 188 states and 448 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:59,819 INFO L93 Difference]: Finished difference Result 297 states and 706 transitions. [2022-03-15 19:45:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:45:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:45:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:59,821 INFO L225 Difference]: With dead ends: 297 [2022-03-15 19:45:59,821 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 19:45:59,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:45:59,822 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 73 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:59,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 16 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:45:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 19:45:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 189. [2022-03-15 19:45:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.393617021276596) internal successors, (450), 188 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 450 transitions. [2022-03-15 19:45:59,826 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 450 transitions. Word has length 23 [2022-03-15 19:45:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:59,827 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 450 transitions. [2022-03-15 19:45:59,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 450 transitions. [2022-03-15 19:45:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:45:59,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:59,827 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:59,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 19:46:00,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:00,045 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1995399740, now seen corresponding path program 30 times [2022-03-15 19:46:00,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:00,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692552520] [2022-03-15 19:46:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:46:00,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:00,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692552520] [2022-03-15 19:46:00,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692552520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:00,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390989189] [2022-03-15 19:46:00,123 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:00,124 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:00,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:46:00,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:46:00,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:00,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:46:00,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:46:00,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:46:00,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390989189] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:00,516 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:00,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:46:00,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662963211] [2022-03-15 19:46:00,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:00,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:00,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2022-03-15 19:46:00,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:00,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:46:00,668 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:00,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:46:00,757 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:00,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:46:00,845 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:00,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [17414#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3))), 17412#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1))), 17413#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2)))] [2022-03-15 19:46:00,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:46:00,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:46:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:46:00,874 INFO L87 Difference]: Start difference. First operand 189 states and 450 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:00,967 INFO L93 Difference]: Finished difference Result 161 states and 352 transitions. [2022-03-15 19:46:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:46:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:46:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:00,967 INFO L225 Difference]: With dead ends: 161 [2022-03-15 19:46:00,968 INFO L226 Difference]: Without dead ends: 124 [2022-03-15 19:46:00,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:46:00,968 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:00,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 9 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:46:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-15 19:46:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-03-15 19:46:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.4146341463414633) internal successors, (297), 123 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 297 transitions. [2022-03-15 19:46:00,971 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 297 transitions. Word has length 24 [2022-03-15 19:46:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:00,972 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 297 transitions. [2022-03-15 19:46:00,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 297 transitions. [2022-03-15 19:46:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:00,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:00,972 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:00,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 19:46:01,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 19:46:01,193 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1800760700, now seen corresponding path program 31 times [2022-03-15 19:46:01,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:01,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76798849] [2022-03-15 19:46:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:01,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:01,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76798849] [2022-03-15 19:46:01,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76798849] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:01,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695961645] [2022-03-15 19:46:01,269 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:01,272 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:46:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:01,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:46:01,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:01,491 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:46:01,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 12 [2022-03-15 19:46:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:01,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:01,793 INFO L353 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-03-15 19:46:01,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 155 [2022-03-15 19:46:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:01,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695961645] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:01,887 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:01,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2022-03-15 19:46:01,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636657827] [2022-03-15 19:46:01,887 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:01,889 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:01,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 73 transitions. [2022-03-15 19:46:01,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:01,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:46:01,979 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:02,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:46:02,085 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:02,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:46:02,195 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:02,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [17988#(or (< ~back~0 0) (<= ~back~0 (+ 2 ~front~0)) (<= ~n~0 ~back~0)), 17989#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~back~0 (+ ~front~0 1))), 17990#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2)) (<= ~back~0 ~front~0))] [2022-03-15 19:46:02,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:46:02,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:46:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:46:02,421 INFO L87 Difference]: Start difference. First operand 124 states and 297 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:02,488 INFO L93 Difference]: Finished difference Result 236 states and 556 transitions. [2022-03-15 19:46:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:46:02,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 24 [2022-03-15 19:46:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:02,490 INFO L225 Difference]: With dead ends: 236 [2022-03-15 19:46:02,490 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 19:46:02,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:46:02,490 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:02,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 1 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:46:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 19:46:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2022-03-15 19:46:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.496774193548387) internal successors, (387), 155 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 387 transitions. [2022-03-15 19:46:02,496 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 387 transitions. Word has length 24 [2022-03-15 19:46:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:02,496 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 387 transitions. [2022-03-15 19:46:02,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 387 transitions. [2022-03-15 19:46:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:02,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:02,497 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:02,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:02,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:02,707 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2070809744, now seen corresponding path program 32 times [2022-03-15 19:46:02,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:02,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559685172] [2022-03-15 19:46:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:04,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:04,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559685172] [2022-03-15 19:46:04,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559685172] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:04,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384907943] [2022-03-15 19:46:04,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:04,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:04,636 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:04,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:46:04,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:04,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:46:04,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:05,104 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:46:05,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-03-15 19:46:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:05,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:05,675 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:46:05,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:46:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:06,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384907943] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:06,440 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:06,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 33 [2022-03-15 19:46:06,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752453977] [2022-03-15 19:46:06,440 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:06,443 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:06,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 66 transitions. [2022-03-15 19:46:06,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:09,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [18714#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~back~0 4) 8) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 18715#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~back~0 4) 8) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 18713#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~front~0 0) (<= (* ~back~0 4) 12)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 18712#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~back~0 4) 16) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< (* ~back~0 4) (+ (* ~front~0 4) 12)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))))] [2022-03-15 19:46:09,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:46:09,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:09,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:46:09,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1220, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:46:09,460 INFO L87 Difference]: Start difference. First operand 156 states and 387 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:10,110 INFO L93 Difference]: Finished difference Result 298 states and 738 transitions. [2022-03-15 19:46:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:46:10,110 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 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 24 [2022-03-15 19:46:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:10,111 INFO L225 Difference]: With dead ends: 298 [2022-03-15 19:46:10,112 INFO L226 Difference]: Without dead ends: 281 [2022-03-15 19:46:10,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=343, Invalid=1637, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:46:10,112 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:10,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 10 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:46:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-03-15 19:46:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2022-03-15 19:46:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4464285714285716) internal successors, (411), 168 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 411 transitions. [2022-03-15 19:46:10,116 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 411 transitions. Word has length 24 [2022-03-15 19:46:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:10,116 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 411 transitions. [2022-03-15 19:46:10,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 411 transitions. [2022-03-15 19:46:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:10,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:10,117 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:10,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:10,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:10,341 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1102594522, now seen corresponding path program 33 times [2022-03-15 19:46:10,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:10,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211177745] [2022-03-15 19:46:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:16,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:16,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211177745] [2022-03-15 19:46:16,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211177745] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:16,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298476910] [2022-03-15 19:46:16,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:16,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:16,678 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:46:16,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:46:16,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:16,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:46:16,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:17,113 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:46:17,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:46:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:17,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:17,610 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:46:17,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:46:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:18,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298476910] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:18,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:18,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 29 [2022-03-15 19:46:18,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020809019] [2022-03-15 19:46:18,251 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:18,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:18,264 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2022-03-15 19:46:18,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:19,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [19534#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4) 12) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8 (* (div (+ 7 (* ~front~0 4) ~queue~0.offset) 4) 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 19535#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4) 12) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8 (* (div (+ 7 (* ~front~0 4) ~queue~0.offset) 4) 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 19533#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4) 12) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 4 (* (div (+ 7 (* ~front~0 4) ~queue~0.offset) 4) 4)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0)))] [2022-03-15 19:46:19,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:46:19,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:46:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:46:19,719 INFO L87 Difference]: Start difference. First operand 169 states and 411 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:20,406 INFO L93 Difference]: Finished difference Result 306 states and 756 transitions. [2022-03-15 19:46:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:46:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 24 [2022-03-15 19:46:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:20,408 INFO L225 Difference]: With dead ends: 306 [2022-03-15 19:46:20,408 INFO L226 Difference]: Without dead ends: 291 [2022-03-15 19:46:20,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:46:20,408 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:20,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 10 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:46:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-03-15 19:46:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 169. [2022-03-15 19:46:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4464285714285716) internal successors, (411), 168 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 411 transitions. [2022-03-15 19:46:20,427 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 411 transitions. Word has length 24 [2022-03-15 19:46:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:20,428 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 411 transitions. [2022-03-15 19:46:20,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 411 transitions. [2022-03-15 19:46:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:20,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:20,428 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:20,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:20,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:46:20,648 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1522539390, now seen corresponding path program 34 times [2022-03-15 19:46:20,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:20,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998560480] [2022-03-15 19:46:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:22,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:22,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998560480] [2022-03-15 19:46:22,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998560480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:22,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256943860] [2022-03-15 19:46:22,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:46:22,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:22,048 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:22,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:46:22,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:46:22,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:22,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:46:22,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:22,552 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:46:22,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:46:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:22,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:23,153 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:46:23,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:46:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:23,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256943860] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:23,661 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:23,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 33 [2022-03-15 19:46:23,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415062905] [2022-03-15 19:46:23,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:23,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:23,672 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2022-03-15 19:46:23,672 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:25,436 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [20367#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 (* ~front~0 4)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (= 12 (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 20368#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 20369#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:46:25,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:46:25,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:46:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:46:25,438 INFO L87 Difference]: Start difference. First operand 169 states and 411 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:26,139 INFO L93 Difference]: Finished difference Result 272 states and 671 transitions. [2022-03-15 19:46:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:46:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:46:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:26,141 INFO L225 Difference]: With dead ends: 272 [2022-03-15 19:46:26,141 INFO L226 Difference]: Without dead ends: 259 [2022-03-15 19:46:26,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=246, Invalid=1476, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:46:26,141 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:26,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:46:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-15 19:46:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2022-03-15 19:46:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.4464285714285716) internal successors, (411), 168 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 411 transitions. [2022-03-15 19:46:26,145 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 411 transitions. Word has length 24 [2022-03-15 19:46:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:26,146 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 411 transitions. [2022-03-15 19:46:26,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 411 transitions. [2022-03-15 19:46:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:26,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:26,146 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:26,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:26,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:46:26,351 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1142190608, now seen corresponding path program 35 times [2022-03-15 19:46:26,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:26,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878678007] [2022-03-15 19:46:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:26,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:27,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:27,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878678007] [2022-03-15 19:46:27,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878678007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:27,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702261526] [2022-03-15 19:46:27,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:27,745 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:27,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:46:27,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:46:27,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:27,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:46:27,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:28,208 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:46:28,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:46:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:28,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:28,727 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:46:28,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 234 [2022-03-15 19:46:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:29,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702261526] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:29,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:29,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 33 [2022-03-15 19:46:29,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229701369] [2022-03-15 19:46:29,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:29,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:29,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2022-03-15 19:46:29,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:30,327 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [21161#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 21162#(and (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:46:30,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:46:30,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:46:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:30,328 INFO L87 Difference]: Start difference. First operand 169 states and 411 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:31,332 INFO L93 Difference]: Finished difference Result 406 states and 985 transitions. [2022-03-15 19:46:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:46:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:46:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:31,334 INFO L225 Difference]: With dead ends: 406 [2022-03-15 19:46:31,334 INFO L226 Difference]: Without dead ends: 367 [2022-03-15 19:46:31,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:46:31,334 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 72 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:31,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 8 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:46:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-03-15 19:46:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 201. [2022-03-15 19:46:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.49) internal successors, (498), 200 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 498 transitions. [2022-03-15 19:46:31,339 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 498 transitions. Word has length 24 [2022-03-15 19:46:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:31,339 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 498 transitions. [2022-03-15 19:46:31,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 498 transitions. [2022-03-15 19:46:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:31,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:31,339 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:31,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 19:46:31,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:46:31,540 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:31,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1482943304, now seen corresponding path program 36 times [2022-03-15 19:46:31,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:31,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006527547] [2022-03-15 19:46:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:32,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:32,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006527547] [2022-03-15 19:46:32,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006527547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:32,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020174632] [2022-03-15 19:46:32,821 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:32,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:32,822 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:32,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:46:32,998 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:46:32,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:33,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:46:33,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:33,336 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:46:33,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:46:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:33,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:33,874 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:46:33,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:46:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:34,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020174632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:34,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:34,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 8] total 33 [2022-03-15 19:46:34,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [796024495] [2022-03-15 19:46:34,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:34,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:34,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 56 transitions. [2022-03-15 19:46:34,605 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:35,365 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [22161#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0)))), 22160#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:46:35,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:46:35,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:35,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:46:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:35,366 INFO L87 Difference]: Start difference. First operand 201 states and 498 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:36,315 INFO L93 Difference]: Finished difference Result 361 states and 859 transitions. [2022-03-15 19:46:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:46:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:46:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:36,317 INFO L225 Difference]: With dead ends: 361 [2022-03-15 19:46:36,317 INFO L226 Difference]: Without dead ends: 301 [2022-03-15 19:46:36,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:46:36,317 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:36,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 10 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:46:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-15 19:46:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 183. [2022-03-15 19:46:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.4395604395604398) internal successors, (444), 182 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 444 transitions. [2022-03-15 19:46:36,320 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 444 transitions. Word has length 24 [2022-03-15 19:46:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:36,321 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 444 transitions. [2022-03-15 19:46:36,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 444 transitions. [2022-03-15 19:46:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:46:36,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:36,321 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:36,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:36,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:46:36,522 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1012476036, now seen corresponding path program 37 times [2022-03-15 19:46:36,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:36,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988247953] [2022-03-15 19:46:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:37,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:37,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988247953] [2022-03-15 19:46:37,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988247953] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:37,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629255117] [2022-03-15 19:46:37,404 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:37,405 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:37,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:46:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:37,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:46:37,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:37,800 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:46:37,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:46:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:46:37,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:38,192 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:46:38,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 186 [2022-03-15 19:46:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:46:38,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629255117] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:38,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:38,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 5] total 29 [2022-03-15 19:46:38,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555853753] [2022-03-15 19:46:38,671 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:38,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:38,680 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2022-03-15 19:46:38,680 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:39,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [23081#(and (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 4 ~front~0) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~front~0 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 28))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (<= ~front~0 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 24) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 23080#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 24) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 28))) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 4 ~front~0) (not (<= 0 ~back~0))))] [2022-03-15 19:46:39,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:46:39,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:39,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:46:39,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:46:39,337 INFO L87 Difference]: Start difference. First operand 183 states and 444 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:39,919 INFO L93 Difference]: Finished difference Result 312 states and 760 transitions. [2022-03-15 19:46:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:46:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 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 24 [2022-03-15 19:46:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:39,920 INFO L225 Difference]: With dead ends: 312 [2022-03-15 19:46:39,920 INFO L226 Difference]: Without dead ends: 299 [2022-03-15 19:46:39,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=344, Invalid=1378, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:46:39,921 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 110 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:39,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 15 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-03-15 19:46:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 184. [2022-03-15 19:46:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.4371584699453552) internal successors, (446), 183 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 446 transitions. [2022-03-15 19:46:39,925 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 446 transitions. Word has length 24 [2022-03-15 19:46:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:39,925 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 446 transitions. [2022-03-15 19:46:39,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 446 transitions. [2022-03-15 19:46:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:46:39,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:39,926 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:39,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:40,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:46:40,147 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1527702322, now seen corresponding path program 38 times [2022-03-15 19:46:40,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:40,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237256326] [2022-03-15 19:46:40,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:40,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:40,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237256326] [2022-03-15 19:46:40,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237256326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:40,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232510360] [2022-03-15 19:46:40,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:40,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:40,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:40,858 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:40,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:46:40,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:40,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:40,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:46:41,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:41,576 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:46:41,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:46:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:41,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:42,347 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:46:42,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 342 treesize of output 404 [2022-03-15 19:46:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:44,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232510360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:44,140 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:44,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 44 [2022-03-15 19:46:44,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303158877] [2022-03-15 19:46:44,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:44,144 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:44,159 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 76 transitions. [2022-03-15 19:46:44,159 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:47,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [23973#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 23974#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 23970#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 23971#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 23972#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))))] [2022-03-15 19:46:47,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:46:47,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:47,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:46:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2162, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:46:47,497 INFO L87 Difference]: Start difference. First operand 184 states and 446 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:52,717 INFO L93 Difference]: Finished difference Result 777 states and 1795 transitions. [2022-03-15 19:46:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 19:46:52,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:46:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:52,719 INFO L225 Difference]: With dead ends: 777 [2022-03-15 19:46:52,719 INFO L226 Difference]: Without dead ends: 530 [2022-03-15 19:46:52,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=995, Invalid=5977, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:46:52,720 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 209 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:52,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 9 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:46:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-03-15 19:46:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 252. [2022-03-15 19:46:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.645418326693227) internal successors, (664), 251 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 664 transitions. [2022-03-15 19:46:52,726 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 664 transitions. Word has length 25 [2022-03-15 19:46:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:52,727 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 664 transitions. [2022-03-15 19:46:52,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 664 transitions. [2022-03-15 19:46:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:46:52,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:52,728 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:52,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:52,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 19:46:52,935 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1477603132, now seen corresponding path program 39 times [2022-03-15 19:46:52,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:52,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944385984] [2022-03-15 19:46:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:53,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:53,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944385984] [2022-03-15 19:46:53,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944385984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:53,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805969978] [2022-03-15 19:46:53,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:53,741 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:53,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:46:54,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:46:54,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:54,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:46:54,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:54,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:46:54,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:46:54,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:46:54,764 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:46:54,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 27 [2022-03-15 19:46:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:54,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:56,179 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:56,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 359 treesize of output 227 [2022-03-15 19:46:56,292 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:46:56,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 674 treesize of output 701 [2022-03-15 19:46:56,411 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:46:56,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 569 treesize of output 539 [2022-03-15 19:46:56,525 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:46:56,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 407 treesize of output 458 [2022-03-15 19:47:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:11,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805969978] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:11,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:11,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:47:11,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804273531] [2022-03-15 19:47:11,686 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:11,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:11,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2022-03-15 19:47:11,700 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:13,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [25518#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 25515#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ ~queue~0.offset (* ~back~0 4) 4) (+ (* ~front~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0)))), 25517#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (not (= ~front~0 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)))), 25516#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 3)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= ~front~0 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 3)) (= ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= ~front~0 0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= ~front~0 0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 (+ ~front~0 1))))] [2022-03-15 19:47:13,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:47:13,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:47:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=2225, Unknown=6, NotChecked=0, Total=2756 [2022-03-15 19:47:13,920 INFO L87 Difference]: Start difference. First operand 252 states and 664 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:14,743 INFO L93 Difference]: Finished difference Result 417 states and 1127 transitions. [2022-03-15 19:47:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:47:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:47:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:14,745 INFO L225 Difference]: With dead ends: 417 [2022-03-15 19:47:14,745 INFO L226 Difference]: Without dead ends: 400 [2022-03-15 19:47:14,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=702, Invalid=3198, Unknown=6, NotChecked=0, Total=3906 [2022-03-15 19:47:14,746 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:14,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 9 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:47:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-03-15 19:47:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 254. [2022-03-15 19:47:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.6363636363636362) internal successors, (667), 253 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 667 transitions. [2022-03-15 19:47:14,752 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 667 transitions. Word has length 25 [2022-03-15 19:47:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:14,752 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 667 transitions. [2022-03-15 19:47:14,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 667 transitions. [2022-03-15 19:47:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:47:14,753 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:14,753 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:14,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:14,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:47:14,980 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1252375780, now seen corresponding path program 40 times [2022-03-15 19:47:14,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:14,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799884840] [2022-03-15 19:47:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:15,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:15,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799884840] [2022-03-15 19:47:15,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799884840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:15,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412562993] [2022-03-15 19:47:15,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:15,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:15,963 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:15,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:47:16,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:16,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:16,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:47:16,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:16,573 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:47:16,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:47:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:16,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:17,385 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:47:17,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:47:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:18,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412562993] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:18,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:18,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 9] total 37 [2022-03-15 19:47:18,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213524032] [2022-03-15 19:47:18,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:18,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:18,918 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 66 transitions. [2022-03-15 19:47:18,918 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:21,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [26650#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 26648#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 26649#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 ~back~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 26647#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:47:21,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:47:21,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:47:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:47:21,184 INFO L87 Difference]: Start difference. First operand 254 states and 667 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:24,820 INFO L93 Difference]: Finished difference Result 1044 states and 2459 transitions. [2022-03-15 19:47:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:47:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 25 [2022-03-15 19:47:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:24,823 INFO L225 Difference]: With dead ends: 1044 [2022-03-15 19:47:24,824 INFO L226 Difference]: Without dead ends: 988 [2022-03-15 19:47:24,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=465, Invalid=3825, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:47:24,825 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 181 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:24,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 9 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:47:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-03-15 19:47:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 470. [2022-03-15 19:47:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.878464818763326) internal successors, (1350), 469 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1350 transitions. [2022-03-15 19:47:24,836 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1350 transitions. Word has length 25 [2022-03-15 19:47:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:24,836 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1350 transitions. [2022-03-15 19:47:24,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1350 transitions. [2022-03-15 19:47:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:47:24,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:24,838 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:24,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:25,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:47:25,051 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -417457604, now seen corresponding path program 41 times [2022-03-15 19:47:25,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:25,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409596753] [2022-03-15 19:47:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:25,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:25,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409596753] [2022-03-15 19:47:25,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409596753] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:25,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502477590] [2022-03-15 19:47:25,933 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:47:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:25,934 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:47:26,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:47:26,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:26,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:47:26,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:26,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:26,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:26,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:26,841 INFO L353 Elim1Store]: treesize reduction 485, result has 2.6 percent of original size [2022-03-15 19:47:26,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 39 [2022-03-15 19:47:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:26,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:29,671 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:29,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 361 treesize of output 229 [2022-03-15 19:47:29,807 INFO L353 Elim1Store]: treesize reduction 350, result has 28.7 percent of original size [2022-03-15 19:47:29,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1420 treesize of output 1350 [2022-03-15 19:47:29,956 INFO L353 Elim1Store]: treesize reduction 350, result has 28.7 percent of original size [2022-03-15 19:47:29,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1210 treesize of output 1026 [2022-03-15 19:47:30,095 INFO L353 Elim1Store]: treesize reduction 350, result has 28.7 percent of original size [2022-03-15 19:47:30,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 886 treesize of output 864 [2022-03-15 19:47:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:46,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502477590] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:46,130 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:46,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:47:46,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031033157] [2022-03-15 19:47:46,131 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:46,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:46,178 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 19:47:46,178 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:48,449 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [28877#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 28875#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~front~0 1) ~back~0))), 28874#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) (+ (* (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 2) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 2) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4))) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 28876#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 ~back~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:47:48,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:47:48,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:47:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2396, Unknown=7, NotChecked=0, Total=2756 [2022-03-15 19:47:48,450 INFO L87 Difference]: Start difference. First operand 470 states and 1350 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:52,165 INFO L93 Difference]: Finished difference Result 1035 states and 2457 transitions. [2022-03-15 19:47:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:47:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 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 25 [2022-03-15 19:47:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:52,168 INFO L225 Difference]: With dead ends: 1035 [2022-03-15 19:47:52,168 INFO L226 Difference]: Without dead ends: 946 [2022-03-15 19:47:52,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=773, Invalid=5382, Unknown=7, NotChecked=0, Total=6162 [2022-03-15 19:47:52,170 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 256 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:52,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 7 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:47:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-03-15 19:47:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 424. [2022-03-15 19:47:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.872340425531915) internal successors, (1215), 423 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1215 transitions. [2022-03-15 19:47:52,179 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1215 transitions. Word has length 25 [2022-03-15 19:47:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:52,179 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 1215 transitions. [2022-03-15 19:47:52,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1215 transitions. [2022-03-15 19:47:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:47:52,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:52,180 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:52,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:52,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:52,384 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash 250124466, now seen corresponding path program 42 times [2022-03-15 19:47:52,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:52,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762003039] [2022-03-15 19:47:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:53,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:53,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762003039] [2022-03-15 19:47:53,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762003039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:53,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620211252] [2022-03-15 19:47:53,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:47:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:53,085 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:53,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:47:53,223 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:47:53,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:53,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:47:53,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:53,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:53,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:53,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:53,860 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:47:53,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:47:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:53,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:55,237 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:55,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 361 treesize of output 229 [2022-03-15 19:47:55,380 INFO L353 Elim1Store]: treesize reduction 316, result has 35.6 percent of original size [2022-03-15 19:47:55,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 680 treesize of output 749 [2022-03-15 19:47:55,520 INFO L353 Elim1Store]: treesize reduction 316, result has 35.6 percent of original size [2022-03-15 19:47:55,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 575 treesize of output 587 [2022-03-15 19:47:55,678 INFO L353 Elim1Store]: treesize reduction 316, result has 35.6 percent of original size [2022-03-15 19:47:55,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 413 treesize of output 506 [2022-03-15 19:48:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:32,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620211252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:32,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:32,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:48:32,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [43220850] [2022-03-15 19:48:32,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:32,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:32,576 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2022-03-15 19:48:32,576 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:34,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [31008#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 4)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 31007#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 4)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 31006#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) 4) 1) 0) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:48:34,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:48:34,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:48:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2226, Unknown=5, NotChecked=0, Total=2652 [2022-03-15 19:48:34,410 INFO L87 Difference]: Start difference. First operand 424 states and 1215 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:36,675 INFO L93 Difference]: Finished difference Result 991 states and 2604 transitions. [2022-03-15 19:48:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:48:36,676 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 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 25 [2022-03-15 19:48:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:36,678 INFO L225 Difference]: With dead ends: 991 [2022-03-15 19:48:36,679 INFO L226 Difference]: Without dead ends: 908 [2022-03-15 19:48:36,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=733, Invalid=3818, Unknown=5, NotChecked=0, Total=4556 [2022-03-15 19:48:36,679 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 150 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:36,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 7 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:48:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-03-15 19:48:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 572. [2022-03-15 19:48:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 3.052539404553415) internal successors, (1743), 571 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1743 transitions. [2022-03-15 19:48:36,692 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1743 transitions. Word has length 25 [2022-03-15 19:48:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:36,692 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 1743 transitions. [2022-03-15 19:48:36,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1743 transitions. [2022-03-15 19:48:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:48:36,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:36,694 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:36,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:36,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:36,919 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 24897114, now seen corresponding path program 43 times [2022-03-15 19:48:36,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:36,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275839018] [2022-03-15 19:48:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:37,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:37,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275839018] [2022-03-15 19:48:37,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275839018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:37,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249069099] [2022-03-15 19:48:37,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:48:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:37,656 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:37,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:48:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:37,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:48:37,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:38,393 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:48:38,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 29 [2022-03-15 19:48:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:38,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:39,435 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:48:39,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 334 treesize of output 318 [2022-03-15 19:48:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:40,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249069099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:40,531 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:40,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 43 [2022-03-15 19:48:40,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469575226] [2022-03-15 19:48:40,531 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:40,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:40,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 66 transitions. [2022-03-15 19:48:40,544 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:41,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [33366#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 33365#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 33367#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:48:41,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:48:41,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:48:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1733, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:48:41,796 INFO L87 Difference]: Start difference. First operand 572 states and 1743 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:45,310 INFO L93 Difference]: Finished difference Result 941 states and 2525 transitions. [2022-03-15 19:48:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:48:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 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 25 [2022-03-15 19:48:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:45,314 INFO L225 Difference]: With dead ends: 941 [2022-03-15 19:48:45,314 INFO L226 Difference]: Without dead ends: 864 [2022-03-15 19:48:45,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=994, Invalid=4556, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:48:45,315 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:45,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 8 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:48:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-03-15 19:48:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 586. [2022-03-15 19:48:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 3.056410256410256) internal successors, (1788), 585 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1788 transitions. [2022-03-15 19:48:45,328 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1788 transitions. Word has length 25 [2022-03-15 19:48:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:45,328 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 1788 transitions. [2022-03-15 19:48:45,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1788 transitions. [2022-03-15 19:48:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:48:45,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:45,330 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:45,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:48:45,543 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1644936270, now seen corresponding path program 44 times [2022-03-15 19:48:45,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:45,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915699384] [2022-03-15 19:48:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:46,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:46,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915699384] [2022-03-15 19:48:46,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915699384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:46,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103292180] [2022-03-15 19:48:46,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:48:46,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:46,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:46,699 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:46,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:48:46,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:48:46,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:46,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:48:46,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:47,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:48:47,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:48:47,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:48:47,780 INFO L353 Elim1Store]: treesize reduction 357, result has 2.7 percent of original size [2022-03-15 19:48:47,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 33 [2022-03-15 19:48:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:47,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:54,526 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:54,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 357 treesize of output 225 [2022-03-15 19:48:54,649 INFO L353 Elim1Store]: treesize reduction 344, result has 27.9 percent of original size [2022-03-15 19:48:54,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1388 treesize of output 1318 [2022-03-15 19:48:54,777 INFO L353 Elim1Store]: treesize reduction 344, result has 27.9 percent of original size [2022-03-15 19:48:54,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1186 treesize of output 1164 [2022-03-15 19:48:54,907 INFO L353 Elim1Store]: treesize reduction 344, result has 27.9 percent of original size [2022-03-15 19:48:54,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1032 treesize of output 856 [2022-03-15 19:49:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:06,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103292180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:06,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:06,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:49:06,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735167898] [2022-03-15 19:49:06,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:06,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:06,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 19:49:06,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:07,791 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [35729#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 35728#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 12)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0))), 35730#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:49:07,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:49:07,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:49:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=2213, Unknown=1, NotChecked=0, Total=2652 [2022-03-15 19:49:07,792 INFO L87 Difference]: Start difference. First operand 586 states and 1788 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:10,101 INFO L93 Difference]: Finished difference Result 691 states and 1755 transitions. [2022-03-15 19:49:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:49:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 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 25 [2022-03-15 19:49:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:10,104 INFO L225 Difference]: With dead ends: 691 [2022-03-15 19:49:10,104 INFO L226 Difference]: Without dead ends: 658 [2022-03-15 19:49:10,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=768, Invalid=4201, Unknown=1, NotChecked=0, Total=4970 [2022-03-15 19:49:10,106 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 182 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:10,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 10 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:49:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-03-15 19:49:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 458. [2022-03-15 19:49:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.9059080962800876) internal successors, (1328), 457 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1328 transitions. [2022-03-15 19:49:10,116 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1328 transitions. Word has length 25 [2022-03-15 19:49:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:10,116 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1328 transitions. [2022-03-15 19:49:10,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1328 transitions. [2022-03-15 19:49:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:49:10,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:10,117 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:10,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:10,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 19:49:10,340 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1643286898, now seen corresponding path program 45 times [2022-03-15 19:49:10,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:10,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386889340] [2022-03-15 19:49:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:11,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:11,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386889340] [2022-03-15 19:49:11,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386889340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:11,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52268439] [2022-03-15 19:49:11,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:11,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:11,076 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:11,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:49:11,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:49:11,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:11,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 19:49:11,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:11,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 19:49:11,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:49:11,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:49:11,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:49:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:12,088 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:12,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 27 [2022-03-15 19:49:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:12,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:13,667 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 19:49:13,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 457 treesize of output 242 [2022-03-15 19:49:13,794 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:49:13,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 680 treesize of output 707 [2022-03-15 19:49:13,915 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:49:13,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 575 treesize of output 545 [2022-03-15 19:49:14,032 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:49:14,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 413 treesize of output 464 [2022-03-15 19:49:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:27,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52268439] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:27,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:27,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:49:27,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1495483239] [2022-03-15 19:49:27,917 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:27,919 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:27,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 66 transitions. [2022-03-15 19:49:27,930 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:29,222 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [37570#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) (+ 16 (* ~back~0 4))))), 37569#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 8)) 1) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< (* ~n~0 4) (+ (* ~back~0 4) 12))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 8)) 1) 0)))), 37571#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))))] [2022-03-15 19:49:29,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:49:29,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:49:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2032, Unknown=3, NotChecked=0, Total=2652 [2022-03-15 19:49:29,223 INFO L87 Difference]: Start difference. First operand 458 states and 1328 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:30,506 INFO L93 Difference]: Finished difference Result 506 states and 1363 transitions. [2022-03-15 19:49:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:49:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 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 25 [2022-03-15 19:49:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:30,509 INFO L225 Difference]: With dead ends: 506 [2022-03-15 19:49:30,509 INFO L226 Difference]: Without dead ends: 485 [2022-03-15 19:49:30,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=978, Invalid=3441, Unknown=3, NotChecked=0, Total=4422 [2022-03-15 19:49:30,510 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 114 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:30,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 7 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-03-15 19:49:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 434. [2022-03-15 19:49:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.8545034642032334) internal successors, (1236), 433 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1236 transitions. [2022-03-15 19:49:30,518 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1236 transitions. Word has length 25 [2022-03-15 19:49:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:30,518 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1236 transitions. [2022-03-15 19:49:30,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1236 transitions. [2022-03-15 19:49:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:49:30,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:30,519 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:30,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:30,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:49:30,739 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -26546486, now seen corresponding path program 46 times [2022-03-15 19:49:30,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:30,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600759526] [2022-03-15 19:49:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:31,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:31,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600759526] [2022-03-15 19:49:31,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600759526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:31,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787262243] [2022-03-15 19:49:31,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:49:31,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:31,452 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:31,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:49:31,650 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:49:31,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:31,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:49:31,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:32,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:32,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:32,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 27 [2022-03-15 19:49:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:32,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:33,387 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:49:33,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 334 treesize of output 318 [2022-03-15 19:49:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:34,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787262243] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:34,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:34,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 43 [2022-03-15 19:49:34,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462836802] [2022-03-15 19:49:34,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:34,739 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:34,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 19:49:34,749 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:36,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [39167#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 4)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 39166#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 4)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 39165#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:49:36,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:49:36,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:49:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:49:36,050 INFO L87 Difference]: Start difference. First operand 434 states and 1236 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:38,071 INFO L93 Difference]: Finished difference Result 531 states and 1421 transitions. [2022-03-15 19:49:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:49:38,071 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 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 25 [2022-03-15 19:49:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:38,073 INFO L225 Difference]: With dead ends: 531 [2022-03-15 19:49:38,073 INFO L226 Difference]: Without dead ends: 506 [2022-03-15 19:49:38,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=818, Invalid=3472, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:49:38,074 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:38,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 8 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:49:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-03-15 19:49:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 426. [2022-03-15 19:49:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.875294117647059) internal successors, (1222), 425 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1222 transitions. [2022-03-15 19:49:38,081 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1222 transitions. Word has length 25 [2022-03-15 19:49:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:38,082 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 1222 transitions. [2022-03-15 19:49:38,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1222 transitions. [2022-03-15 19:49:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:49:38,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:38,083 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:38,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 19:49:38,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:38,283 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 852991484, now seen corresponding path program 47 times [2022-03-15 19:49:38,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:38,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982858546] [2022-03-15 19:49:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:39,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:39,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982858546] [2022-03-15 19:49:39,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982858546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:39,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855106231] [2022-03-15 19:49:39,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:39,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:39,074 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:39,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:49:39,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:49:39,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:39,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:49:39,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:39,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:49:39,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:49:39,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:49:40,144 INFO L353 Elim1Store]: treesize reduction 464, result has 2.7 percent of original size [2022-03-15 19:49:40,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 92 treesize of output 36 [2022-03-15 19:49:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:40,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:56,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:56,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 355 treesize of output 223 [2022-03-15 19:49:56,763 INFO L353 Elim1Store]: treesize reduction 337, result has 28.3 percent of original size [2022-03-15 19:49:56,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1372 treesize of output 1306 [2022-03-15 19:49:56,904 INFO L353 Elim1Store]: treesize reduction 337, result has 28.3 percent of original size [2022-03-15 19:49:56,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1174 treesize of output 1156 [2022-03-15 19:49:57,042 INFO L353 Elim1Store]: treesize reduction 337, result has 28.3 percent of original size [2022-03-15 19:49:57,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1024 treesize of output 856 [2022-03-15 19:50:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:11,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855106231] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:11,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:11,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:50:11,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120310688] [2022-03-15 19:50:11,602 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:11,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:11,615 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2022-03-15 19:50:11,615 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:12,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [40782#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~back~0 0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 40781#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~back~0 0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:50:12,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:50:12,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:50:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2247, Unknown=6, NotChecked=0, Total=2550 [2022-03-15 19:50:12,887 INFO L87 Difference]: Start difference. First operand 426 states and 1222 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:13,362 INFO L93 Difference]: Finished difference Result 497 states and 1382 transitions. [2022-03-15 19:50:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:50:13,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 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 25 [2022-03-15 19:50:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:13,364 INFO L225 Difference]: With dead ends: 497 [2022-03-15 19:50:13,364 INFO L226 Difference]: Without dead ends: 472 [2022-03-15 19:50:13,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=327, Invalid=2423, Unknown=6, NotChecked=0, Total=2756 [2022-03-15 19:50:13,365 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:13,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 10 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:50:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-03-15 19:50:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 440. [2022-03-15 19:50:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.849658314350797) internal successors, (1251), 439 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1251 transitions. [2022-03-15 19:50:13,371 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1251 transitions. Word has length 25 [2022-03-15 19:50:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:13,372 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1251 transitions. [2022-03-15 19:50:13,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1251 transitions. [2022-03-15 19:50:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:50:13,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:13,373 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:13,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:13,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:50:13,579 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:13,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 627764132, now seen corresponding path program 48 times [2022-03-15 19:50:13,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:13,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762127015] [2022-03-15 19:50:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:14,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:14,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762127015] [2022-03-15 19:50:14,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762127015] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:14,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588468583] [2022-03-15 19:50:14,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:50:14,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:14,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:14,483 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:14,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:50:14,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:50:14,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:14,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:50:14,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:14,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:50:14,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:50:14,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:50:15,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:15,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:15,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 24 [2022-03-15 19:50:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:15,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:16,776 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:16,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 359 treesize of output 227 [2022-03-15 19:50:16,918 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:16,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 674 treesize of output 701 [2022-03-15 19:50:17,067 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:17,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 569 treesize of output 539 [2022-03-15 19:50:17,213 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:17,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 407 treesize of output 458 [2022-03-15 19:50:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:31,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588468583] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:31,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:31,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 46 [2022-03-15 19:50:31,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873376372] [2022-03-15 19:50:31,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:31,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:31,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 66 transitions. [2022-03-15 19:50:31,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:32,982 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [42357#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= (* ~n~0 4) 16)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 42356#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= (* ~n~0 4) 16)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:50:32,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:50:32,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:50:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=1876, Unknown=6, NotChecked=0, Total=2450 [2022-03-15 19:50:32,983 INFO L87 Difference]: Start difference. First operand 440 states and 1251 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:34,543 INFO L93 Difference]: Finished difference Result 551 states and 1397 transitions. [2022-03-15 19:50:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:50:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 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 25 [2022-03-15 19:50:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:34,545 INFO L225 Difference]: With dead ends: 551 [2022-03-15 19:50:34,546 INFO L226 Difference]: Without dead ends: 492 [2022-03-15 19:50:34,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1009, Invalid=3677, Unknown=6, NotChecked=0, Total=4692 [2022-03-15 19:50:34,546 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 107 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:34,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 7 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:50:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-03-15 19:50:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 404. [2022-03-15 19:50:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.836228287841191) internal successors, (1143), 403 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1143 transitions. [2022-03-15 19:50:34,552 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1143 transitions. Word has length 25 [2022-03-15 19:50:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:34,552 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1143 transitions. [2022-03-15 19:50:34,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1143 transitions. [2022-03-15 19:50:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:50:34,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:34,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:34,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:34,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:34,754 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1042069252, now seen corresponding path program 49 times [2022-03-15 19:50:34,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:34,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40737659] [2022-03-15 19:50:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:35,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:35,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40737659] [2022-03-15 19:50:35,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40737659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:35,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744840586] [2022-03-15 19:50:35,509 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:50:35,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:35,510 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:35,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:50:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:35,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:50:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:36,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:36,351 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:36,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 27 [2022-03-15 19:50:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:36,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:37,398 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:50:37,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 334 treesize of output 318 [2022-03-15 19:50:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:38,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744840586] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:38,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:38,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 44 [2022-03-15 19:50:38,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553623189] [2022-03-15 19:50:38,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:38,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:38,817 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 19:50:38,817 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:39,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [43945#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4)))), 43946#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:50:39,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:50:39,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:50:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1751, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:50:39,807 INFO L87 Difference]: Start difference. First operand 404 states and 1143 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:40,677 INFO L93 Difference]: Finished difference Result 459 states and 1242 transitions. [2022-03-15 19:50:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:50:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 25 [2022-03-15 19:50:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:40,679 INFO L225 Difference]: With dead ends: 459 [2022-03-15 19:50:40,679 INFO L226 Difference]: Without dead ends: 444 [2022-03-15 19:50:40,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=666, Invalid=2526, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:50:40,680 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:40,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 7 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:50:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-03-15 19:50:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 404. [2022-03-15 19:50:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.826302729528536) internal successors, (1139), 403 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1139 transitions. [2022-03-15 19:50:40,687 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1139 transitions. Word has length 25 [2022-03-15 19:50:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:40,687 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1139 transitions. [2022-03-15 19:50:40,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1139 transitions. [2022-03-15 19:50:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:50:40,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:40,688 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:40,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:40,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 19:50:40,911 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2048813380, now seen corresponding path program 50 times [2022-03-15 19:50:40,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:40,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48078037] [2022-03-15 19:50:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:41,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:41,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48078037] [2022-03-15 19:50:41,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48078037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:41,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638600540] [2022-03-15 19:50:41,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:50:41,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:41,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:41,650 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:41,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:50:41,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:50:41,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:41,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:50:41,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:42,445 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:50:42,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:50:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:42,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:43,437 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:50:43,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 336 treesize of output 320 [2022-03-15 19:50:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:44,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638600540] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:44,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:44,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 44 [2022-03-15 19:50:44,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378073893] [2022-03-15 19:50:44,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:44,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:44,671 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 66 transitions. [2022-03-15 19:50:44,671 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:45,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [45423#(and (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)))) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 ~back~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)))) (not (<= 0 ~back~0)))), 45422#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 ~back~0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)))) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 4) 12)))) (not (<= 0 ~back~0))))] [2022-03-15 19:50:45,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:50:45,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:50:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1927, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:50:45,832 INFO L87 Difference]: Start difference. First operand 404 states and 1139 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:46,854 INFO L93 Difference]: Finished difference Result 513 states and 1437 transitions. [2022-03-15 19:50:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:50:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 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 25 [2022-03-15 19:50:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:46,856 INFO L225 Difference]: With dead ends: 513 [2022-03-15 19:50:46,856 INFO L226 Difference]: Without dead ends: 486 [2022-03-15 19:50:46,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=494, Invalid=3046, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:50:46,857 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:46,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 9 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:50:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-03-15 19:50:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 406. [2022-03-15 19:50:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8246913580246913) internal successors, (1144), 405 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1144 transitions. [2022-03-15 19:50:46,864 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1144 transitions. Word has length 25 [2022-03-15 19:50:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:46,864 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 1144 transitions. [2022-03-15 19:50:46,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1144 transitions. [2022-03-15 19:50:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:50:46,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:46,865 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:46,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:47,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 19:50:47,071 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 576320532, now seen corresponding path program 51 times [2022-03-15 19:50:47,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:47,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705786327] [2022-03-15 19:50:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:47,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:47,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705786327] [2022-03-15 19:50:47,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705786327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:47,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003359656] [2022-03-15 19:50:47,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:50:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:47,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:47,957 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 19:50:48,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:50:48,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:48,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:50:48,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:48,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 19:50:48,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:50:48,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:50:48,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:48,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:48,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 27 [2022-03-15 19:50:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:48,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:50,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:50,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 361 treesize of output 229 [2022-03-15 19:50:50,503 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:50,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 680 treesize of output 707 [2022-03-15 19:50:50,621 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:50,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 575 treesize of output 545 [2022-03-15 19:50:50,734 INFO L353 Elim1Store]: treesize reduction 358, result has 27.1 percent of original size [2022-03-15 19:50:50,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 413 treesize of output 464 [2022-03-15 19:51:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:08,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003359656] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:08,860 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:08,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2022-03-15 19:51:08,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164847185] [2022-03-15 19:51:08,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:08,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:08,873 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 19:51:08,873 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:09,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [46966#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 46967#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= ~n~0 4)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:51:09,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:51:09,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:51:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=1973, Unknown=6, NotChecked=0, Total=2550 [2022-03-15 19:51:09,874 INFO L87 Difference]: Start difference. First operand 406 states and 1144 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:10,937 INFO L93 Difference]: Finished difference Result 819 states and 2168 transitions. [2022-03-15 19:51:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:51:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:10,940 INFO L225 Difference]: With dead ends: 819 [2022-03-15 19:51:10,940 INFO L226 Difference]: Without dead ends: 772 [2022-03-15 19:51:10,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=714, Invalid=2586, Unknown=6, NotChecked=0, Total=3306 [2022-03-15 19:51:10,941 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 92 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:10,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 7 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:51:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-03-15 19:51:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 472. [2022-03-15 19:51:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.889596602972399) internal successors, (1361), 471 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1361 transitions. [2022-03-15 19:51:10,948 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1361 transitions. Word has length 25 [2022-03-15 19:51:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:10,948 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1361 transitions. [2022-03-15 19:51:10,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1361 transitions. [2022-03-15 19:51:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:10,949 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:10,949 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:10,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 19:51:11,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:11,150 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash 850157306, now seen corresponding path program 52 times [2022-03-15 19:51:11,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:11,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39996520] [2022-03-15 19:51:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:11,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:11,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39996520] [2022-03-15 19:51:11,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39996520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:11,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578069942] [2022-03-15 19:51:11,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:51:11,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:11,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:11,951 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:11,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 19:51:12,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:51:12,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:12,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:51:12,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:12,453 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:12,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:51:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:51:12,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:12,962 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:51:12,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:51:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:51:13,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578069942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:13,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:13,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 34 [2022-03-15 19:51:13,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1784560324] [2022-03-15 19:51:13,719 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:13,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:13,734 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2022-03-15 19:51:13,734 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:17,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [48927#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~front~0 4) 4)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 48926#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~front~0 4) 4)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 48928#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (* ~front~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)))), 48929#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 48925#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (* ~front~0 4) 4) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (* ~front~0 4) 4) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:51:17,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:51:17,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:51:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1437, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:51:17,073 INFO L87 Difference]: Start difference. First operand 472 states and 1361 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:17,688 INFO L93 Difference]: Finished difference Result 513 states and 1456 transitions. [2022-03-15 19:51:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:51:17,688 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:51:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:17,690 INFO L225 Difference]: With dead ends: 513 [2022-03-15 19:51:17,690 INFO L226 Difference]: Without dead ends: 504 [2022-03-15 19:51:17,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=297, Invalid=2055, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:51:17,690 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:17,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:51:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-03-15 19:51:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 474. [2022-03-15 19:51:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.8921775898520083) internal successors, (1368), 473 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1368 transitions. [2022-03-15 19:51:17,698 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1368 transitions. Word has length 25 [2022-03-15 19:51:17,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:17,699 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1368 transitions. [2022-03-15 19:51:17,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1368 transitions. [2022-03-15 19:51:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:17,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:17,700 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:17,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:17,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 19:51:17,919 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -188699792, now seen corresponding path program 53 times [2022-03-15 19:51:17,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:17,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179412231] [2022-03-15 19:51:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:19,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:19,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179412231] [2022-03-15 19:51:19,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179412231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:19,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260170632] [2022-03-15 19:51:19,789 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:51:19,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:19,790 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:19,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 19:51:19,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:51:19,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:19,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:51:19,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:20,328 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:20,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:51:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:20,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:20,806 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:51:20,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:51:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:51:21,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260170632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:21,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:21,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 8] total 36 [2022-03-15 19:51:21,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026833137] [2022-03-15 19:51:21,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:21,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:21,607 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 67 transitions. [2022-03-15 19:51:21,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:23,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [50590#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 50592#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 50591#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 50589#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:51:23,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:51:23,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:51:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:51:23,745 INFO L87 Difference]: Start difference. First operand 474 states and 1368 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:24,552 INFO L93 Difference]: Finished difference Result 626 states and 1740 transitions. [2022-03-15 19:51:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:51:24,552 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:24,554 INFO L225 Difference]: With dead ends: 626 [2022-03-15 19:51:24,554 INFO L226 Difference]: Without dead ends: 609 [2022-03-15 19:51:24,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:51:24,555 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:24,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 11 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:51:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-03-15 19:51:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 485. [2022-03-15 19:51:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.865702479338843) internal successors, (1387), 484 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1387 transitions. [2022-03-15 19:51:24,562 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1387 transitions. Word has length 25 [2022-03-15 19:51:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:24,562 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 1387 transitions. [2022-03-15 19:51:24,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1387 transitions. [2022-03-15 19:51:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:24,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:24,563 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:24,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:24,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 19:51:24,764 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash 779515430, now seen corresponding path program 54 times [2022-03-15 19:51:24,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:24,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251871471] [2022-03-15 19:51:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:26,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:26,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251871471] [2022-03-15 19:51:26,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251871471] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:26,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693143060] [2022-03-15 19:51:26,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:51:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:26,600 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:26,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 19:51:26,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:51:26,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:26,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:51:26,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:27,286 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:27,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 22 [2022-03-15 19:51:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:51:27,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:27,779 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:51:27,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:51:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:51:28,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693143060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:28,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:28,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 8] total 33 [2022-03-15 19:51:28,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956523919] [2022-03-15 19:51:28,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:28,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:28,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2022-03-15 19:51:28,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:29,821 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [52388#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~front~0 4) 8) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) 24) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 52387#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~front~0 4) 8) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) 24) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 52386#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (+ (* ~front~0 4) 8) (+ ~queue~0.offset (* ~back~0 4) 4)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 1 (+ (* ~front~0 4) ~queue~0.offset)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~front~0 4) 8) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) 24) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:51:29,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:51:29,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:51:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:51:29,822 INFO L87 Difference]: Start difference. First operand 485 states and 1387 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:30,475 INFO L93 Difference]: Finished difference Result 616 states and 1717 transitions. [2022-03-15 19:51:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:51:30,475 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:30,477 INFO L225 Difference]: With dead ends: 616 [2022-03-15 19:51:30,477 INFO L226 Difference]: Without dead ends: 601 [2022-03-15 19:51:30,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:51:30,478 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:30,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:51:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-03-15 19:51:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 485. [2022-03-15 19:51:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.865702479338843) internal successors, (1387), 484 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1387 transitions. [2022-03-15 19:51:30,486 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1387 transitions. Word has length 25 [2022-03-15 19:51:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:30,486 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 1387 transitions. [2022-03-15 19:51:30,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1387 transitions. [2022-03-15 19:51:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:30,487 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:30,487 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:30,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:30,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:30,687 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash -890317954, now seen corresponding path program 55 times [2022-03-15 19:51:30,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:30,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935730660] [2022-03-15 19:51:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:32,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:32,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935730660] [2022-03-15 19:51:32,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935730660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:32,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671486167] [2022-03-15 19:51:32,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:32,480 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:32,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 19:51:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:32,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:51:32,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:33,019 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:51:33,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 18 [2022-03-15 19:51:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:33,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:33,650 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:51:33,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:51:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:51:34,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671486167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:34,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:34,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 8] total 35 [2022-03-15 19:51:34,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126389076] [2022-03-15 19:51:34,376 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:34,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:34,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 57 transitions. [2022-03-15 19:51:34,388 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:35,310 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [54174#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 54175#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 54176#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:51:35,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:51:35,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:51:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:51:35,311 INFO L87 Difference]: Start difference. First operand 485 states and 1387 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:36,441 INFO L93 Difference]: Finished difference Result 672 states and 1834 transitions. [2022-03-15 19:51:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:51:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:36,443 INFO L225 Difference]: With dead ends: 672 [2022-03-15 19:51:36,443 INFO L226 Difference]: Without dead ends: 621 [2022-03-15 19:51:36,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=447, Invalid=2415, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:51:36,447 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 96 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:36,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 11 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:51:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-03-15 19:51:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 495. [2022-03-15 19:51:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.866396761133603) internal successors, (1416), 494 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1416 transitions. [2022-03-15 19:51:36,456 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1416 transitions. Word has length 25 [2022-03-15 19:51:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:36,456 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1416 transitions. [2022-03-15 19:51:36,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1416 transitions. [2022-03-15 19:51:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:36,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:36,457 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:36,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:36,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:36,657 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 739919344, now seen corresponding path program 56 times [2022-03-15 19:51:36,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:36,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143430800] [2022-03-15 19:51:36,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:37,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:37,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143430800] [2022-03-15 19:51:37,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143430800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:37,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457503491] [2022-03-15 19:51:37,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:51:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:37,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:37,794 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:37,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 19:51:37,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:51:37,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:37,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:51:37,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:38,264 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:38,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:51:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:38,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:38,775 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:51:38,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 234 [2022-03-15 19:51:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:51:39,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457503491] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:39,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:39,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 32 [2022-03-15 19:51:39,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604108146] [2022-03-15 19:51:39,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:39,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:39,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2022-03-15 19:51:39,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:40,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [56045#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 56046#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 1)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:51:40,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:51:40,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:51:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:51:40,402 INFO L87 Difference]: Start difference. First operand 495 states and 1416 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:41,455 INFO L93 Difference]: Finished difference Result 755 states and 2058 transitions. [2022-03-15 19:51:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:51:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:41,457 INFO L225 Difference]: With dead ends: 755 [2022-03-15 19:51:41,457 INFO L226 Difference]: Without dead ends: 713 [2022-03-15 19:51:41,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=323, Invalid=1933, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:51:41,457 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:41,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 12 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:51:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-03-15 19:51:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 519. [2022-03-15 19:51:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.864864864864865) internal successors, (1484), 518 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1484 transitions. [2022-03-15 19:51:41,465 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1484 transitions. Word has length 25 [2022-03-15 19:51:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:41,465 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 1484 transitions. [2022-03-15 19:51:41,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1484 transitions. [2022-03-15 19:51:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:41,466 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:41,466 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:41,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:41,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:41,667 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -929914040, now seen corresponding path program 57 times [2022-03-15 19:51:41,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:41,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681531340] [2022-03-15 19:51:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:42,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:42,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681531340] [2022-03-15 19:51:42,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681531340] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:42,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749575698] [2022-03-15 19:51:42,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:51:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:42,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:42,964 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:42,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 19:51:43,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:51:43,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:43,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:51:43,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:43,594 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:43,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:51:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:51:43,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:44,180 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:51:44,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:51:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:51:44,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749575698] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:44,947 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:44,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 8] total 32 [2022-03-15 19:51:44,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603433598] [2022-03-15 19:51:44,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:44,950 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:44,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 57 transitions. [2022-03-15 19:51:44,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:45,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [58042#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 1 ~front~0) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 58043#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~front~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 1 ~front~0) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:51:45,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:51:45,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:51:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:51:45,979 INFO L87 Difference]: Start difference. First operand 519 states and 1484 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:46,652 INFO L93 Difference]: Finished difference Result 632 states and 1769 transitions. [2022-03-15 19:51:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:51:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:51:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:46,654 INFO L225 Difference]: With dead ends: 632 [2022-03-15 19:51:46,654 INFO L226 Difference]: Without dead ends: 611 [2022-03-15 19:51:46,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=342, Invalid=1728, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:51:46,654 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:46,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 11 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:51:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-15 19:51:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2022-03-15 19:51:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 2.8582375478927204) internal successors, (1492), 522 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1492 transitions. [2022-03-15 19:51:46,661 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1492 transitions. Word has length 25 [2022-03-15 19:51:46,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:46,661 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 1492 transitions. [2022-03-15 19:51:46,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1492 transitions. [2022-03-15 19:51:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:46,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:46,662 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:46,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:46,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 19:51:46,862 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash 869633916, now seen corresponding path program 58 times [2022-03-15 19:51:46,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:46,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10700310] [2022-03-15 19:51:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:47,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:47,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10700310] [2022-03-15 19:51:47,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10700310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:47,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404051174] [2022-03-15 19:51:47,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:51:47,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:47,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:47,819 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:47,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 19:51:47,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:51:47,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:47,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:51:47,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:48,298 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:51:48,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-03-15 19:51:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:48,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:48,572 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:51:48,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 192 [2022-03-15 19:51:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 19:51:48,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404051174] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:48,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:48,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 5] total 32 [2022-03-15 19:51:48,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289677732] [2022-03-15 19:51:48,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:48,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:48,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 53 transitions. [2022-03-15 19:51:48,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:49,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [59920#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 8) (< 1 ~front~0) (= ~front~0 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0)))), 59921#(and (or (< ~back~0 0) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 8) (< 1 ~front~0) (= ~front~0 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:51:49,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:51:49,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:51:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:51:49,643 INFO L87 Difference]: Start difference. First operand 523 states and 1492 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:50,404 INFO L93 Difference]: Finished difference Result 640 states and 1787 transitions. [2022-03-15 19:51:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:51:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 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 25 [2022-03-15 19:51:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:50,406 INFO L225 Difference]: With dead ends: 640 [2022-03-15 19:51:50,406 INFO L226 Difference]: Without dead ends: 627 [2022-03-15 19:51:50,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=1837, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:51:50,406 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:50,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 6 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:51:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-03-15 19:51:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 513. [2022-03-15 19:51:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 2.8828125) internal successors, (1476), 512 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1476 transitions. [2022-03-15 19:51:50,413 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1476 transitions. Word has length 25 [2022-03-15 19:51:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:50,413 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 1476 transitions. [2022-03-15 19:51:50,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1476 transitions. [2022-03-15 19:51:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:51:50,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:50,414 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:50,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:50,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-03-15 19:51:50,615 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash -727372294, now seen corresponding path program 59 times [2022-03-15 19:51:50,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:50,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725596222] [2022-03-15 19:51:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:50,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:50,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:50,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725596222] [2022-03-15 19:51:50,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725596222] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:50,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755704944] [2022-03-15 19:51:50,812 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:51:50,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:50,813 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:50,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 19:51:50,978 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:51:50,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:50,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:51:50,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:51,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:51,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755704944] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:51,383 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:51,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-03-15 19:51:51,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [838985573] [2022-03-15 19:51:51,383 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:51,385 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:51,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 84 transitions. [2022-03-15 19:51:51,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:51,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:51:51,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:51:51,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:51:51,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:51:51,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:51:51,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:51:52,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:51:52,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:51:52,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [61796#(or (< ~back~0 0) (<= ~back~0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2))), 61797#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (<= ~back~0 ~front~0)), 61794#(or (<= ~back~0 (+ 3 ~front~0)) (< ~back~0 0) (<= ~n~0 ~back~0)), 61795#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~back~0 (+ 2 ~front~0)))] [2022-03-15 19:51:52,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:51:52,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:51:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:51:52,130 INFO L87 Difference]: Start difference. First operand 513 states and 1476 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:52,701 INFO L93 Difference]: Finished difference Result 1245 states and 3338 transitions. [2022-03-15 19:51:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:51:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:51:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:52,703 INFO L225 Difference]: With dead ends: 1245 [2022-03-15 19:51:52,703 INFO L226 Difference]: Without dead ends: 1219 [2022-03-15 19:51:52,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=648, Invalid=2322, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:51:52,704 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 243 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:52,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 7 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:51:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-03-15 19:51:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 585. [2022-03-15 19:51:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 2.9794520547945207) internal successors, (1740), 584 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1740 transitions. [2022-03-15 19:51:52,714 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1740 transitions. Word has length 26 [2022-03-15 19:51:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:52,714 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 1740 transitions. [2022-03-15 19:51:52,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1740 transitions. [2022-03-15 19:51:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:51:52,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:52,715 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:52,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-03-15 19:51:52,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-03-15 19:51:52,915 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -256431310, now seen corresponding path program 60 times [2022-03-15 19:51:52,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:52,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11951620] [2022-03-15 19:51:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:53,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:53,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11951620] [2022-03-15 19:51:53,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11951620] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:53,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721050984] [2022-03-15 19:51:53,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:51:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:53,984 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:53,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 19:51:54,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:51:54,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:54,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:51:54,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:54,641 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:51:54,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:51:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:54,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:55,396 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:51:55,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:51:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:51:56,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721050984] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:56,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:56,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 9] total 38 [2022-03-15 19:51:56,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704667705] [2022-03-15 19:51:56,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:56,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:56,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 77 transitions. [2022-03-15 19:51:56,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:00,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [64439#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 64437#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0)))), 64440#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 64438#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~front~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 64441#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:52:00,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:00,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:00,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:00,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:52:00,887 INFO L87 Difference]: Start difference. First operand 585 states and 1740 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:01,386 INFO L93 Difference]: Finished difference Result 698 states and 2047 transitions. [2022-03-15 19:52:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:01,388 INFO L225 Difference]: With dead ends: 698 [2022-03-15 19:52:01,388 INFO L226 Difference]: Without dead ends: 679 [2022-03-15 19:52:01,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=296, Invalid=2056, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:52:01,388 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:01,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 11 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-03-15 19:52:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 609. [2022-03-15 19:52:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 2.9671052631578947) internal successors, (1804), 608 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1804 transitions. [2022-03-15 19:52:01,398 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1804 transitions. Word has length 26 [2022-03-15 19:52:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:01,398 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 1804 transitions. [2022-03-15 19:52:01,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1804 transitions. [2022-03-15 19:52:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:01,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:01,400 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:01,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:01,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:01,601 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash -306530500, now seen corresponding path program 61 times [2022-03-15 19:52:01,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:01,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456417716] [2022-03-15 19:52:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:02,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:02,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456417716] [2022-03-15 19:52:02,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456417716] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:02,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965935091] [2022-03-15 19:52:02,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:52:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:02,942 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:02,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 19:52:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:03,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:52:03,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:03,551 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:52:03,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:52:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:03,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:04,450 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:52:04,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:52:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:05,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965935091] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:05,198 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:05,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 35 [2022-03-15 19:52:05,199 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955213270] [2022-03-15 19:52:05,199 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:05,201 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:05,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 72 transitions. [2022-03-15 19:52:05,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:07,542 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [66553#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 8) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)))), 66556#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 66554#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~front~0 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 66555#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~n~0 (+ ~back~0 2)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))))] [2022-03-15 19:52:07,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:07,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:07,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:07,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:52:07,543 INFO L87 Difference]: Start difference. First operand 609 states and 1804 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:08,096 INFO L93 Difference]: Finished difference Result 728 states and 2134 transitions. [2022-03-15 19:52:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:08,097 INFO L225 Difference]: With dead ends: 728 [2022-03-15 19:52:08,097 INFO L226 Difference]: Without dead ends: 711 [2022-03-15 19:52:08,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:52:08,098 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:08,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 11 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:52:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-03-15 19:52:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 611. [2022-03-15 19:52:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 2.9655737704918033) internal successors, (1809), 610 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1809 transitions. [2022-03-15 19:52:08,107 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1809 transitions. Word has length 26 [2022-03-15 19:52:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:08,107 INFO L470 AbstractCegarLoop]: Abstraction has 611 states and 1809 transitions. [2022-03-15 19:52:08,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1809 transitions. [2022-03-15 19:52:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:08,109 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:08,109 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:08,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:08,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:08,335 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash -531757852, now seen corresponding path program 62 times [2022-03-15 19:52:08,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:08,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133125772] [2022-03-15 19:52:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:09,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:09,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133125772] [2022-03-15 19:52:09,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133125772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:09,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790899069] [2022-03-15 19:52:09,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:52:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:09,576 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:52:09,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:52:09,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:09,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:52:09,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:10,269 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:10,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:52:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:10,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:11,086 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:52:11,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:52:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:12,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790899069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:12,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:12,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 39 [2022-03-15 19:52:12,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701605294] [2022-03-15 19:52:12,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:12,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:12,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2022-03-15 19:52:12,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:15,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [68706#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) 16) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 16) 1))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) 12) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 8) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0)))), 68707#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 16) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (<= (+ (select (select |#memory_int| ~queue~0.base) 16) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 (* ~front~0 4)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~front~0 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) 12) 1) (<= ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= ~front~0 0) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1)))), 68708#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) 12) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 16) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (<= (+ (select (select |#memory_int| ~queue~0.base) 16) 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 68709#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) 12) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (<= (+ (select (select |#memory_int| ~queue~0.base) 16) 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= 0 (+ (select (select |#memory_int| ~queue~0.base) 8) 1))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) 16) 1))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:52:15,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:15,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:52:15,645 INFO L87 Difference]: Start difference. First operand 611 states and 1809 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:16,707 INFO L93 Difference]: Finished difference Result 756 states and 2198 transitions. [2022-03-15 19:52:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:16,707 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:16,708 INFO L225 Difference]: With dead ends: 756 [2022-03-15 19:52:16,708 INFO L226 Difference]: Without dead ends: 741 [2022-03-15 19:52:16,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=322, Invalid=2648, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:52:16,709 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:16,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 11 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-03-15 19:52:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 613. [2022-03-15 19:52:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 2.9640522875816995) internal successors, (1814), 612 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1814 transitions. [2022-03-15 19:52:16,717 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1814 transitions. Word has length 26 [2022-03-15 19:52:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:16,717 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 1814 transitions. [2022-03-15 19:52:16,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1814 transitions. [2022-03-15 19:52:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:16,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:16,718 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:16,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:16,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 19:52:16,918 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2093376060, now seen corresponding path program 63 times [2022-03-15 19:52:16,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:16,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235055530] [2022-03-15 19:52:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:18,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:18,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235055530] [2022-03-15 19:52:18,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235055530] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:18,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803290571] [2022-03-15 19:52:18,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:52:18,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:18,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:18,087 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:18,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:52:18,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:52:18,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:18,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:52:18,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:18,872 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:18,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:52:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:52:18,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:19,710 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:52:19,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:52:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:21,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803290571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:21,001 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:21,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 38 [2022-03-15 19:52:21,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843651118] [2022-03-15 19:52:21,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:21,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:21,014 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 19:52:21,015 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:23,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [70902#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 3)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (* ~back~0 4)) (not (<= 0 ~back~0)))), 70905#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 70903#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= (+ ~front~0 ~n~0) (+ ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= ~front~0 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 70904#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:52:23,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:23,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:52:23,269 INFO L87 Difference]: Start difference. First operand 613 states and 1814 transitions. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:23,944 INFO L93 Difference]: Finished difference Result 750 states and 2171 transitions. [2022-03-15 19:52:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:23,946 INFO L225 Difference]: With dead ends: 750 [2022-03-15 19:52:23,946 INFO L226 Difference]: Without dead ends: 737 [2022-03-15 19:52:23,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=282, Invalid=2070, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:52:23,946 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:23,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 10 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:52:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-03-15 19:52:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 611. [2022-03-15 19:52:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 2.9655737704918033) internal successors, (1809), 610 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1809 transitions. [2022-03-15 19:52:23,955 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1809 transitions. Word has length 26 [2022-03-15 19:52:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:23,955 INFO L470 AbstractCegarLoop]: Abstraction has 611 states and 1809 transitions. [2022-03-15 19:52:23,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1809 transitions. [2022-03-15 19:52:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:23,956 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:23,956 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:23,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-03-15 19:52:24,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-03-15 19:52:24,156 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1534009166, now seen corresponding path program 64 times [2022-03-15 19:52:24,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:24,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077147159] [2022-03-15 19:52:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:25,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:25,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077147159] [2022-03-15 19:52:25,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077147159] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:25,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851341475] [2022-03-15 19:52:25,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:52:25,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:25,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:25,292 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:25,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:52:25,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:52:25,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:25,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:52:25,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:25,955 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:25,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:52:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:25,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:26,791 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:52:26,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:52:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:28,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851341475] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:28,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:28,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 39 [2022-03-15 19:52:28,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2049860210] [2022-03-15 19:52:28,170 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:28,173 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:28,185 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 72 transitions. [2022-03-15 19:52:28,185 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:30,300 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [73081#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 5) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= ~front~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= ~front~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 73079#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 (* ~front~0 4)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~front~0 0) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4)))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< 0 (* ~front~0 4)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (<= (+ ~front~0 1) ~back~0) (= ~front~0 1)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 (* ~front~0 4)) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= ~n~0 5) (<= ~front~0 0) (not (<= 0 ~back~0)) (= ~front~0 1))), 73080#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= 5 (+ (* ~front~0 4) ~queue~0.offset)) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= ~front~0 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (< 0 (* ~front~0 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 5) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= ~front~0 1)))] [2022-03-15 19:52:30,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:52:30,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:52:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:52:30,301 INFO L87 Difference]: Start difference. First operand 611 states and 1809 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:31,016 INFO L93 Difference]: Finished difference Result 734 states and 2147 transitions. [2022-03-15 19:52:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:31,018 INFO L225 Difference]: With dead ends: 734 [2022-03-15 19:52:31,018 INFO L226 Difference]: Without dead ends: 717 [2022-03-15 19:52:31,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=265, Invalid=1991, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:52:31,018 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:31,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:52:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-03-15 19:52:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 615. [2022-03-15 19:52:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 2.962540716612378) internal successors, (1819), 614 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1819 transitions. [2022-03-15 19:52:31,028 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1819 transitions. Word has length 26 [2022-03-15 19:52:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:31,028 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 1819 transitions. [2022-03-15 19:52:31,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1819 transitions. [2022-03-15 19:52:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:31,029 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:31,029 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:31,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:31,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:31,230 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:31,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1759236518, now seen corresponding path program 65 times [2022-03-15 19:52:31,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:31,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317570414] [2022-03-15 19:52:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:32,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:32,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317570414] [2022-03-15 19:52:32,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317570414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:32,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134826223] [2022-03-15 19:52:32,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:52:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:32,668 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:32,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:52:32,898 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:52:32,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:32,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:52:32,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:33,406 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:33,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:52:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:33,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:34,265 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:52:34,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:52:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:35,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134826223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:35,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:35,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 39 [2022-03-15 19:52:35,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757585702] [2022-03-15 19:52:35,734 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:35,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:35,748 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2022-03-15 19:52:35,748 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:37,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [75245#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= ~front~0 0)) (<= ~n~0 ~back~0) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (not (= ~front~0 0)) (not (<= 0 ~back~0)))), 75246#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 75247#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:52:37,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:52:37,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:52:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:52:37,938 INFO L87 Difference]: Start difference. First operand 615 states and 1819 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:38,826 INFO L93 Difference]: Finished difference Result 738 states and 2149 transitions. [2022-03-15 19:52:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:38,828 INFO L225 Difference]: With dead ends: 738 [2022-03-15 19:52:38,828 INFO L226 Difference]: Without dead ends: 723 [2022-03-15 19:52:38,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:52:38,829 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:38,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 11 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-03-15 19:52:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 617. [2022-03-15 19:52:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 2.961038961038961) internal successors, (1824), 616 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1824 transitions. [2022-03-15 19:52:38,837 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1824 transitions. Word has length 26 [2022-03-15 19:52:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:38,837 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1824 transitions. [2022-03-15 19:52:38,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1824 transitions. [2022-03-15 19:52:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:38,838 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:38,839 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:38,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:39,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:52:39,051 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:39,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash 865897394, now seen corresponding path program 66 times [2022-03-15 19:52:39,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:39,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569347196] [2022-03-15 19:52:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:40,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:40,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569347196] [2022-03-15 19:52:40,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569347196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:40,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048921362] [2022-03-15 19:52:40,242 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:52:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:40,244 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:40,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:52:40,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:52:40,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:40,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:52:40,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:41,086 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:41,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:52:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:41,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:41,934 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:52:41,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:52:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:43,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048921362] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:43,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:43,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 9] total 38 [2022-03-15 19:52:43,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562218702] [2022-03-15 19:52:43,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:43,315 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:43,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 19:52:43,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:45,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [77430#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (* ~n~0 4) 20) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~back~0 4) (+ (* ~front~0 8) 4)) (not (= ~front~0 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (= ~front~0 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 12)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (< ~back~0 ~n~0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 77431#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) 20) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~back~0 4) (* ~front~0 8)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)))), 77432#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) 20) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~back~0 4) (* ~front~0 8)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))))] [2022-03-15 19:52:45,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:52:45,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:52:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:52:45,178 INFO L87 Difference]: Start difference. First operand 617 states and 1824 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:45,760 INFO L93 Difference]: Finished difference Result 748 states and 2170 transitions. [2022-03-15 19:52:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:45,762 INFO L225 Difference]: With dead ends: 748 [2022-03-15 19:52:45,762 INFO L226 Difference]: Without dead ends: 735 [2022-03-15 19:52:45,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:52:45,763 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:45,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-03-15 19:52:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 613. [2022-03-15 19:52:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 2.9640522875816995) internal successors, (1814), 612 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1814 transitions. [2022-03-15 19:52:45,774 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1814 transitions. Word has length 26 [2022-03-15 19:52:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:45,775 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 1814 transitions. [2022-03-15 19:52:45,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1814 transitions. [2022-03-15 19:52:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:45,776 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:45,776 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:45,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:45,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 19:52:45,991 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -140846734, now seen corresponding path program 67 times [2022-03-15 19:52:45,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:45,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350272397] [2022-03-15 19:52:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:47,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:47,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350272397] [2022-03-15 19:52:47,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350272397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:47,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004219863] [2022-03-15 19:52:47,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:52:47,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:47,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:47,123 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:47,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:52:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:47,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:52:47,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:47,796 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:52:47,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:52:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:47,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:48,735 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:52:48,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:52:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:49,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004219863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:49,519 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:49,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 9] total 38 [2022-03-15 19:52:49,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919352239] [2022-03-15 19:52:49,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:49,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:49,533 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2022-03-15 19:52:49,533 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:50,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [79607#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (<= ~front~0 0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (+ (* ~back~0 4) 4)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 79609#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 79608#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:52:50,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:52:50,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:52:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:52:50,924 INFO L87 Difference]: Start difference. First operand 613 states and 1814 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:51,911 INFO L93 Difference]: Finished difference Result 740 states and 2151 transitions. [2022-03-15 19:52:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:52:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:51,913 INFO L225 Difference]: With dead ends: 740 [2022-03-15 19:52:51,913 INFO L226 Difference]: Without dead ends: 721 [2022-03-15 19:52:51,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=508, Invalid=2798, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:52:51,914 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:51,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 10 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-03-15 19:52:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 621. [2022-03-15 19:52:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 2.9548387096774196) internal successors, (1832), 620 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1832 transitions. [2022-03-15 19:52:51,925 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1832 transitions. Word has length 26 [2022-03-15 19:52:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:51,925 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 1832 transitions. [2022-03-15 19:52:51,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1832 transitions. [2022-03-15 19:52:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:51,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:51,926 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:51,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:52,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 19:52:52,143 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1810680118, now seen corresponding path program 68 times [2022-03-15 19:52:52,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:52,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468077956] [2022-03-15 19:52:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:53,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:53,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468077956] [2022-03-15 19:52:53,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468077956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:53,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135067720] [2022-03-15 19:52:53,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:52:53,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:53,284 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:53,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 19:52:53,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:52:53,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:53,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:52:53,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:54,017 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:52:54,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:52:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:54,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:54,972 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:52:54,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:52:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:55,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135067720] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:55,986 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:55,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 39 [2022-03-15 19:52:55,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102172109] [2022-03-15 19:52:55,986 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:55,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:56,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 19:52:56,021 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:57,621 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [81814#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 81815#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~front~0 ~n~0) (+ ~back~0 5)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 81813#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< (* ~n~0 4) (+ (* ~back~0 4) 12))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= ~front~0 1))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 ~front~0) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (<= ~front~0 1) (not (<= 0 ~back~0))))] [2022-03-15 19:52:57,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:52:57,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:52:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:52:57,622 INFO L87 Difference]: Start difference. First operand 621 states and 1832 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:58,507 INFO L93 Difference]: Finished difference Result 816 states and 2340 transitions. [2022-03-15 19:52:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:52:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:58,512 INFO L225 Difference]: With dead ends: 816 [2022-03-15 19:52:58,512 INFO L226 Difference]: Without dead ends: 803 [2022-03-15 19:52:58,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=410, Invalid=2140, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:52:58,513 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:58,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:52:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2022-03-15 19:52:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 621. [2022-03-15 19:52:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 2.9548387096774196) internal successors, (1832), 620 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1832 transitions. [2022-03-15 19:52:58,530 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1832 transitions. Word has length 26 [2022-03-15 19:52:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:58,530 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 1832 transitions. [2022-03-15 19:52:58,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1832 transitions. [2022-03-15 19:52:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:58,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:58,532 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:58,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:58,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-03-15 19:52:58,747 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -931142148, now seen corresponding path program 69 times [2022-03-15 19:52:58,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:58,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953601454] [2022-03-15 19:52:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:59,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:59,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953601454] [2022-03-15 19:52:59,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953601454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:59,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283729323] [2022-03-15 19:52:59,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:52:59,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:59,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:59,827 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:59,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:53:00,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:53:00,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:00,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:53:00,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:00,410 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:53:00,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:53:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:00,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:01,242 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:53:01,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:53:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:02,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283729323] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:02,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:02,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 35 [2022-03-15 19:53:02,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033760874] [2022-03-15 19:53:02,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:02,525 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:02,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 72 transitions. [2022-03-15 19:53:02,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:04,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [84076#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 84075#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:53:04,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:53:04,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:04,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:53:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:53:04,552 INFO L87 Difference]: Start difference. First operand 621 states and 1832 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:05,081 INFO L93 Difference]: Finished difference Result 742 states and 2165 transitions. [2022-03-15 19:53:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:53:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:05,083 INFO L225 Difference]: With dead ends: 742 [2022-03-15 19:53:05,083 INFO L226 Difference]: Without dead ends: 725 [2022-03-15 19:53:05,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:53:05,083 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:05,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:53:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-03-15 19:53:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 623. [2022-03-15 19:53:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 2.9533762057877815) internal successors, (1837), 622 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1837 transitions. [2022-03-15 19:53:05,094 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1837 transitions. Word has length 26 [2022-03-15 19:53:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:05,094 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 1837 transitions. [2022-03-15 19:53:05,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1837 transitions. [2022-03-15 19:53:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:05,095 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:05,095 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:05,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:05,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:05,303 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1156369500, now seen corresponding path program 70 times [2022-03-15 19:53:05,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:05,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053633209] [2022-03-15 19:53:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:06,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:06,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053633209] [2022-03-15 19:53:06,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053633209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:06,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031591607] [2022-03-15 19:53:06,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:53:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:06,226 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:06,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:53:06,408 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:53:06,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:06,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:53:06,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:06,861 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:53:06,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 29 [2022-03-15 19:53:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:53:06,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:07,713 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:53:07,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:53:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:09,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031591607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:09,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:09,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 38 [2022-03-15 19:53:09,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623166255] [2022-03-15 19:53:09,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:09,008 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:09,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2022-03-15 19:53:09,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:09,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [86263#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 86264#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:53:09,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:53:09,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:53:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:53:09,979 INFO L87 Difference]: Start difference. First operand 623 states and 1837 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:10,741 INFO L93 Difference]: Finished difference Result 863 states and 2454 transitions. [2022-03-15 19:53:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:53:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:10,743 INFO L225 Difference]: With dead ends: 863 [2022-03-15 19:53:10,743 INFO L226 Difference]: Without dead ends: 826 [2022-03-15 19:53:10,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=288, Invalid=2064, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:53:10,744 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:10,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 10 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-03-15 19:53:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 639. [2022-03-15 19:53:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 2.9670846394984327) internal successors, (1893), 638 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1893 transitions. [2022-03-15 19:53:10,756 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1893 transitions. Word has length 26 [2022-03-15 19:53:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:10,756 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 1893 transitions. [2022-03-15 19:53:10,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1893 transitions. [2022-03-15 19:53:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:10,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:10,758 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:10,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:10,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:10,982 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1468764412, now seen corresponding path program 71 times [2022-03-15 19:53:10,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:10,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23417278] [2022-03-15 19:53:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:11,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:11,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23417278] [2022-03-15 19:53:11,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23417278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:11,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900210228] [2022-03-15 19:53:11,945 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:53:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:11,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:11,946 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:53:12,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:53:12,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:12,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:53:12,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:12,544 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:53:12,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:53:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:53:12,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:13,390 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:53:13,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:53:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:14,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900210228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:14,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:14,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 36 [2022-03-15 19:53:14,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046075472] [2022-03-15 19:53:14,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:14,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:14,817 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 19:53:14,817 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:15,757 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [88608#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (< (* ~n~0 4) (+ 16 (* ~back~0 4))))), 88609#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (< (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))))] [2022-03-15 19:53:15,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:53:15,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:53:15,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1358, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:53:15,758 INFO L87 Difference]: Start difference. First operand 639 states and 1893 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:17,098 INFO L93 Difference]: Finished difference Result 1257 states and 3556 transitions. [2022-03-15 19:53:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:53:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:17,101 INFO L225 Difference]: With dead ends: 1257 [2022-03-15 19:53:17,101 INFO L226 Difference]: Without dead ends: 1194 [2022-03-15 19:53:17,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=316, Invalid=2440, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:53:17,102 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:17,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 10 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:53:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-03-15 19:53:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 765. [2022-03-15 19:53:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 3.0837696335078535) internal successors, (2356), 764 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2356 transitions. [2022-03-15 19:53:17,117 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2356 transitions. Word has length 26 [2022-03-15 19:53:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:17,117 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 2356 transitions. [2022-03-15 19:53:17,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2356 transitions. [2022-03-15 19:53:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:17,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:17,118 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:17,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-15 19:53:17,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:17,342 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash 462020284, now seen corresponding path program 72 times [2022-03-15 19:53:17,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:17,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119330384] [2022-03-15 19:53:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:19,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:19,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119330384] [2022-03-15 19:53:19,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119330384] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:19,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491724358] [2022-03-15 19:53:19,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:53:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:19,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:19,015 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:19,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:53:19,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:53:19,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:19,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:53:19,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:19,900 INFO L353 Elim1Store]: treesize reduction 174, result has 1.7 percent of original size [2022-03-15 19:53:19,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 27 [2022-03-15 19:53:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:53:19,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:21,576 INFO L353 Elim1Store]: treesize reduction 342, result has 28.3 percent of original size [2022-03-15 19:53:21,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 326 treesize of output 308 [2022-03-15 19:53:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:22,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491724358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:22,602 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:22,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 9] total 36 [2022-03-15 19:53:22,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [846746978] [2022-03-15 19:53:22,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:22,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:22,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2022-03-15 19:53:22,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:24,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [91611#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (= ~front~0 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= 1 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (= ~front~0 0) (not (<= 0 ~back~0)) (= ~front~0 1)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)) (= ~front~0 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= 1 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1) (= ~front~0 0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)))), 91612#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (= ~front~0 0) (not (<= 0 ~back~0)) (= ~front~0 1)) (or (< ~back~0 0) (<= 1 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~front~0 0) (<= ~n~0 ~back~0)) (or (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~front~0 0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)) (= ~front~0 1)) (or (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1) (= ~front~0 0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= 1 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (= ~front~0 0) (not (<= 0 ~back~0))))] [2022-03-15 19:53:24,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:53:24,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:53:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:53:24,269 INFO L87 Difference]: Start difference. First operand 765 states and 2356 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:25,752 INFO L93 Difference]: Finished difference Result 914 states and 2739 transitions. [2022-03-15 19:53:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:53:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:25,755 INFO L225 Difference]: With dead ends: 914 [2022-03-15 19:53:25,755 INFO L226 Difference]: Without dead ends: 899 [2022-03-15 19:53:25,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=438, Invalid=2424, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:53:25,756 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:25,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-03-15 19:53:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 767. [2022-03-15 19:53:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 3.0822454308093996) internal successors, (2361), 766 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2361 transitions. [2022-03-15 19:53:25,770 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2361 transitions. Word has length 26 [2022-03-15 19:53:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:25,770 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 2361 transitions. [2022-03-15 19:53:25,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2361 transitions. [2022-03-15 19:53:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:25,771 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:25,771 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:25,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:25,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-03-15 19:53:25,996 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1207813100, now seen corresponding path program 73 times [2022-03-15 19:53:25,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:25,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414930622] [2022-03-15 19:53:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:26,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:26,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414930622] [2022-03-15 19:53:26,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414930622] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:26,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360167482] [2022-03-15 19:53:26,942 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:53:26,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:26,944 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:26,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:53:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:27,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:53:27,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:27,819 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:53:27,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:53:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:27,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:29,008 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:53:29,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 334 treesize of output 318 [2022-03-15 19:53:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:30,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360167482] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:30,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:30,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 47 [2022-03-15 19:53:30,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407256743] [2022-03-15 19:53:30,173 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:30,176 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:30,187 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 62 transitions. [2022-03-15 19:53:30,187 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:31,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [94288#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4)))), 94289#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:53:31,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:53:31,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:53:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2058, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:53:31,470 INFO L87 Difference]: Start difference. First operand 767 states and 2361 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:32,289 INFO L93 Difference]: Finished difference Result 888 states and 2666 transitions. [2022-03-15 19:53:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:53:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:32,292 INFO L225 Difference]: With dead ends: 888 [2022-03-15 19:53:32,292 INFO L226 Difference]: Without dead ends: 875 [2022-03-15 19:53:32,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=656, Invalid=3004, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:53:32,293 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:32,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:53:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-03-15 19:53:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 773. [2022-03-15 19:53:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 3.0725388601036268) internal successors, (2372), 772 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 2372 transitions. [2022-03-15 19:53:32,307 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 2372 transitions. Word has length 26 [2022-03-15 19:53:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:32,307 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 2372 transitions. [2022-03-15 19:53:32,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 2372 transitions. [2022-03-15 19:53:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:32,308 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:32,309 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:32,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:32,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:32,523 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1972833424, now seen corresponding path program 74 times [2022-03-15 19:53:32,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:32,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117279856] [2022-03-15 19:53:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:34,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:34,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117279856] [2022-03-15 19:53:34,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117279856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:34,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356281170] [2022-03-15 19:53:34,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:53:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:34,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:34,204 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:53:34,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:53:34,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:34,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:53:34,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:34,796 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:53:34,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:53:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:53:34,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:35,282 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:53:35,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:53:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:53:36,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356281170] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:36,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:36,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 8] total 37 [2022-03-15 19:53:36,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781626233] [2022-03-15 19:53:36,048 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:36,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:36,061 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 68 transitions. [2022-03-15 19:53:36,061 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:38,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [96934#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< 0 (+ ~front~0 1))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 96936#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 96935#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (< 0 (+ ~front~0 1)) (<= ~n~0 (+ ~back~0 2)))), 96933#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:53:38,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:53:38,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:53:38,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1620, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:53:38,272 INFO L87 Difference]: Start difference. First operand 773 states and 2372 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:39,200 INFO L93 Difference]: Finished difference Result 1032 states and 3063 transitions. [2022-03-15 19:53:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:53:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:39,202 INFO L225 Difference]: With dead ends: 1032 [2022-03-15 19:53:39,202 INFO L226 Difference]: Without dead ends: 1015 [2022-03-15 19:53:39,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=294, Invalid=2568, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:53:39,203 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 93 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:39,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 13 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:53:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-03-15 19:53:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 785. [2022-03-15 19:53:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 3.052295918367347) internal successors, (2393), 784 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2393 transitions. [2022-03-15 19:53:39,232 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2393 transitions. Word has length 26 [2022-03-15 19:53:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:39,233 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 2393 transitions. [2022-03-15 19:53:39,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2393 transitions. [2022-03-15 19:53:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:39,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:39,234 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:39,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:39,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:39,434 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1004618202, now seen corresponding path program 75 times [2022-03-15 19:53:39,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:39,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38408982] [2022-03-15 19:53:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:40,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:40,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38408982] [2022-03-15 19:53:40,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38408982] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:40,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016504839] [2022-03-15 19:53:40,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:53:40,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:40,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:40,600 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:40,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:53:41,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:53:41,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:41,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:53:41,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:41,331 INFO L353 Elim1Store]: treesize reduction 103, result has 2.8 percent of original size [2022-03-15 19:53:41,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 21 [2022-03-15 19:53:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:53:41,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:42,295 INFO L353 Elim1Store]: treesize reduction 172, result has 31.5 percent of original size [2022-03-15 19:53:42,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 278 treesize of output 240 [2022-03-15 19:53:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:53:43,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016504839] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:43,087 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:43,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 32 [2022-03-15 19:53:43,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953132888] [2022-03-15 19:53:43,087 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:43,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:43,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 63 transitions. [2022-03-15 19:53:43,103 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:44,219 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [99746#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 99745#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 99747#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:53:44,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:53:44,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:53:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:53:44,220 INFO L87 Difference]: Start difference. First operand 785 states and 2393 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:45,539 INFO L93 Difference]: Finished difference Result 1158 states and 3354 transitions. [2022-03-15 19:53:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:53:45,539 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:45,541 INFO L225 Difference]: With dead ends: 1158 [2022-03-15 19:53:45,541 INFO L226 Difference]: Without dead ends: 1119 [2022-03-15 19:53:45,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=507, Invalid=2355, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:53:45,542 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 85 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:45,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 7 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-03-15 19:53:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 799. [2022-03-15 19:53:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 3.06265664160401) internal successors, (2444), 798 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2444 transitions. [2022-03-15 19:53:45,552 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2444 transitions. Word has length 26 [2022-03-15 19:53:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:45,552 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 2444 transitions. [2022-03-15 19:53:45,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2444 transitions. [2022-03-15 19:53:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:45,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:45,553 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:45,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:45,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 19:53:45,754 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1620515710, now seen corresponding path program 76 times [2022-03-15 19:53:45,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:45,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041681864] [2022-03-15 19:53:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:47,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:47,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041681864] [2022-03-15 19:53:47,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041681864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:47,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714453971] [2022-03-15 19:53:47,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:53:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:47,578 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:47,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:53:47,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:53:47,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:47,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:53:47,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:48,168 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:53:48,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:53:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:53:48,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:48,748 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:53:48,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:53:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:53:49,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714453971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:49,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:49,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 8] total 35 [2022-03-15 19:53:49,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935791888] [2022-03-15 19:53:49,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:49,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:49,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 58 transitions. [2022-03-15 19:53:49,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:50,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [102726#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 102727#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 102725#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (+ (* ~back~0 4) 4)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:53:50,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:53:50,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:53:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1328, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:53:50,419 INFO L87 Difference]: Start difference. First operand 799 states and 2444 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:51,926 INFO L93 Difference]: Finished difference Result 1015 states and 2966 transitions. [2022-03-15 19:53:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:53:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:51,928 INFO L225 Difference]: With dead ends: 1015 [2022-03-15 19:53:51,928 INFO L226 Difference]: Without dead ends: 973 [2022-03-15 19:53:51,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=431, Invalid=2539, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:53:51,929 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 99 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:51,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 20 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:53:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-03-15 19:53:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 797. [2022-03-15 19:53:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 3.064070351758794) internal successors, (2439), 796 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2439 transitions. [2022-03-15 19:53:51,938 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 2439 transitions. Word has length 26 [2022-03-15 19:53:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:51,938 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 2439 transitions. [2022-03-15 19:53:51,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 2439 transitions. [2022-03-15 19:53:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:51,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:51,940 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:51,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:52,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-03-15 19:53:52,140 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1044214288, now seen corresponding path program 77 times [2022-03-15 19:53:52,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:52,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247156913] [2022-03-15 19:53:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:53,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:53,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247156913] [2022-03-15 19:53:53,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247156913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:53,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766713004] [2022-03-15 19:53:53,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:53:53,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:53,424 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:53:53,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:53:53,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:53,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:53:53,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:54,081 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:53:54,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-03-15 19:53:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:53:54,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:54,622 INFO L353 Elim1Store]: treesize reduction 135, result has 47.3 percent of original size [2022-03-15 19:53:54,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 272 [2022-03-15 19:53:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:53:55,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766713004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:55,446 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:55,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 8] total 34 [2022-03-15 19:53:55,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595254417] [2022-03-15 19:53:55,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:55,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:55,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 63 transitions. [2022-03-15 19:53:55,459 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:56,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [105554#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 15) (<= (* ~n~0 4) 28) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 15) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 17 (+ (* ~front~0 4) ~queue~0.offset)) (not (<= 0 ~back~0)) (= 16 (+ ~queue~0.offset (* ~back~0 4)))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (< 3 ~front~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 105553#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 15) (<= (* ~n~0 4) 28) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 3 ~front~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 15) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 17 (+ (* ~front~0 4) ~queue~0.offset)) (not (<= 0 ~back~0)) (= 16 (+ ~queue~0.offset (* ~back~0 4)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:53:56,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:53:56,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:53:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:53:56,584 INFO L87 Difference]: Start difference. First operand 797 states and 2439 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:57,505 INFO L93 Difference]: Finished difference Result 1026 states and 3042 transitions. [2022-03-15 19:53:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:53:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:53:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:57,507 INFO L225 Difference]: With dead ends: 1026 [2022-03-15 19:53:57,507 INFO L226 Difference]: Without dead ends: 1011 [2022-03-15 19:53:57,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:53:57,508 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:57,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-03-15 19:53:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 801. [2022-03-15 19:53:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 3.05875) internal successors, (2447), 800 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 2447 transitions. [2022-03-15 19:53:57,518 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 2447 transitions. Word has length 26 [2022-03-15 19:53:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:57,518 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 2447 transitions. [2022-03-15 19:53:57,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 2447 transitions. [2022-03-15 19:53:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:53:57,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:57,519 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:57,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-03-15 19:53:57,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:57,720 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1580919624, now seen corresponding path program 78 times [2022-03-15 19:53:57,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:57,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290861379] [2022-03-15 19:53:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:59,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:59,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290861379] [2022-03-15 19:53:59,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290861379] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:59,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053847745] [2022-03-15 19:53:59,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:53:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:59,312 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:59,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:53:59,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:53:59,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:59,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:53:59,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:00,131 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:54:00,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 21 [2022-03-15 19:54:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:54:00,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:00,775 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:54:00,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 240 [2022-03-15 19:54:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:54:01,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053847745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:01,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:01,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 8] total 38 [2022-03-15 19:54:01,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622637131] [2022-03-15 19:54:01,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:01,395 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:01,405 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 58 transitions. [2022-03-15 19:54:01,405 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:02,566 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [108396#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= ~front~0 2) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (<= ~front~0 3) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 28)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= 2 ~front~0)) (not (<= 0 ~back~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 12)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0)))), 108395#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 3) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 28)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 2) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (+ (* ~front~0 4) 4) (+ (* ~back~0 4) 4))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (= 2 ~front~0)) (not (<= 0 ~back~0)) (= (+ ~queue~0.offset (* ~back~0 4) 4) 12)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~front~0 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))))] [2022-03-15 19:54:02,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:54:02,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:54:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:54:02,566 INFO L87 Difference]: Start difference. First operand 801 states and 2447 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:03,703 INFO L93 Difference]: Finished difference Result 968 states and 2887 transitions. [2022-03-15 19:54:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:54:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:54:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:03,705 INFO L225 Difference]: With dead ends: 968 [2022-03-15 19:54:03,705 INFO L226 Difference]: Without dead ends: 955 [2022-03-15 19:54:03,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:54:03,705 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:03,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 20 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:54:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-03-15 19:54:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 799. [2022-03-15 19:54:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 3.0601503759398496) internal successors, (2442), 798 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2442 transitions. [2022-03-15 19:54:03,715 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2442 transitions. Word has length 26 [2022-03-15 19:54:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:03,715 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 2442 transitions. [2022-03-15 19:54:03,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2442 transitions. [2022-03-15 19:54:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:03,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:03,716 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:03,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:03,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:03,917 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -462151504, now seen corresponding path program 79 times [2022-03-15 19:54:03,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:03,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941248917] [2022-03-15 19:54:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:54:04,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:04,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941248917] [2022-03-15 19:54:04,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941248917] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:04,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665509365] [2022-03-15 19:54:04,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:54:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:04,023 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:04,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:54:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:04,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:54:04,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:54:04,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:54:04,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665509365] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:04,703 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:04,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-03-15 19:54:04,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958392228] [2022-03-15 19:54:04,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:04,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:04,724 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 72 transitions. [2022-03-15 19:54:04,724 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:04,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:54:04,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:54:05,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:54:05,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:54:05,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:54:05,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:54:05,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [111178#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2))), 111179#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3))), 111180#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 4)))] [2022-03-15 19:54:05,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:54:05,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:54:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:54:05,178 INFO L87 Difference]: Start difference. First operand 799 states and 2442 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:05,355 INFO L93 Difference]: Finished difference Result 497 states and 1376 transitions. [2022-03-15 19:54:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:54:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:54:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:05,356 INFO L225 Difference]: With dead ends: 497 [2022-03-15 19:54:05,356 INFO L226 Difference]: Without dead ends: 446 [2022-03-15 19:54:05,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:54:05,357 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:05,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:54:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-03-15 19:54:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2022-03-15 19:54:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.9258426966292137) internal successors, (1302), 445 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1302 transitions. [2022-03-15 19:54:05,363 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1302 transitions. Word has length 27 [2022-03-15 19:54:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:05,363 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1302 transitions. [2022-03-15 19:54:05,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1302 transitions. [2022-03-15 19:54:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:05,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:05,364 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:05,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-03-15 19:54:05,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-03-15 19:54:05,564 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 270000946, now seen corresponding path program 80 times [2022-03-15 19:54:05,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:05,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621418181] [2022-03-15 19:54:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:06,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:06,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621418181] [2022-03-15 19:54:06,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621418181] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:06,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383482125] [2022-03-15 19:54:06,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:06,939 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:06,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:54:07,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:07,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:07,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:54:07,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:07,620 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:54:07,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:54:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:54:07,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:08,385 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:54:08,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:54:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:09,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383482125] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:09,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:09,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 39 [2022-03-15 19:54:09,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379654292] [2022-03-15 19:54:09,879 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:09,882 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:09,895 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 78 transitions. [2022-03-15 19:54:09,896 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:13,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [112781#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)))), 112783#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 112779#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (<= 0 ~back~0)))), 112780#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 112782#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:54:13,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:54:13,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:54:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1811, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:54:13,262 INFO L87 Difference]: Start difference. First operand 446 states and 1302 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:13,931 INFO L93 Difference]: Finished difference Result 645 states and 1840 transitions. [2022-03-15 19:54:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:54:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 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 27 [2022-03-15 19:54:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:13,932 INFO L225 Difference]: With dead ends: 645 [2022-03-15 19:54:13,932 INFO L226 Difference]: Without dead ends: 626 [2022-03-15 19:54:13,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=319, Invalid=2231, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:54:13,933 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 67 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:13,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 12 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:54:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-03-15 19:54:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 454. [2022-03-15 19:54:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.922737306843267) internal successors, (1324), 453 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1324 transitions. [2022-03-15 19:54:13,939 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1324 transitions. Word has length 27 [2022-03-15 19:54:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:13,939 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 1324 transitions. [2022-03-15 19:54:13,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1324 transitions. [2022-03-15 19:54:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:13,940 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:13,940 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:13,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:14,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:14,141 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 219901756, now seen corresponding path program 81 times [2022-03-15 19:54:14,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:14,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003795978] [2022-03-15 19:54:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:15,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:15,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003795978] [2022-03-15 19:54:15,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003795978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:15,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318920560] [2022-03-15 19:54:15,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:54:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:15,689 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:15,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:54:16,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:54:16,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:16,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:54:16,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:16,685 INFO L353 Elim1Store]: treesize reduction 174, result has 1.7 percent of original size [2022-03-15 19:54:16,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 27 [2022-03-15 19:54:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:16,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:18,103 INFO L353 Elim1Store]: treesize reduction 342, result has 28.3 percent of original size [2022-03-15 19:54:18,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 326 treesize of output 308 [2022-03-15 19:54:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:19,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318920560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:19,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:19,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 35 [2022-03-15 19:54:19,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693840938] [2022-03-15 19:54:19,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:19,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:19,135 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 73 transitions. [2022-03-15 19:54:19,135 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:23,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [114541#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (< 4 (* ~front~0 4)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* (div (+ (* ~front~0 4) 4) 4) 4) 4))) 2)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< 4 (* ~front~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) 16)) 2) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ (* ~front~0 4) 4) 4) 4)) 1) 0) (< 4 (* ~front~0 4)))), 114543#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* (div (+ (* ~front~0 4) 4) 4) 4) 4))) 2) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ (* ~front~0 4) 4) 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 114540#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ (* ~front~0 4) 4) 4) 4)) 1) 0) (< 4 (* ~front~0 4)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< 4 (* ~front~0 4)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ 16 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) 12) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 8) (+ ~queue~0.offset (* ~back~0 4))) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) 16)) 2) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 4 (* ~front~0 4)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* (div (+ (* ~front~0 4) 4) 4) 4) 4))) 2) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (not (<= 0 ~back~0)))), 114542#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ (* ~front~0 4) 4) 4) 4)) 1) 0) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* (div (+ (* ~front~0 4) 4) 4) 4) 4))) 2) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= ~n~0 (+ ~back~0 2)) (< 4 (* ~front~0 4)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:54:23,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:54:23,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:54:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:54:23,611 INFO L87 Difference]: Start difference. First operand 454 states and 1324 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:24,209 INFO L93 Difference]: Finished difference Result 653 states and 1860 transitions. [2022-03-15 19:54:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:54:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:54:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:24,211 INFO L225 Difference]: With dead ends: 653 [2022-03-15 19:54:24,211 INFO L226 Difference]: Without dead ends: 636 [2022-03-15 19:54:24,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:54:24,211 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:24,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 13 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:54:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-03-15 19:54:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 456. [2022-03-15 19:54:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.9208791208791207) internal successors, (1329), 455 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1329 transitions. [2022-03-15 19:54:24,217 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1329 transitions. Word has length 27 [2022-03-15 19:54:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:24,217 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1329 transitions. [2022-03-15 19:54:24,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1329 transitions. [2022-03-15 19:54:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:24,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:24,218 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:24,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:24,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:24,419 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -5325596, now seen corresponding path program 82 times [2022-03-15 19:54:24,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:24,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956176187] [2022-03-15 19:54:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:25,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:25,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956176187] [2022-03-15 19:54:25,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956176187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:25,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825015204] [2022-03-15 19:54:25,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:54:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:25,881 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:25,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:54:26,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:54:26,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:26,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:54:26,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:26,698 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:54:26,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:54:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:54:26,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:27,613 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:54:27,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 322 treesize of output 306 [2022-03-15 19:54:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:28,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825015204] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:28,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:28,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:54:28,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528629729] [2022-03-15 19:54:28,378 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:28,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:28,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 68 transitions. [2022-03-15 19:54:28,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:31,175 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [116318#(and (or (< ~back~0 0) (< (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (< (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~back~0 4) (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 116316#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~back~0 4) (+ (* ~front~0 4) ~queue~0.offset 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 ~front~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 116317#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= (* ~back~0 4) (+ (* ~front~0 4) ~queue~0.offset)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ 16 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)))), 116315#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (<= 0 ~back~0)) (<= (* ~back~0 4) (+ (* ~front~0 4) ~queue~0.offset 8))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= (+ 2 ~front~0) ~back~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (- 1) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)))))] [2022-03-15 19:54:31,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:54:31,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:54:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1716, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:54:31,176 INFO L87 Difference]: Start difference. First operand 456 states and 1329 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:33,261 INFO L93 Difference]: Finished difference Result 785 states and 2173 transitions. [2022-03-15 19:54:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:54:33,261 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 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 27 [2022-03-15 19:54:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:33,262 INFO L225 Difference]: With dead ends: 785 [2022-03-15 19:54:33,262 INFO L226 Difference]: Without dead ends: 730 [2022-03-15 19:54:33,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=623, Invalid=3409, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:54:33,263 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 93 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:33,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 11 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:54:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-03-15 19:54:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 494. [2022-03-15 19:54:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.9411764705882355) internal successors, (1450), 493 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1450 transitions. [2022-03-15 19:54:33,269 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1450 transitions. Word has length 27 [2022-03-15 19:54:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:33,269 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1450 transitions. [2022-03-15 19:54:33,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1450 transitions. [2022-03-15 19:54:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:33,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:33,271 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:33,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:33,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-03-15 19:54:33,472 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1675158980, now seen corresponding path program 83 times [2022-03-15 19:54:33,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:33,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781542016] [2022-03-15 19:54:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:34,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:34,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781542016] [2022-03-15 19:54:34,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781542016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:34,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614622509] [2022-03-15 19:54:34,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:54:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:34,853 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:34,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:54:35,080 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:54:35,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:35,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:54:35,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:35,625 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:54:35,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:54:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:54:35,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:36,540 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:54:36,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:54:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:37,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614622509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:37,236 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:37,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 9] total 40 [2022-03-15 19:54:37,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357146784] [2022-03-15 19:54:37,236 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:37,239 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:37,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 63 transitions. [2022-03-15 19:54:37,252 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:38,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [118327#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ (* ~n~0 4) (* ~front~0 4) 1) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) (* ~back~0 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ (* ~n~0 4) (* ~front~0 4) 1) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0))), 118328#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) 3 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 118329#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) 3 (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 118326#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ (* ~n~0 4) 5 (* ~front~0 4)) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~n~0 4) 5 (* ~front~0 4)) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~n~0 4) 5 (* ~front~0 4)) (+ (* 4 (div (+ (* ~front~0 4) 15 ~queue~0.offset) 4)) (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 12) (+ (* ~back~0 4) 4)) (not (<= 0 ~back~0))))] [2022-03-15 19:54:38,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:54:38,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:54:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1731, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:54:38,634 INFO L87 Difference]: Start difference. First operand 494 states and 1450 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:39,522 INFO L93 Difference]: Finished difference Result 760 states and 2130 transitions. [2022-03-15 19:54:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:54:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:54:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:39,523 INFO L225 Difference]: With dead ends: 760 [2022-03-15 19:54:39,523 INFO L226 Difference]: Without dead ends: 724 [2022-03-15 19:54:39,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=457, Invalid=2405, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:54:39,524 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 85 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:39,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 7 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:54:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-03-15 19:54:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 488. [2022-03-15 19:54:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 2.921971252566735) internal successors, (1423), 487 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1423 transitions. [2022-03-15 19:54:39,533 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1423 transitions. Word has length 27 [2022-03-15 19:54:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:39,533 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 1423 transitions. [2022-03-15 19:54:39,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1423 transitions. [2022-03-15 19:54:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:39,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:39,535 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:39,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:39,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:39,747 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1007576910, now seen corresponding path program 84 times [2022-03-15 19:54:39,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:39,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579575373] [2022-03-15 19:54:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:41,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:41,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579575373] [2022-03-15 19:54:41,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579575373] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:41,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127922491] [2022-03-15 19:54:41,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:54:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:41,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:41,040 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:41,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:54:41,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:54:41,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:41,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:54:41,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:41,795 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:54:41,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:54:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:54:41,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:42,642 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:54:42,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:54:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:44,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127922491] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:44,247 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:44,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 9] total 41 [2022-03-15 19:54:44,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228992254] [2022-03-15 19:54:44,248 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:44,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:44,286 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 73 transitions. [2022-03-15 19:54:44,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:46,110 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [120283#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= (* ~n~0 4) (+ 16 (* ~back~0 4))) (= ~front~0 1)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 120281#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= 0 ~front~0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= ~front~0 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 12)) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (<= 0 ~back~0)))), 120282#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< (* ~n~0 4) (+ 16 (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= (* ~n~0 4) (+ 16 (* ~back~0 4))) (= ~front~0 1)))] [2022-03-15 19:54:46,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:54:46,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:54:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1848, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:54:46,111 INFO L87 Difference]: Start difference. First operand 488 states and 1423 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:46,853 INFO L93 Difference]: Finished difference Result 685 states and 1956 transitions. [2022-03-15 19:54:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:54:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 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 27 [2022-03-15 19:54:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:46,854 INFO L225 Difference]: With dead ends: 685 [2022-03-15 19:54:46,854 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 19:54:46,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=286, Invalid=2366, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:54:46,855 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:46,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:54:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 19:54:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 492. [2022-03-15 19:54:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.9185336048879837) internal successors, (1433), 491 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1433 transitions. [2022-03-15 19:54:46,862 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1433 transitions. Word has length 27 [2022-03-15 19:54:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:46,862 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1433 transitions. [2022-03-15 19:54:46,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1433 transitions. [2022-03-15 19:54:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:46,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:46,863 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:46,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-03-15 19:54:47,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:47,063 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1232804262, now seen corresponding path program 85 times [2022-03-15 19:54:47,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:47,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934668437] [2022-03-15 19:54:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:49,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:49,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934668437] [2022-03-15 19:54:49,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934668437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:49,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334749383] [2022-03-15 19:54:49,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:54:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:49,108 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:49,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:54:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:54:49,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:49,832 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:54:49,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:54:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:54:49,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:50,798 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:54:50,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:54:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:51,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334749383] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:51,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:51,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:54:51,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484059851] [2022-03-15 19:54:51,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:51,873 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:51,885 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 68 transitions. [2022-03-15 19:54:51,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:53,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [122163#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (+ (* ~back~0 4) 4)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))), 122164#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 122165#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:54:53,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:54:53,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:53,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:54:53,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:54:53,027 INFO L87 Difference]: Start difference. First operand 492 states and 1433 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:54,523 INFO L93 Difference]: Finished difference Result 971 states and 2620 transitions. [2022-03-15 19:54:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:54:54,523 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:54:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:54,525 INFO L225 Difference]: With dead ends: 971 [2022-03-15 19:54:54,525 INFO L226 Difference]: Without dead ends: 869 [2022-03-15 19:54:54,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=545, Invalid=3115, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:54:54,525 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 153 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:54,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 8 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:54:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-03-15 19:54:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 534. [2022-03-15 19:54:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.9380863039399623) internal successors, (1566), 533 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1566 transitions. [2022-03-15 19:54:54,533 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1566 transitions. Word has length 27 [2022-03-15 19:54:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:54,533 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1566 transitions. [2022-03-15 19:54:54,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1566 transitions. [2022-03-15 19:54:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:54:54,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:54,534 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:54,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:54,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-03-15 19:54:54,734 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1392329650, now seen corresponding path program 86 times [2022-03-15 19:54:54,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:54,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506300729] [2022-03-15 19:54:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:55,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:55,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506300729] [2022-03-15 19:54:55,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506300729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:55,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169866572] [2022-03-15 19:54:55,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:55,878 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:55,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:54:56,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:56,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:56,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:54:56,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:56,628 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:54:56,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:54:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:54:56,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:57,555 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:54:57,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:54:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:58,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169866572] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:58,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:58,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:54:58,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737932004] [2022-03-15 19:54:58,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:58,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:58,415 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 63 transitions. [2022-03-15 19:54:58,415 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:00,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [124437#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 124435#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (<= (* ~front~0 4) 4) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (< 0 (+ ~front~0 1)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (<= ~n~0 ~back~0))), 124436#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= (* ~n~0 4) (+ (* ~front~0 4) 15 ~queue~0.offset)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 16)) (<= (* ~front~0 4) 4) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:55:00,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:55:00,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:00,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:55:00,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1660, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:55:00,331 INFO L87 Difference]: Start difference. First operand 534 states and 1566 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:00,919 INFO L93 Difference]: Finished difference Result 713 states and 2030 transitions. [2022-03-15 19:55:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 27 [2022-03-15 19:55:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:00,921 INFO L225 Difference]: With dead ends: 713 [2022-03-15 19:55:00,921 INFO L226 Difference]: Without dead ends: 700 [2022-03-15 19:55:00,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:55:00,921 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:00,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 11 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:55:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-03-15 19:55:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 532. [2022-03-15 19:55:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 2.9397363465160073) internal successors, (1561), 531 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1561 transitions. [2022-03-15 19:55:00,928 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1561 transitions. Word has length 27 [2022-03-15 19:55:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:00,928 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 1561 transitions. [2022-03-15 19:55:00,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1561 transitions. [2022-03-15 19:55:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:00,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:00,929 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:00,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-03-15 19:55:01,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:01,130 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 385585522, now seen corresponding path program 87 times [2022-03-15 19:55:01,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:01,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295772557] [2022-03-15 19:55:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:02,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:02,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295772557] [2022-03-15 19:55:02,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295772557] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:02,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952303452] [2022-03-15 19:55:02,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:55:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:02,528 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:02,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:55:02,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:55:02,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:02,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:55:02,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:03,395 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:55:03,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:55:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:55:03,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:04,240 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:55:04,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 [2022-03-15 19:55:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:55:05,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952303452] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:05,591 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:05,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:55:05,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924923436] [2022-03-15 19:55:05,591 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:05,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:05,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 68 transitions. [2022-03-15 19:55:05,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:06,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [126424#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24)))), 126425#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (* ~front~0 4) (* ~back~0 4)))), 126423#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (= (+ (* ~front~0 4) 8) (+ (* ~back~0 4) 4)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (<= 0 ~front~0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (<= ~front~0 1) (<= ~n~0 ~back~0)))] [2022-03-15 19:55:06,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:55:06,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:55:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:55:06,961 INFO L87 Difference]: Start difference. First operand 532 states and 1561 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:08,189 INFO L93 Difference]: Finished difference Result 751 states and 2140 transitions. [2022-03-15 19:55:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:08,189 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:55:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:08,190 INFO L225 Difference]: With dead ends: 751 [2022-03-15 19:55:08,190 INFO L226 Difference]: Without dead ends: 732 [2022-03-15 19:55:08,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=374, Invalid=3286, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:55:08,191 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:08,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 12 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-03-15 19:55:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 536. [2022-03-15 19:55:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 2.932710280373832) internal successors, (1569), 535 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1569 transitions. [2022-03-15 19:55:08,213 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1569 transitions. Word has length 27 [2022-03-15 19:55:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:08,213 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 1569 transitions. [2022-03-15 19:55:08,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1569 transitions. [2022-03-15 19:55:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:08,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:08,214 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:08,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:08,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:08,415 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1284247862, now seen corresponding path program 88 times [2022-03-15 19:55:08,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:08,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653405726] [2022-03-15 19:55:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:10,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:10,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653405726] [2022-03-15 19:55:10,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653405726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:10,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511345629] [2022-03-15 19:55:10,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:55:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:10,220 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:10,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:55:10,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:55:10,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:10,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:55:10,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:10,984 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:55:10,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:55:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:55:11,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:11,935 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:55:11,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:55:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:55:12,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511345629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:12,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:12,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:55:12,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53154494] [2022-03-15 19:55:12,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:12,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:12,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 63 transitions. [2022-03-15 19:55:12,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:14,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [128479#(and (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (= 2 ~front~0) (<= ~front~0 0) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (not (= 2 ~front~0)) (= 12 (+ ~queue~0.offset (* ~back~0 4))) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (< 0 (+ ~front~0 1)) (<= ~n~0 ~back~0)) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (< ~back~0 ~n~0)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~front~0 1) ~back~0)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 20)) (not (= 2 ~front~0)))), 128481#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 2 ~front~0) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 128480#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 0 (+ ~front~0 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (= 4 (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= 2 ~front~0) (<= ~front~0 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~n~0 (+ ~back~0 1)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:55:14,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:55:14,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:55:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:55:14,962 INFO L87 Difference]: Start difference. First operand 536 states and 1569 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:15,573 INFO L93 Difference]: Finished difference Result 711 states and 2023 transitions. [2022-03-15 19:55:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 27 [2022-03-15 19:55:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:15,574 INFO L225 Difference]: With dead ends: 711 [2022-03-15 19:55:15,574 INFO L226 Difference]: Without dead ends: 698 [2022-03-15 19:55:15,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=403, Invalid=2047, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:55:15,575 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:15,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-03-15 19:55:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 530. [2022-03-15 19:55:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.941398865784499) internal successors, (1556), 529 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1556 transitions. [2022-03-15 19:55:15,582 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1556 transitions. Word has length 27 [2022-03-15 19:55:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:15,582 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1556 transitions. [2022-03-15 19:55:15,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1556 transitions. [2022-03-15 19:55:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:15,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:15,583 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:15,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-03-15 19:55:15,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:15,784 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -404709892, now seen corresponding path program 89 times [2022-03-15 19:55:15,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:15,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381535638] [2022-03-15 19:55:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:17,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:17,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381535638] [2022-03-15 19:55:17,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381535638] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:17,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872781923] [2022-03-15 19:55:17,675 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:55:17,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:17,676 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:17,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:55:17,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:55:17,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:17,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:55:17,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:18,354 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:55:18,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 27 [2022-03-15 19:55:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:55:18,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:19,298 INFO L353 Elim1Store]: treesize reduction 309, result has 36.2 percent of original size [2022-03-15 19:55:19,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 328 treesize of output 348 [2022-03-15 19:55:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:55:20,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872781923] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:20,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:20,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 38 [2022-03-15 19:55:20,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722536717] [2022-03-15 19:55:20,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:20,480 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:20,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 73 transitions. [2022-03-15 19:55:20,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:21,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [130459#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 20)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4)))), 130460#(and (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (<= ~front~0 1) (not (<= 0 ~back~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= ~front~0 1)) (<= (* ~n~0 4) (+ (* ~front~0 4) 20)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:55:21,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:55:21,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:55:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:55:21,947 INFO L87 Difference]: Start difference. First operand 530 states and 1556 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:22,393 INFO L93 Difference]: Finished difference Result 725 states and 2084 transitions. [2022-03-15 19:55:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:55:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:22,395 INFO L225 Difference]: With dead ends: 725 [2022-03-15 19:55:22,395 INFO L226 Difference]: Without dead ends: 708 [2022-03-15 19:55:22,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:55:22,395 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:22,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 8 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-03-15 19:55:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 532. [2022-03-15 19:55:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 2.9397363465160073) internal successors, (1561), 531 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1561 transitions. [2022-03-15 19:55:22,402 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1561 transitions. Word has length 27 [2022-03-15 19:55:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:22,402 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 1561 transitions. [2022-03-15 19:55:22,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1561 transitions. [2022-03-15 19:55:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:22,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:22,403 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:22,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:22,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2022-03-15 19:55:22,604 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -629937244, now seen corresponding path program 90 times [2022-03-15 19:55:22,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:22,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047404436] [2022-03-15 19:55:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:25,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:25,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047404436] [2022-03-15 19:55:25,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047404436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:25,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261426233] [2022-03-15 19:55:25,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:55:25,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:25,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:25,392 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:25,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:55:25,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:55:25,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:25,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:55:25,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:26,185 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:55:26,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:55:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:55:26,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:27,164 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:55:27,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 308 [2022-03-15 19:55:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:55:28,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261426233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:28,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:28,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 9] total 39 [2022-03-15 19:55:28,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924411875] [2022-03-15 19:55:28,197 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:28,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:28,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 68 transitions. [2022-03-15 19:55:28,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:29,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [132456#(and (or (< ~back~0 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4)))), 132455#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (* ~n~0 4) (+ 16 (* ~back~0 4)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:55:29,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:55:29,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:55:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:55:29,385 INFO L87 Difference]: Start difference. First operand 532 states and 1561 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:30,038 INFO L93 Difference]: Finished difference Result 705 states and 2024 transitions. [2022-03-15 19:55:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:30,038 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 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 27 [2022-03-15 19:55:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:30,039 INFO L225 Difference]: With dead ends: 705 [2022-03-15 19:55:30,039 INFO L226 Difference]: Without dead ends: 690 [2022-03-15 19:55:30,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=380, Invalid=1876, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:55:30,039 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:30,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 10 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-03-15 19:55:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 534. [2022-03-15 19:55:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.9380863039399623) internal successors, (1566), 533 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1566 transitions. [2022-03-15 19:55:30,046 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1566 transitions. Word has length 27 [2022-03-15 19:55:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:30,046 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1566 transitions. [2022-03-15 19:55:30,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1566 transitions. [2022-03-15 19:55:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:30,047 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:30,047 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:30,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-03-15 19:55:30,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:30,248 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1995196668, now seen corresponding path program 91 times [2022-03-15 19:55:30,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:30,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140850883] [2022-03-15 19:55:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:32,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:32,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140850883] [2022-03-15 19:55:32,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140850883] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:32,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632661867] [2022-03-15 19:55:32,245 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:55:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:32,247 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:32,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:55:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:32,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:55:32,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:33,103 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:55:33,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 24 [2022-03-15 19:55:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:55:33,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:34,169 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:55:34,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 302 [2022-03-15 19:55:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:55:35,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632661867] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:35,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:35,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 40 [2022-03-15 19:55:35,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750058929] [2022-03-15 19:55:35,156 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:35,159 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:35,171 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 63 transitions. [2022-03-15 19:55:35,171 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:37,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [134438#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (= ~sum~0 0) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= ~front~0 2) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4)))), 134439#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 2 ~front~0)) (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 24))) (or (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (<= ~front~0 2) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= ~queue~0.offset 0) (not (<= 0 ~back~0))) (or (< ~back~0 0) (<= (* ~n~0 4) (+ 15 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))))] [2022-03-15 19:55:37,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:55:37,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:37,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:55:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1580, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:55:37,793 INFO L87 Difference]: Start difference. First operand 534 states and 1566 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:38,308 INFO L93 Difference]: Finished difference Result 677 states and 1940 transitions. [2022-03-15 19:55:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:55:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 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 27 [2022-03-15 19:55:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:38,309 INFO L225 Difference]: With dead ends: 677 [2022-03-15 19:55:38,309 INFO L226 Difference]: Without dead ends: 664 [2022-03-15 19:55:38,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:55:38,310 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:38,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 10 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-03-15 19:55:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 532. [2022-03-15 19:55:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 2.9397363465160073) internal successors, (1561), 531 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1561 transitions. [2022-03-15 19:55:38,319 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1561 transitions. Word has length 27 [2022-03-15 19:55:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:38,319 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 1561 transitions. [2022-03-15 19:55:38,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1561 transitions. [2022-03-15 19:55:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:55:38,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:38,320 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:38,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:38,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:38,535 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 988452540, now seen corresponding path program 92 times [2022-03-15 19:55:38,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:38,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606882894] [2022-03-15 19:55:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:40,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:40,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606882894] [2022-03-15 19:55:40,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606882894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:40,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735647053] [2022-03-15 19:55:40,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:55:40,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:40,084 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:40,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:55:40,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:55:40,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:40,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:55:40,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:40,848 INFO L353 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-03-15 19:55:40,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 24 [2022-03-15 19:55:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:55:40,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:41,727 INFO L353 Elim1Store]: treesize reduction 267, result has 44.8 percent of original size [2022-03-15 19:55:41,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 380 Received shutdown request... [2022-03-15 19:55:42,037 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:42,037 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:55:42,039 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:55:42,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:42,075 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-15 19:55:42,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:42,240 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. [2022-03-15 19:55:42,241 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:55:42,241 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:55:42,242 INFO L732 BasicCegarLoop]: Path program histogram: [92, 1, 1, 1] [2022-03-15 19:55:42,244 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:55:42,244 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:55:42,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:55:42 BasicIcfg [2022-03-15 19:55:42,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:55:42,245 INFO L158 Benchmark]: Toolchain (without parser) took 714886.14ms. Allocated memory was 200.3MB in the beginning and 868.2MB in the end (delta: 667.9MB). Free memory was 152.7MB in the beginning and 407.9MB in the end (delta: -255.2MB). Peak memory consumption was 413.7MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 200.3MB. Free memory was 169.4MB in the beginning and 169.4MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.06ms. Allocated memory is still 200.3MB. Free memory was 152.6MB in the beginning and 177.9MB in the end (delta: -25.3MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 175.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: Boogie Preprocessor took 43.75ms. Allocated memory is still 200.3MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: RCFGBuilder took 537.36ms. Allocated memory is still 200.3MB. Free memory was 174.2MB in the beginning and 155.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,245 INFO L158 Benchmark]: TraceAbstraction took 713887.86ms. Allocated memory was 200.3MB in the beginning and 868.2MB in the end (delta: 667.9MB). Free memory was 155.4MB in the beginning and 407.9MB in the end (delta: -252.6MB). Peak memory consumption was 414.9MB. Max. memory is 8.0GB. [2022-03-15 19:55:42,246 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.13ms. Allocated memory is still 200.3MB. Free memory was 169.4MB in the beginning and 169.4MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.06ms. Allocated memory is still 200.3MB. Free memory was 152.6MB in the beginning and 177.9MB in the end (delta: -25.3MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 200.3MB. Free memory was 177.9MB in the beginning and 175.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.75ms. Allocated memory is still 200.3MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.36ms. Allocated memory is still 200.3MB. Free memory was 174.2MB in the beginning and 155.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 713887.86ms. Allocated memory was 200.3MB in the beginning and 868.2MB in the end (delta: 667.9MB). Free memory was 155.4MB in the beginning and 407.9MB in the end (delta: -252.6MB). Peak memory consumption was 414.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 129 PlacesBefore, 23 PlacesAfterwards, 133 TransitionsBefore, 19 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 7 FixpointIterations, 83 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 11 ConcurrentYvCompositions, 8 ChoiceCompositions, 134 TotalNumberOfCompositions, 792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 772, positive: 756, positive conditional: 0, positive unconditional: 756, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 442, positive: 437, positive conditional: 0, positive unconditional: 437, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 772, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 442, unknown conditional: 0, unknown unconditional: 442] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 150 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 713.7s, OverallIterations: 95, TraceHistogramMax: 8, PathProgramHistogramMax: 92, EmptinessCheckTime: 0.1s, AutomataDifference: 85.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6222 SdHoareTripleChecker+Valid, 29.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6222 mSDsluCounter, 864 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15494 mSDsCounter, 2226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44718 IncrementalHoareTripleChecker+Invalid, 46944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2226 mSolverCounterUnsat, 100 mSDtfsCounter, 44718 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7990 GetRequests, 3436 SyntacticMatches, 373 SemanticMatches, 4181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51884 ImplicationChecksByTransitivity, 172.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=80, InterpolantAutomatonStates: 1802, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 94 MinimizatonAttempts, 12252 StatesRemovedByMinimization, 87 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 9.9s SatisfiabilityAnalysisTime, 443.7s InterpolantComputationTime, 4420 NumberOfCodeBlocks, 4404 NumberOfCodeBlocksAsserted, 328 NumberOfCheckSat, 6333 ConstructedInterpolants, 152 QuantifiedInterpolants, 230034 SizeOfPredicates, 2080 NumberOfNonLiveVariables, 20929 ConjunctsInSsa, 3590 ConjunctsInUnsatCore, 276 InterpolantComputations, 3 PerfectInterpolantSequences, 1753/7758 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