/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-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:36:56,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:36:56,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:36:56,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:36:56,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:36:56,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:36:56,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:36:56,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:36:56,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:36:56,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:36:56,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:36:56,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:36:56,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:36:56,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:36:56,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:36:56,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:36:56,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:36:56,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:36:56,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:36:56,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:36:56,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:36:56,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:36:56,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:36:56,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:36:57,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:36:57,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:36:57,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:36:57,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:36:57,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:36:57,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:36:57,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:36:57,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:36:57,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:36:57,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:36:57,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:36:57,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:36:57,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:36:57,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:36:57,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:36:57,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:36:57,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:36:57,008 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:36:57,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:36:57,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:36:57,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:36:57,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:36:57,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:36:57,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:36:57,031 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:36:57,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:36:57,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:36:57,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:36:57,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:36:57,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:36:57,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:36:57,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:36:57,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:36:57,034 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:36:57,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:36:57,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:36:57,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:36:57,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:36:57,248 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:36:57,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-15 19:36:57,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2933d8801/fbd3976fe4e1460aa11c12956d119c62/FLAG22cc5300d [2022-03-15 19:36:57,609 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:36:57,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-03-15 19:36:57,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2933d8801/fbd3976fe4e1460aa11c12956d119c62/FLAG22cc5300d [2022-03-15 19:36:57,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2933d8801/fbd3976fe4e1460aa11c12956d119c62 [2022-03-15 19:36:57,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:36:57,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:36:57,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:36:57,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:36:57,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:36:57,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b047c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57, skipping insertion in model container [2022-03-15 19:36:57,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:36:57,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:36:57,847 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-prod-cons.wvr.c[3056,3069] [2022-03-15 19:36:57,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:36:57,864 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:36:57,896 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-prod-cons.wvr.c[3056,3069] [2022-03-15 19:36:57,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:36:57,912 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:36:57,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57 WrapperNode [2022-03-15 19:36:57,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:36:57,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:36:57,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:36:57,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:36:57,919 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:36:57" (1/1) ... [2022-03-15 19:36:57,935 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:36:57" (1/1) ... [2022-03-15 19:36:57,957 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-03-15 19:36:57,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:36:57,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:36:57,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:36:57,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:36:57,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:57,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:36:57,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:36:57,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:36:57,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:36:57,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (1/1) ... [2022-03-15 19:36:58,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:36:58,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:58,019 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:36:58,034 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:36:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:36:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:36:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:36:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:36:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:36:58,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:36:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:36:58,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:36:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:36:58,064 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:36:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:36:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:36:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:36:58,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:36:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:36:58,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:36:58,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:36:58,066 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:36:58,157 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:36:58,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:36:58,340 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:36:58,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:36:58,411 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:36:58,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:36:58 BoogieIcfgContainer [2022-03-15 19:36:58,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:36:58,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:36:58,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:36:58,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:36:58,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:36:57" (1/3) ... [2022-03-15 19:36:58,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256f3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:36:58, skipping insertion in model container [2022-03-15 19:36:58,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:36:57" (2/3) ... [2022-03-15 19:36:58,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256f3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:36:58, skipping insertion in model container [2022-03-15 19:36:58,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:36:58" (3/3) ... [2022-03-15 19:36:58,422 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-03-15 19:36:58,426 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:36:58,426 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:36:58,426 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:36:58,426 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:36:58,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,483 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:36:58,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,483 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:36:58,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,485 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:36:58,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,485 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:36:58,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,490 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,491 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,491 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,492 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,492 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,492 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,492 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,492 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,500 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,500 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 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:36:58,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,502 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:36:58,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:36:58,515 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:36:58,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:36:58,557 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:36:58,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:36:58,570 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:36:58,576 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 156 transitions, 336 flow [2022-03-15 19:36:58,583 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 156 transitions, 336 flow [2022-03-15 19:36:58,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 156 transitions, 336 flow [2022-03-15 19:36:58,656 INFO L129 PetriNetUnfolder]: 11/153 cut-off events. [2022-03-15 19:36:58,656 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:36:58,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 11/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 122. Up to 3 conditions per place. [2022-03-15 19:36:58,662 INFO L116 LiptonReduction]: Number of co-enabled transitions 1082 [2022-03-15 19:37:02,852 INFO L131 LiptonReduction]: Checked pairs total: 2133 [2022-03-15 19:37:02,852 INFO L133 LiptonReduction]: Total number of compositions: 151 [2022-03-15 19:37:02,859 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 19:37:02,895 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:37:02,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:02,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:02,907 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1707642403, now seen corresponding path program 1 times [2022-03-15 19:37:02,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:02,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710560022] [2022-03-15 19:37:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:02,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:03,092 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:37:03,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:03,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710560022] [2022-03-15 19:37:03,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710560022] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:37:03,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:37:03,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:37:03,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372034517] [2022-03-15 19:37:03,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:03,099 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:03,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 124 transitions. [2022-03-15 19:37:03,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:03,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [477#(not (= (mod ~v_assert~0 256) 0)), 476#(not (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))] [2022-03-15 19:37:03,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:37:03,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:37:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:37:03,551 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 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 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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:37:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:03,659 INFO L93 Difference]: Finished difference Result 167 states and 448 transitions. [2022-03-15 19:37:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:37:03,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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 19 [2022-03-15 19:37:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:03,666 INFO L225 Difference]: With dead ends: 167 [2022-03-15 19:37:03,666 INFO L226 Difference]: Without dead ends: 167 [2022-03-15 19:37:03,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:37:03,669 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:03,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 10 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:37:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-03-15 19:37:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2022-03-15 19:37:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.73972602739726) internal successors, (400), 146 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 400 transitions. [2022-03-15 19:37:03,698 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 400 transitions. Word has length 19 [2022-03-15 19:37:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:03,699 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 400 transitions. [2022-03-15 19:37:03,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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:37:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 400 transitions. [2022-03-15 19:37:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:37:03,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:03,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:03,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:37:03,701 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1096383061, now seen corresponding path program 2 times [2022-03-15 19:37:03,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:03,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245521821] [2022-03-15 19:37:03,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:03,818 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:37:03,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:03,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245521821] [2022-03-15 19:37:03,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245521821] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:37:03,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:37:03,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:37:03,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338265572] [2022-03-15 19:37:03,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:03,820 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:03,825 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 57 transitions. [2022-03-15 19:37:03,825 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:04,042 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:04,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:37:04,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:37:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:37:04,044 INFO L87 Difference]: Start difference. First operand 147 states and 400 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:04,171 INFO L93 Difference]: Finished difference Result 263 states and 708 transitions. [2022-03-15 19:37:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:37:04,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:37:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:04,174 INFO L225 Difference]: With dead ends: 263 [2022-03-15 19:37:04,175 INFO L226 Difference]: Without dead ends: 193 [2022-03-15 19:37:04,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:37:04,176 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:04,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 3 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:37:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-03-15 19:37:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2022-03-15 19:37:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.686046511627907) internal successors, (462), 172 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 462 transitions. [2022-03-15 19:37:04,201 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 462 transitions. Word has length 19 [2022-03-15 19:37:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:04,201 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 462 transitions. [2022-03-15 19:37:04,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 462 transitions. [2022-03-15 19:37:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:37:04,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:04,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:04,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:37:04,203 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1602847474, now seen corresponding path program 1 times [2022-03-15 19:37:04,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:04,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340294419] [2022-03-15 19:37:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:04,310 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:37:04,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:04,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340294419] [2022-03-15 19:37:04,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340294419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:37:04,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:37:04,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:37:04,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502322075] [2022-03-15 19:37:04,315 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:04,319 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:04,333 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 140 transitions. [2022-03-15 19:37:04,333 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:05,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:05,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:37:05,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:05,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:37:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:37:05,020 INFO L87 Difference]: Start difference. First operand 173 states and 462 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:37:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:05,056 INFO L93 Difference]: Finished difference Result 181 states and 455 transitions. [2022-03-15 19:37:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:37:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:37:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:05,058 INFO L225 Difference]: With dead ends: 181 [2022-03-15 19:37:05,058 INFO L226 Difference]: Without dead ends: 167 [2022-03-15 19:37:05,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 27 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:37:05,060 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:05,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:37:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-03-15 19:37:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-03-15 19:37:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.572289156626506) internal successors, (427), 166 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 427 transitions. [2022-03-15 19:37:05,073 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 427 transitions. Word has length 22 [2022-03-15 19:37:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:05,074 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 427 transitions. [2022-03-15 19:37:05,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 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:37:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 427 transitions. [2022-03-15 19:37:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:37:05,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:05,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:05,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:37:05,083 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 179171229, now seen corresponding path program 1 times [2022-03-15 19:37:05,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:05,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240340076] [2022-03-15 19:37:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:05,162 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:37:05,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:05,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240340076] [2022-03-15 19:37:05,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240340076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:37:05,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:37:05,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:37:05,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731293610] [2022-03-15 19:37:05,165 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:05,168 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:05,178 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:37:05,178 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:05,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:05,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:37:05,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:05,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:37:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:37:05,440 INFO L87 Difference]: Start difference. First operand 167 states and 427 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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:37:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:05,478 INFO L93 Difference]: Finished difference Result 199 states and 486 transitions. [2022-03-15 19:37:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:37:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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 24 [2022-03-15 19:37:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:05,480 INFO L225 Difference]: With dead ends: 199 [2022-03-15 19:37:05,480 INFO L226 Difference]: Without dead ends: 168 [2022-03-15 19:37:05,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:37:05,480 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:05,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:37:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-03-15 19:37:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-03-15 19:37:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.562874251497006) internal successors, (428), 167 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 428 transitions. [2022-03-15 19:37:05,485 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 428 transitions. Word has length 24 [2022-03-15 19:37:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:05,485 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 428 transitions. [2022-03-15 19:37:05,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 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:37:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 428 transitions. [2022-03-15 19:37:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:05,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:05,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:05,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:37:05,486 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash -187584327, now seen corresponding path program 1 times [2022-03-15 19:37:05,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:05,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305007937] [2022-03-15 19:37:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:05,908 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:37:05,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:05,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305007937] [2022-03-15 19:37:05,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305007937] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:05,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356525948] [2022-03-15 19:37:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:05,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:05,910 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:37:05,942 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:37:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:05,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:37:06,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:06,118 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 11 treesize of output 7 [2022-03-15 19:37:06,185 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:37:06,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:06,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:06,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:06,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:06,497 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 19 treesize of output 7 [2022-03-15 19:37:06,602 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:37:06,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:06,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:06,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:06,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:06,983 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 62 treesize of output 50 [2022-03-15 19:37:06,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:06,992 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 362 treesize of output 354 [2022-03-15 19:37:07,007 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:07,007 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 338 treesize of output 336 [2022-03-15 19:37:07,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 302 treesize of output 254 [2022-03-15 19:37:07,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 254 treesize of output 230 [2022-03-15 19:37:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:37:07,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356525948] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:07,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:07,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-03-15 19:37:07,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881365202] [2022-03-15 19:37:07,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:07,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:07,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 106 transitions. [2022-03-15 19:37:07,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:09,243 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [2805#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 2807#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 2810#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (* ~front~0 4) ~queue~0.offset) 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 2806#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 2803#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 2808#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 2757#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 2802#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 2804#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0))), 2809#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:37:09,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:37:09,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:09,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:37:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1485, Unknown=6, NotChecked=162, Total=1892 [2022-03-15 19:37:09,245 INFO L87 Difference]: Start difference. First operand 168 states and 428 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:12,000 INFO L93 Difference]: Finished difference Result 509 states and 1315 transitions. [2022-03-15 19:37:12,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:37:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 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:37:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:12,002 INFO L225 Difference]: With dead ends: 509 [2022-03-15 19:37:12,002 INFO L226 Difference]: Without dead ends: 429 [2022-03-15 19:37:12,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=935, Invalid=4469, Unknown=6, NotChecked=290, Total=5700 [2022-03-15 19:37:12,004 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:12,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 4 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:37:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-15 19:37:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 262. [2022-03-15 19:37:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.5172413793103448) internal successors, (657), 261 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 657 transitions. [2022-03-15 19:37:12,013 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 657 transitions. Word has length 25 [2022-03-15 19:37:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:12,013 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 657 transitions. [2022-03-15 19:37:12,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 657 transitions. [2022-03-15 19:37:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:12,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:12,014 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:12,034 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:37:12,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:12,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1327895325, now seen corresponding path program 2 times [2022-03-15 19:37:12,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:12,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062387829] [2022-03-15 19:37:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:12,741 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:37:12,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:12,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062387829] [2022-03-15 19:37:12,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062387829] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:12,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158617751] [2022-03-15 19:37:12,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:12,742 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:37:12,743 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:37:12,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:12,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:12,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:37:12,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:13,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:13,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:13,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:13,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:13,125 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 23 treesize of output 7 [2022-03-15 19:37:13,220 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:37:13,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:13,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_179) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:13,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_179) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:13,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:13,361 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 88 treesize of output 88 [2022-03-15 19:37:13,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 56 [2022-03-15 19:37:13,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 24 [2022-03-15 19:37:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:37:13,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158617751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:13,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:13,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2022-03-15 19:37:13,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569611253] [2022-03-15 19:37:13,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:13,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:13,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 107 transitions. [2022-03-15 19:37:13,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:15,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4100#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 4097#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0))), 4098#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 4096#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 4099#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 4094#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 4095#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 4101#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 4093#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 4046#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0)] [2022-03-15 19:37:15,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:37:15,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:37:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1494, Unknown=2, NotChecked=162, Total=1892 [2022-03-15 19:37:15,232 INFO L87 Difference]: Start difference. First operand 262 states and 657 transitions. Second operand has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 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:37:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:18,928 INFO L93 Difference]: Finished difference Result 635 states and 1628 transitions. [2022-03-15 19:37:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 19:37:18,929 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 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) Word has length 26 [2022-03-15 19:37:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:18,931 INFO L225 Difference]: With dead ends: 635 [2022-03-15 19:37:18,931 INFO L226 Difference]: Without dead ends: 555 [2022-03-15 19:37:18,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1235, Invalid=5911, Unknown=2, NotChecked=334, Total=7482 [2022-03-15 19:37:18,933 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 292 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:18,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 2 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:37:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-03-15 19:37:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 263. [2022-03-15 19:37:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.515267175572519) internal successors, (659), 262 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 659 transitions. [2022-03-15 19:37:18,941 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 659 transitions. Word has length 26 [2022-03-15 19:37:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:18,941 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 659 transitions. [2022-03-15 19:37:18,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 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:37:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 659 transitions. [2022-03-15 19:37:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:18,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:18,942 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:18,959 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:37:19,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:37:19,159 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1063124281, now seen corresponding path program 3 times [2022-03-15 19:37:19,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:19,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954155658] [2022-03-15 19:37:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:19,672 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:37:19,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:19,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954155658] [2022-03-15 19:37:19,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954155658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:19,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133311432] [2022-03-15 19:37:19,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:19,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:19,673 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:37:19,674 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:37:19,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:37:19,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:19,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:37:19,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:19,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:19,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:20,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:20,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:20,065 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 23 treesize of output 7 [2022-03-15 19:37:20,165 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:37:20,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:20,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_233 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:20,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_232 (Array Int Int)) (v_ArrVal_233 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_232) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:20,302 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:20,302 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 88 treesize of output 88 [2022-03-15 19:37:20,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 56 [2022-03-15 19:37:20,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 24 [2022-03-15 19:37:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:37:20,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133311432] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:20,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:20,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2022-03-15 19:37:20,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515133082] [2022-03-15 19:37:20,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:20,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:20,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 108 transitions. [2022-03-15 19:37:20,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:22,001 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5545#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 5543#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0))), 5548#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 5544#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 5490#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 5540#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 5541#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 5546#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 5547#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 5542#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))] [2022-03-15 19:37:22,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:37:22,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:37:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1496, Unknown=2, NotChecked=162, Total=1892 [2022-03-15 19:37:22,003 INFO L87 Difference]: Start difference. First operand 263 states and 659 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 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:37:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:26,477 INFO L93 Difference]: Finished difference Result 674 states and 1713 transitions. [2022-03-15 19:37:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:37:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 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) Word has length 27 [2022-03-15 19:37:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:26,481 INFO L225 Difference]: With dead ends: 674 [2022-03-15 19:37:26,481 INFO L226 Difference]: Without dead ends: 594 [2022-03-15 19:37:26,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2331 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1542, Invalid=7020, Unknown=2, NotChecked=366, Total=8930 [2022-03-15 19:37:26,483 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:26,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 2 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:37:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-03-15 19:37:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 264. [2022-03-15 19:37:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.5133079847908744) internal successors, (661), 263 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 661 transitions. [2022-03-15 19:37:26,491 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 661 transitions. Word has length 27 [2022-03-15 19:37:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:26,504 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 661 transitions. [2022-03-15 19:37:26,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 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:37:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 661 transitions. [2022-03-15 19:37:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:37:26,507 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:26,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:26,524 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:37:26,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:26,719 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2022337160, now seen corresponding path program 4 times [2022-03-15 19:37:26,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:26,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009376371] [2022-03-15 19:37:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:26,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:26,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009376371] [2022-03-15 19:37:26,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009376371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:26,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984737928] [2022-03-15 19:37:26,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:26,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:26,783 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:37:26,784 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:37:26,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:26,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:26,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:37:26,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:26,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:27,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984737928] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:27,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:27,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-03-15 19:37:27,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296167784] [2022-03-15 19:37:27,102 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:27,105 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:27,121 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 157 transitions. [2022-03-15 19:37:27,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:28,048 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7030#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0))] [2022-03-15 19:37:28,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:37:28,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:28,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:37:28,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:37:28,049 INFO L87 Difference]: Start difference. First operand 264 states and 661 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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:37:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:28,111 INFO L93 Difference]: Finished difference Result 602 states and 1516 transitions. [2022-03-15 19:37:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:37:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 28 [2022-03-15 19:37:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:28,114 INFO L225 Difference]: With dead ends: 602 [2022-03-15 19:37:28,114 INFO L226 Difference]: Without dead ends: 560 [2022-03-15 19:37:28,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 21 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:37:28,115 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:28,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 11 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:37:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-03-15 19:37:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 528. [2022-03-15 19:37:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 2.609108159392789) internal successors, (1375), 527 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1375 transitions. [2022-03-15 19:37:28,126 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1375 transitions. Word has length 28 [2022-03-15 19:37:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:28,127 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 1375 transitions. [2022-03-15 19:37:28,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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:37:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1375 transitions. [2022-03-15 19:37:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:37:28,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:28,128 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:28,147 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:37:28,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:28,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1445156509, now seen corresponding path program 5 times [2022-03-15 19:37:28,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:28,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734042399] [2022-03-15 19:37:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:28,865 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:37:28,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:28,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734042399] [2022-03-15 19:37:28,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734042399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:28,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036291237] [2022-03-15 19:37:28,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:28,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:28,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:28,867 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:37:28,868 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:37:28,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:37:28,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:28,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:37:28,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:29,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:29,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:29,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:29,277 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 23 treesize of output 7 [2022-03-15 19:37:29,388 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:37:29,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:29,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_335) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:29,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_335) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:29,498 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:29,498 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 174 treesize of output 166 [2022-03-15 19:37:29,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 146 treesize of output 122 [2022-03-15 19:37:29,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 122 treesize of output 110 [2022-03-15 19:37:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-03-15 19:37:29,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036291237] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:29,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:29,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 12] total 38 [2022-03-15 19:37:29,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095883367] [2022-03-15 19:37:29,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:29,784 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:29,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 109 transitions. [2022-03-15 19:37:29,797 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:31,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [8895#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 8898#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 8837#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 8891#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 8890#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 8897#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 8892#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 8894#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0))), 8893#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 8896#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:37:31,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:37:31,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:37:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1803, Unknown=2, NotChecked=178, Total=2256 [2022-03-15 19:37:31,157 INFO L87 Difference]: Start difference. First operand 528 states and 1375 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:35,943 INFO L93 Difference]: Finished difference Result 1432 states and 3693 transitions. [2022-03-15 19:37:35,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:37:35,943 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-03-15 19:37:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:35,947 INFO L225 Difference]: With dead ends: 1432 [2022-03-15 19:37:35,948 INFO L226 Difference]: Without dead ends: 1186 [2022-03-15 19:37:35,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2019, Invalid=9117, Unknown=2, NotChecked=418, Total=11556 [2022-03-15 19:37:35,950 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 508 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:35,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 2 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:37:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-03-15 19:37:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 529. [2022-03-15 19:37:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 2.6079545454545454) internal successors, (1377), 528 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1377 transitions. [2022-03-15 19:37:35,965 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1377 transitions. Word has length 28 [2022-03-15 19:37:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:35,965 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1377 transitions. [2022-03-15 19:37:35,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1377 transitions. [2022-03-15 19:37:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:37:35,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:35,966 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:35,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:37:36,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:36,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 403253689, now seen corresponding path program 6 times [2022-03-15 19:37:36,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:36,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355342599] [2022-03-15 19:37:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:36,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:36,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:36,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355342599] [2022-03-15 19:37:36,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355342599] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:36,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237244170] [2022-03-15 19:37:36,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:36,701 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:37:36,702 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:37:36,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:37:36,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:36,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:37:36,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:37,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:37,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:37,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:37,192 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 23 treesize of output 7 [2022-03-15 19:37:37,284 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:37:37,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:37,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_397) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 19:37:37,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array Int Int)) (v_ArrVal_396 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_397) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 19:37:37,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:37,421 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 88 treesize of output 88 [2022-03-15 19:37:37,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 56 [2022-03-15 19:37:37,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 24 [2022-03-15 19:37:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2022-03-15 19:37:37,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237244170] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:37,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:37,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-03-15 19:37:37,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034100592] [2022-03-15 19:37:37,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:37,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:37,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 110 transitions. [2022-03-15 19:37:37,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:39,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [11716#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 11721#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 11718#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (not (= (mod ~v_assert~0 256) 0)))), 11658#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 11714#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 11719#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 11715#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 11717#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 11722#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 11720#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:37:39,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:37:39,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:37:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1644, Unknown=2, NotChecked=170, Total=2070 [2022-03-15 19:37:39,083 INFO L87 Difference]: Start difference. First operand 529 states and 1377 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:44,497 INFO L93 Difference]: Finished difference Result 1472 states and 3780 transitions. [2022-03-15 19:37:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 19:37:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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 29 [2022-03-15 19:37:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:44,502 INFO L225 Difference]: With dead ends: 1472 [2022-03-15 19:37:44,502 INFO L226 Difference]: Without dead ends: 1226 [2022-03-15 19:37:44,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3684 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2438, Invalid=10224, Unknown=2, NotChecked=446, Total=13110 [2022-03-15 19:37:44,504 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:44,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 2 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:37:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-03-15 19:37:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 530. [2022-03-15 19:37:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.606805293005671) internal successors, (1379), 529 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1379 transitions. [2022-03-15 19:37:44,518 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1379 transitions. Word has length 29 [2022-03-15 19:37:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:44,518 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1379 transitions. [2022-03-15 19:37:44,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1379 transitions. [2022-03-15 19:37:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:37:44,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:44,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:44,536 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:37:44,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:44,735 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 101749421, now seen corresponding path program 7 times [2022-03-15 19:37:44,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:44,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115587961] [2022-03-15 19:37:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:37:44,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:44,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115587961] [2022-03-15 19:37:44,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115587961] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:44,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412301263] [2022-03-15 19:37:44,787 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:44,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:44,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:44,788 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:37:44,815 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:37:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:37:44,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:37:44,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:37:45,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412301263] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:45,009 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:45,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:37:45,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1500241058] [2022-03-15 19:37:45,009 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:45,013 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:45,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 159 transitions. [2022-03-15 19:37:45,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:45,645 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14579#(or (<= ~n~0 0) (<= ~back~0 0))] [2022-03-15 19:37:45,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:37:45,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:37:45,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:37:45,647 INFO L87 Difference]: Start difference. First operand 530 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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:37:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:45,735 INFO L93 Difference]: Finished difference Result 605 states and 1534 transitions. [2022-03-15 19:37:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:37:45,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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 30 [2022-03-15 19:37:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:45,738 INFO L225 Difference]: With dead ends: 605 [2022-03-15 19:37:45,738 INFO L226 Difference]: Without dead ends: 530 [2022-03-15 19:37:45,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:37:45,739 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:45,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:37:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-03-15 19:37:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-03-15 19:37:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.604914933837429) internal successors, (1378), 529 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1378 transitions. [2022-03-15 19:37:45,749 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1378 transitions. Word has length 30 [2022-03-15 19:37:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:45,749 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1378 transitions. [2022-03-15 19:37:45,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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:37:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1378 transitions. [2022-03-15 19:37:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:37:45,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:45,751 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:45,767 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:37:45,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:45,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1830962659, now seen corresponding path program 8 times [2022-03-15 19:37:45,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:45,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893964128] [2022-03-15 19:37:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:46,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:46,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893964128] [2022-03-15 19:37:46,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893964128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:46,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182399819] [2022-03-15 19:37:46,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:46,848 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:37:46,849 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:37:46,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:46,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:37:46,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:47,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:47,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:47,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:47,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:37:47,366 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 23 treesize of output 7 [2022-03-15 19:37:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:37:47,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:47,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:47,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (<= (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:37:47,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:47,586 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 88 treesize of output 88 [2022-03-15 19:37:47,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 30 [2022-03-15 19:37:47,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 50 [2022-03-15 19:37:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 1 not checked. [2022-03-15 19:37:47,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182399819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:47,871 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:47,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 12] total 42 [2022-03-15 19:37:47,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326446586] [2022-03-15 19:37:47,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:47,875 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:47,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 111 transitions. [2022-03-15 19:37:47,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:49,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [16474#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 16467#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 16470#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 16468#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 16466#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 16407#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 16469#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 16473#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 16471#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0))), 16472#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)))] [2022-03-15 19:37:49,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:37:49,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:37:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2143, Unknown=2, NotChecked=194, Total=2652 [2022-03-15 19:37:49,379 INFO L87 Difference]: Start difference. First operand 530 states and 1378 transitions. Second operand has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:53,950 INFO L93 Difference]: Finished difference Result 1346 states and 3481 transitions. [2022-03-15 19:37:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:37:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 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 30 [2022-03-15 19:37:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:53,955 INFO L225 Difference]: With dead ends: 1346 [2022-03-15 19:37:53,955 INFO L226 Difference]: Without dead ends: 1100 [2022-03-15 19:37:53,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1565, Invalid=7753, Unknown=2, NotChecked=382, Total=9702 [2022-03-15 19:37:53,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:53,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 2 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:37:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2022-03-15 19:37:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 463. [2022-03-15 19:37:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.6385281385281387) internal successors, (1219), 462 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1219 transitions. [2022-03-15 19:37:53,970 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1219 transitions. Word has length 30 [2022-03-15 19:37:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:53,970 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 1219 transitions. [2022-03-15 19:37:53,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1219 transitions. [2022-03-15 19:37:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:37:53,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:53,972 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:53,991 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:37:54,187 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,SelfDestructingSolverStorable11 [2022-03-15 19:37:54,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:37:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash -439480631, now seen corresponding path program 9 times [2022-03-15 19:37:54,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:54,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003967701] [2022-03-15 19:37:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:54,799 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:37:54,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:54,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003967701] [2022-03-15 19:37:54,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003967701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:54,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842782050] [2022-03-15 19:37:54,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:54,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:54,802 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:37:54,805 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:37:54,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:37:54,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:54,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 19:37:54,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:55,044 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 11 treesize of output 7 [2022-03-15 19:37:55,100 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:37:55,149 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:37:55,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:55,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:37:55,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:55,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:37:55,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:37:55,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:55,753 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 41 treesize of output 13 [2022-03-15 19:37:55,862 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:37:55,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:56,720 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 19:37:56,720 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 153 treesize of output 98 [2022-03-15 19:37:56,754 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:37:56,754 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 1944 treesize of output 1843 [2022-03-15 19:37:56,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:56,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1742 treesize of output 1326 [2022-03-15 19:37:56,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:56,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:56,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:37:56,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 765 treesize of output 716 [2022-03-15 19:37:56,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:37:56,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1222 treesize of output 1014 [2022-03-15 19:38:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:02,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842782050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:02,109 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:02,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-03-15 19:38:02,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385751194] [2022-03-15 19:38:02,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:02,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:02,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 160 transitions. [2022-03-15 19:38:02,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:05,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [19081#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 19084#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 19075#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 19080#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 19082#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 19078#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 19077#(and (or (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 19073#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 19074#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 19083#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)) (or (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) 4) 1))), 19076#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 19079#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 19086#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)) (or (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) 4) 1))), 19070#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 19071#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 19072#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 19002#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 19085#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))] [2022-03-15 19:38:05,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:38:05,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:05,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:38:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=3738, Unknown=22, NotChecked=0, Total=4290 [2022-03-15 19:38:05,233 INFO L87 Difference]: Start difference. First operand 463 states and 1219 transitions. Second operand has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:12,802 INFO L93 Difference]: Finished difference Result 1094 states and 2846 transitions. [2022-03-15 19:38:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 19:38:12,803 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 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 31 [2022-03-15 19:38:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:12,806 INFO L225 Difference]: With dead ends: 1094 [2022-03-15 19:38:12,806 INFO L226 Difference]: Without dead ends: 982 [2022-03-15 19:38:12,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4921 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2856, Invalid=14414, Unknown=22, NotChecked=0, Total=17292 [2022-03-15 19:38:12,808 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:12,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 4 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:38:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-03-15 19:38:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 646. [2022-03-15 19:38:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 2.6496124031007753) internal successors, (1709), 645 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1709 transitions. [2022-03-15 19:38:12,820 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1709 transitions. Word has length 31 [2022-03-15 19:38:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:12,820 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 1709 transitions. [2022-03-15 19:38:12,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1709 transitions. [2022-03-15 19:38:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:38:12,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:12,821 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:12,843 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:38:13,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:38:13,034 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:38:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 706887143, now seen corresponding path program 10 times [2022-03-15 19:38:13,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:13,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815939191] [2022-03-15 19:38:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:13,668 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:38:13,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:13,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815939191] [2022-03-15 19:38:13,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815939191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:13,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136620203] [2022-03-15 19:38:13,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:38:13,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:13,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:13,670 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:38:13,670 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:38:13,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:38:13,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:13,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:13,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:14,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:14,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:38:14,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:14,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:38:14,228 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:14,228 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 47 treesize of output 13 [2022-03-15 19:38:14,353 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:38:14,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:14,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_612) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:38:14,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_612) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:38:14,583 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_611 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_612) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:38:14,623 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:38:14,624 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 404 treesize of output 396 [2022-03-15 19:38:14,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:38:14,640 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:38:14,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 238 [2022-03-15 19:38:14,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:38:14,657 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:38:14,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 300 treesize of output 255 [2022-03-15 19:38:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-03-15 19:38:15,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136620203] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:15,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:15,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 45 [2022-03-15 19:38:15,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377590692] [2022-03-15 19:38:15,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:15,400 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:15,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 192 transitions. [2022-03-15 19:38:15,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:21,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [21832#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 21847#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 21841#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 21848#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 21854#(and (or (<= 1 ~back~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= ~n~0 2) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 21855#(and (or (<= 1 ~back~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= ~n~0 2) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 21845#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 21849#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 21835#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0))), 21844#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 21837#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 21851#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~back~0))), 21840#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 21846#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 21843#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 21838#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 21850#(and (or (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 21839#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 21853#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 4) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 1 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 21833#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 21836#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 21765#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 21831#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 21852#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 21834#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 21842#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:38:21,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:38:21,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:38:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=4033, Unknown=3, NotChecked=402, Total=4970 [2022-03-15 19:38:21,449 INFO L87 Difference]: Start difference. First operand 646 states and 1709 transitions. Second operand has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:49,302 INFO L93 Difference]: Finished difference Result 4472 states and 10714 transitions. [2022-03-15 19:38:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2022-03-15 19:38:49,302 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 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 31 [2022-03-15 19:38:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:49,313 INFO L225 Difference]: With dead ends: 4472 [2022-03-15 19:38:49,313 INFO L226 Difference]: Without dead ends: 3559 [2022-03-15 19:38:49,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 263 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24506 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=8202, Invalid=60189, Unknown=3, NotChecked=1566, Total=69960 [2022-03-15 19:38:49,317 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 817 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 5821 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 6270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 5821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:49,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 4 Invalid, 6270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 5821 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 19:38:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2022-03-15 19:38:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 881. [2022-03-15 19:38:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.7511363636363635) internal successors, (2421), 880 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2421 transitions. [2022-03-15 19:38:49,345 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 2421 transitions. Word has length 31 [2022-03-15 19:38:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:49,346 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 2421 transitions. [2022-03-15 19:38:49,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 2421 transitions. [2022-03-15 19:38:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:38:49,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:49,347 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:49,364 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:38:49,563 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,SelfDestructingSolverStorable13 [2022-03-15 19:38:49,564 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:38:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 856574505, now seen corresponding path program 11 times [2022-03-15 19:38:49,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:49,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424283994] [2022-03-15 19:38:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:50,186 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:38:50,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:50,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424283994] [2022-03-15 19:38:50,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424283994] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:50,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691798293] [2022-03-15 19:38:50,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:50,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:50,188 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:38:50,188 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:38:50,274 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:38:50,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:50,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:38:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:50,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:38:50,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:38:50,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:38:50,757 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:38:50,758 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 47 treesize of output 13 [2022-03-15 19:38:50,864 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:38:50,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:51,137 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_662 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_662) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:38:51,153 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_662) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:38:51,266 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:38:51,267 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 198 treesize of output 216 [2022-03-15 19:38:51,284 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:38:51,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 160 treesize of output 146 [2022-03-15 19:38:51,316 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:38:51,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 93 treesize of output 99 [2022-03-15 19:38:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:38:52,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691798293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:52,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:52,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 44 [2022-03-15 19:38:52,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965692584] [2022-03-15 19:38:52,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:52,384 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:52,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 148 transitions. [2022-03-15 19:38:52,402 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:55,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [28719#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (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) ~W~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 28703#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 28713#(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 (< ~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0))), 28710#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 28722#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 28721#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 28705#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 28712#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 28724#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 28706#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (= ~queue~0.offset 0)), 28718#(and (or (= ~d~0 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 28714#(and (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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 28717#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (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)) ~d~0) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 28715#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 28723#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (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) ~W~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 28709#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 28704#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 28711#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 28720#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 28716#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 28707#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)), 28708#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:38:55,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:38:55,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:38:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3720, Unknown=6, NotChecked=254, Total=4422 [2022-03-15 19:38:55,207 INFO L87 Difference]: Start difference. First operand 881 states and 2421 transitions. Second operand has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:04,160 INFO L93 Difference]: Finished difference Result 2640 states and 6415 transitions. [2022-03-15 19:39:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 19:39:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 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 31 [2022-03-15 19:39:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:04,167 INFO L225 Difference]: With dead ends: 2640 [2022-03-15 19:39:04,167 INFO L226 Difference]: Without dead ends: 2356 [2022-03-15 19:39:04,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6471 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2804, Invalid=19548, Unknown=6, NotChecked=594, Total=22952 [2022-03-15 19:39:04,169 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:04,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 6 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:39:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-03-15 19:39:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 909. [2022-03-15 19:39:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 2.752202643171806) internal successors, (2499), 908 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2499 transitions. [2022-03-15 19:39:04,194 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2499 transitions. Word has length 31 [2022-03-15 19:39:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:04,194 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 2499 transitions. [2022-03-15 19:39:04,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6923076923076925) internal successors, (105), 38 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2499 transitions. [2022-03-15 19:39:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:39:04,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:04,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:04,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 19:39:04,411 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,SelfDestructingSolverStorable14 [2022-03-15 19:39:04,411 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:39:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -670816719, now seen corresponding path program 12 times [2022-03-15 19:39:04,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:04,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054485598] [2022-03-15 19:39:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:04,921 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:39:04,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:04,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054485598] [2022-03-15 19:39:04,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054485598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:04,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667519818] [2022-03-15 19:39:04,921 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:04,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:04,922 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:39:04,923 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:39:05,016 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:39:05,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:05,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:39:05,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:39:05,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 98 treesize of output 94 [2022-03-15 19:39:05,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:39:05,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:39:05,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:39:05,703 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 19:39:05,703 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 47 treesize of output 16 [2022-03-15 19:39:05,812 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:39:05,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:05,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_715) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:39:06,219 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:39:06,220 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 522 treesize of output 458 [2022-03-15 19:39:06,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 378 treesize of output 322 [2022-03-15 19:39:06,247 INFO L353 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2022-03-15 19:39:06,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 346 treesize of output 290 [2022-03-15 19:39:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 19:39:07,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667519818] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:07,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:07,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-03-15 19:39:07,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364929072] [2022-03-15 19:39:07,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:07,408 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:07,426 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 145 transitions. [2022-03-15 19:39:07,426 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:10,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [33588#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 33589#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 33584#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 33597#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 33515#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 33594#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 33586#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 33599#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 33585#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 33593#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 33601#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))), 33591#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 33596#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 33592#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 33590#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 33587#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 33595#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 ~front~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 33583#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 33598#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 33600#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))))] [2022-03-15 19:39:10,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:39:10,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:39:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=4127, Unknown=19, NotChecked=132, Total=4692 [2022-03-15 19:39:10,424 INFO L87 Difference]: Start difference. First operand 909 states and 2499 transitions. Second operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:21,574 INFO L93 Difference]: Finished difference Result 3185 states and 7933 transitions. [2022-03-15 19:39:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-15 19:39:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 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 31 [2022-03-15 19:39:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:21,582 INFO L225 Difference]: With dead ends: 3185 [2022-03-15 19:39:21,583 INFO L226 Difference]: Without dead ends: 2701 [2022-03-15 19:39:21,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 179 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9846 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=3758, Invalid=28447, Unknown=19, NotChecked=356, Total=32580 [2022-03-15 19:39:21,584 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 465 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 3660 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 3660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:21,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 17 Invalid, 3930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 3660 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:39:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2022-03-15 19:39:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 900. [2022-03-15 19:39:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.7163515016685205) internal successors, (2442), 899 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:39:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2442 transitions. [2022-03-15 19:39:21,606 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2442 transitions. Word has length 31 [2022-03-15 19:39:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:21,606 INFO L470 AbstractCegarLoop]: Abstraction has 900 states and 2442 transitions. [2022-03-15 19:39:21,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2442 transitions. [2022-03-15 19:39:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:39:21,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:21,608 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:21,625 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:39:21,811 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,SelfDestructingSolverStorable15 [2022-03-15 19:39:21,811 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:39:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -598570283, now seen corresponding path program 13 times [2022-03-15 19:39:21,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:21,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890831568] [2022-03-15 19:39:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:22,330 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:39:22,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:22,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890831568] [2022-03-15 19:39:22,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890831568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:22,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860420835] [2022-03-15 19:39:22,330 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:22,331 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:39:22,332 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:39:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:22,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:39:22,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:22,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:39:22,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:39:22,781 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:39:22,923 INFO L353 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-03-15 19:39:22,923 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 23 treesize of output 10 [2022-03-15 19:39:23,031 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:39:23,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:23,139 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:39:23,139 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 26 treesize of output 26 [2022-03-15 19:39:23,297 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (and (forall ((v_ArrVal_764 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 1) c_~W~0)) (= (+ c_~queue~0.offset (* c_~front~0 4) 4) (+ c_~queue~0.offset (* c_~back~0 4))))) is different from false [2022-03-15 19:39:23,308 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (and (forall ((v_ArrVal_764 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 1) c_~W~0)) (= (+ c_~queue~0.offset (* c_~front~0 4) 4) (+ c_~queue~0.offset (* c_~back~0 4))))) is different from false [2022-03-15 19:39:23,329 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:39:23,329 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 62 treesize of output 62 [2022-03-15 19:39:23,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 35 [2022-03-15 19:39:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:39:23,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860420835] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:23,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:23,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2022-03-15 19:39:23,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145954379] [2022-03-15 19:39:23,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:23,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:23,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 177 transitions. [2022-03-15 19:39:23,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:27,082 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [39058#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 39048#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39055#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 39059#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 39042#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39044#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~d~0 1) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 39040#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 39046#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0))), 39056#(and (= ~queue~0.offset 0) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)))), 39038#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 39041#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 39043#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39057#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 39047#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39060#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 39051#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 38971#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 39052#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 39053#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 39039#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 39049#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39050#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 39045#(and (or (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 39054#(and (or (= (+ (- 1) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)))] [2022-03-15 19:39:27,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:39:27,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:27,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:39:27,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=4052, Unknown=2, NotChecked=266, Total=4830 [2022-03-15 19:39:27,083 INFO L87 Difference]: Start difference. First operand 900 states and 2442 transitions. Second operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:47,186 INFO L93 Difference]: Finished difference Result 4609 states and 11124 transitions. [2022-03-15 19:39:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2022-03-15 19:39:47,187 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 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 31 [2022-03-15 19:39:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:47,199 INFO L225 Difference]: With dead ends: 4609 [2022-03-15 19:39:47,199 INFO L226 Difference]: Without dead ends: 4178 [2022-03-15 19:39:47,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 285 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29815 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=9553, Invalid=71393, Unknown=2, NotChecked=1134, Total=82082 [2022-03-15 19:39:47,202 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 805 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 6125 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 6503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 6125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:47,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 4 Invalid, 6503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 6125 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:39:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2022-03-15 19:39:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 803. [2022-03-15 19:39:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 2.6608478802992517) internal successors, (2134), 802 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2134 transitions. [2022-03-15 19:39:47,233 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 2134 transitions. Word has length 31 [2022-03-15 19:39:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:47,233 INFO L470 AbstractCegarLoop]: Abstraction has 803 states and 2134 transitions. [2022-03-15 19:39:47,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 2134 transitions. [2022-03-15 19:39:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:39:47,235 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:47,235 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:47,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:47,437 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,SelfDestructingSolverStorable16 [2022-03-15 19:39:47,437 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:39:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -37743059, now seen corresponding path program 14 times [2022-03-15 19:39:47,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:47,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516830397] [2022-03-15 19:39:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:48,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:48,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516830397] [2022-03-15 19:39:48,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516830397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:48,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496431107] [2022-03-15 19:39:48,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:39:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:48,296 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:39:48,296 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:39:48,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:39:48,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:48,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:39:48,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:48,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:39:48,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:39:48,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:39:48,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:39:48,934 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:39:48,934 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 47 treesize of output 13 [2022-03-15 19:39:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:39:49,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:49,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_818) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 19:39:49,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_818) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 19:39:49,337 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:39:49,337 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 135 treesize of output 153 [2022-03-15 19:39:49,343 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:39:49,344 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 93 treesize of output 67 [2022-03-15 19:39:49,350 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:39:49,350 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 39 treesize of output 26 [2022-03-15 19:39:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-03-15 19:39:49,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496431107] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:49,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:49,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 47 [2022-03-15 19:39:49,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [115549320] [2022-03-15 19:39:49,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:49,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:49,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 161 transitions. [2022-03-15 19:39:49,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:52,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [45875#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 45959#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 45946#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 45950#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 45960#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (* ~front~0 4) 4)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (* ~front~0 4) 4) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 45956#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 45949#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 45958#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (* ~front~0 4) 4)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (* ~front~0 4) 4) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 45951#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 45954#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 45945#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 45947#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 45955#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 45957#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 45952#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 45953#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 45948#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 45944#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))] [2022-03-15 19:39:52,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:39:52,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:39:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=3426, Unknown=2, NotChecked=246, Total=4160 [2022-03-15 19:39:52,448 INFO L87 Difference]: Start difference. First operand 803 states and 2134 transitions. Second operand has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:00,986 INFO L93 Difference]: Finished difference Result 2138 states and 5606 transitions. [2022-03-15 19:40:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 19:40:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 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 32 [2022-03-15 19:40:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:00,990 INFO L225 Difference]: With dead ends: 2138 [2022-03-15 19:40:00,991 INFO L226 Difference]: Without dead ends: 2038 [2022-03-15 19:40:00,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5480 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2847, Invalid=16341, Unknown=2, NotChecked=550, Total=19740 [2022-03-15 19:40:00,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:00,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 6 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:40:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-03-15 19:40:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 888. [2022-03-15 19:40:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 887 states have (on average 2.6493799323562572) internal successors, (2350), 887 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2350 transitions. [2022-03-15 19:40:01,014 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2350 transitions. Word has length 32 [2022-03-15 19:40:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:01,015 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 2350 transitions. [2022-03-15 19:40:01,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.111111111111111) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2350 transitions. [2022-03-15 19:40:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:40:01,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:01,020 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:01,047 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:40:01,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:01,229 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:40:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1349932343, now seen corresponding path program 15 times [2022-03-15 19:40:01,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:01,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629046566] [2022-03-15 19:40:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:01,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:01,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629046566] [2022-03-15 19:40:01,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629046566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:01,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535141252] [2022-03-15 19:40:01,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:01,870 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:40:01,871 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:40:02,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:40:02,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:02,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:40:02,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:02,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:02,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:40:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:02,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:40:02,531 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:40:02,531 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 47 treesize of output 13 [2022-03-15 19:40:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:40:02,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:02,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_872) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:40:02,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_872) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:40:02,760 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_872 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_872) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 19:40:02,766 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_872 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_872) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:40:02,778 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_871)) (.cse1 (* c_~front~0 4))) (+ (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_872) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 19:40:02,904 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:40:02,905 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 259 treesize of output 244 [2022-03-15 19:40:02,912 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:40:02,912 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 184 treesize of output 146 [2022-03-15 19:40:02,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 146 treesize of output 118 [2022-03-15 19:40:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2022-03-15 19:40:03,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535141252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:03,221 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:03,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 47 [2022-03-15 19:40:03,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408825158] [2022-03-15 19:40:03,221 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:03,225 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:03,243 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 138 transitions. [2022-03-15 19:40:03,243 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:05,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [50274#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 50273#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 50262#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 50192#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 50269#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 50265#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 50267#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 50268#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 50271#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 50266#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 50270#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 50263#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 50261#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 50272#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 50264#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))))] [2022-03-15 19:40:05,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:40:05,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:40:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2793, Unknown=5, NotChecked=570, Total=3782 [2022-03-15 19:40:05,310 INFO L87 Difference]: Start difference. First operand 888 states and 2350 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:11,051 INFO L93 Difference]: Finished difference Result 2067 states and 5417 transitions. [2022-03-15 19:40:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 19:40:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 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 32 [2022-03-15 19:40:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:11,055 INFO L225 Difference]: With dead ends: 2067 [2022-03-15 19:40:11,055 INFO L226 Difference]: Without dead ends: 1973 [2022-03-15 19:40:11,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4133 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2326, Invalid=12209, Unknown=5, NotChecked=1210, Total=15750 [2022-03-15 19:40:11,056 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:11,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 2 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:40:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2022-03-15 19:40:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 877. [2022-03-15 19:40:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 2.65296803652968) internal successors, (2324), 876 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2324 transitions. [2022-03-15 19:40:11,073 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 2324 transitions. Word has length 32 [2022-03-15 19:40:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:11,074 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 2324 transitions. [2022-03-15 19:40:11,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 2324 transitions. [2022-03-15 19:40:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:40:11,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:11,075 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:11,093 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:40:11,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:11,278 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:40:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1108624715, now seen corresponding path program 16 times [2022-03-15 19:40:11,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:11,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036357371] [2022-03-15 19:40:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:12,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:12,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036357371] [2022-03-15 19:40:12,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036357371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:12,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981957928] [2022-03-15 19:40:12,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:40:12,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:12,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:12,592 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:40:12,593 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:40:12,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:40:12,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:12,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:40:12,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:12,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:12,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:40:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:13,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:40:13,185 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:40:13,185 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 47 treesize of output 13 [2022-03-15 19:40:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:40:13,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:13,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_926) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:40:13,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_926) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:40:13,527 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_926) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:40:13,565 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:40:13,565 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 404 treesize of output 396 [2022-03-15 19:40:13,585 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:40:13,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 340 treesize of output 286 [2022-03-15 19:40:13,604 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:40:13,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 260 treesize of output 246 [2022-03-15 19:40:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-03-15 19:40:15,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981957928] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:15,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:15,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 16] total 47 [2022-03-15 19:40:15,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899537700] [2022-03-15 19:40:15,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:15,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:15,303 INFO L252 McrAutomatonBuilder]: Finished intersection with 103 states and 193 transitions. [2022-03-15 19:40:15,303 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:20,089 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [54478#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 54481#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 54464#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54475#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 54459#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 54462#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 54479#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) (* (div (+ 7 (* ~front~0 4) ~queue~0.offset) 4) 4))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 54482#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) (* (div (+ 7 (* ~front~0 4) ~queue~0.offset) 4) 4))) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 54472#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54461#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 54467#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 54476#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 54463#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 54473#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54458#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 54469#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 54466#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0))), 54465#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54468#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54474#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 54477#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 54389#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 54470#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 54471#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 54460#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 54480#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))] [2022-03-15 19:40:20,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:40:20,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:40:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=4260, Unknown=3, NotChecked=414, Total=5256 [2022-03-15 19:40:20,090 INFO L87 Difference]: Start difference. First operand 877 states and 2324 transitions. Second operand has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 43 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:37,987 INFO L93 Difference]: Finished difference Result 4323 states and 10591 transitions. [2022-03-15 19:40:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-03-15 19:40:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 43 states have internal predecessors, (136), 0 states have call successors, (0), 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 32 [2022-03-15 19:40:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:37,994 INFO L225 Difference]: With dead ends: 4323 [2022-03-15 19:40:37,994 INFO L226 Difference]: Without dead ends: 3802 [2022-03-15 19:40:37,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 14918 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=6317, Invalid=41434, Unknown=3, NotChecked=1308, Total=49062 [2022-03-15 19:40:37,997 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 965 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 4052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:37,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [965 Valid, 4 Invalid, 4052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 19:40:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2022-03-15 19:40:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 907. [2022-03-15 19:40:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 2.662251655629139) internal successors, (2412), 906 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2412 transitions. [2022-03-15 19:40:38,023 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2412 transitions. Word has length 32 [2022-03-15 19:40:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:38,023 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 2412 transitions. [2022-03-15 19:40:38,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.090909090909091) internal successors, (136), 43 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2412 transitions. [2022-03-15 19:40:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:40:38,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:38,025 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:38,049 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:40:38,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:38,239 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:40:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1258312077, now seen corresponding path program 17 times [2022-03-15 19:40:38,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:38,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067556507] [2022-03-15 19:40:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:39,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:39,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067556507] [2022-03-15 19:40:39,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067556507] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:39,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695730253] [2022-03-15 19:40:39,096 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:40:39,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:39,097 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:40:39,098 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:40:39,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:40:39,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:39,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:40:39,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:39,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:40:39,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:39,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:40:39,704 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:40:39,704 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 47 treesize of output 13 [2022-03-15 19:40:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:40:39,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:40,095 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:40:40,112 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:40:40,224 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:40:40,224 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 404 treesize of output 396 [2022-03-15 19:40:40,249 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:40:40,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 340 treesize of output 286 [2022-03-15 19:40:40,269 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:40:40,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 260 treesize of output 246 [2022-03-15 19:40:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:40:41,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695730253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:41,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:41,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-03-15 19:40:41,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224742150] [2022-03-15 19:40:41,165 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:41,169 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:41,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 149 transitions. [2022-03-15 19:40:41,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:44,237 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [61151#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 61163#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 61153#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 61156#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 61161#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 61166#(and (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 61155#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 61168#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 61164#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 61152#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)), 61159#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 61157#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 61167#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 61154#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 61085#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 61172#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 61170#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 61162#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 61171#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 61165#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 61169#(and (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 61158#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 61160#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))] [2022-03-15 19:40:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:40:44,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:40:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=3921, Unknown=6, NotChecked=262, Total=4692 [2022-03-15 19:40:44,238 INFO L87 Difference]: Start difference. First operand 907 states and 2412 transitions. Second operand has 41 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:57,356 INFO L93 Difference]: Finished difference Result 3322 states and 7812 transitions. [2022-03-15 19:40:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 19:40:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 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 32 [2022-03-15 19:40:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:57,361 INFO L225 Difference]: With dead ends: 3322 [2022-03-15 19:40:57,362 INFO L226 Difference]: Without dead ends: 2969 [2022-03-15 19:40:57,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 199 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12732 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4905, Invalid=34499, Unknown=6, NotChecked=790, Total=40200 [2022-03-15 19:40:57,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 928 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 4135 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 4135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:57,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 5 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 4135 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 19:40:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2022-03-15 19:40:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 911. [2022-03-15 19:40:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 910 states have (on average 2.6615384615384614) internal successors, (2422), 910 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 2422 transitions. [2022-03-15 19:40:57,386 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 2422 transitions. Word has length 32 [2022-03-15 19:40:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:57,387 INFO L470 AbstractCegarLoop]: Abstraction has 911 states and 2422 transitions. [2022-03-15 19:40:57,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 2422 transitions. [2022-03-15 19:40:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:40:57,389 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:57,389 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:57,422 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:40:57,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:57,607 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:40:57,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1609532297, now seen corresponding path program 18 times [2022-03-15 19:40:57,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:57,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606200241] [2022-03-15 19:40:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:58,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:58,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606200241] [2022-03-15 19:40:58,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606200241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:58,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124606828] [2022-03-15 19:40:58,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:40:58,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:58,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:58,633 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:40:58,633 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:40:58,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:40:58,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:58,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:40:58,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:59,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:40:59,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:40:59,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:40:59,282 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:40:59,282 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 47 treesize of output 13 [2022-03-15 19:40:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:40:59,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:59,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1034) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 19:40:59,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1034 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1034) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-03-15 19:40:59,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1033))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1034) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:40:59,650 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1033))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1034) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-03-15 19:40:59,683 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:40:59,684 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 280 treesize of output 265 [2022-03-15 19:40:59,700 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:40:59,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 209 treesize of output 190 [2022-03-15 19:40:59,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 146 treesize of output 118 [2022-03-15 19:41:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-03-15 19:41:00,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124606828] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:00,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:00,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 46 [2022-03-15 19:41:00,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142437468] [2022-03-15 19:41:00,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:00,143 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:00,162 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 146 transitions. [2022-03-15 19:41:00,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:03,694 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [66824#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 66829#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 66814#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 66820#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 66827#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 66818#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 66822#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 66823#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 66819#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 66828#(and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 2)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 1 ~back~0) (not (<= ~front~0 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= (+ (* ~front~0 4) ~queue~0.offset) 4)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8)) (= 8 (+ ~queue~0.offset (* ~back~0 4))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~front~0 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~front~0 0)) (<= ~back~0 (+ ~front~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< (+ (* ~n~0 4) (* ~front~0 4)) (+ (* ~back~0 4) 8)) (<= 2 ~W~0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (<= (+ (* ~front~0 4) ~queue~0.offset) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 66826#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 66816#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 66746#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 66817#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 66815#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 66825#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 66830#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 66821#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:41:03,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:41:03,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:03,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:41:03,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3181, Unknown=5, NotChecked=476, Total=4032 [2022-03-15 19:41:03,695 INFO L87 Difference]: Start difference. First operand 911 states and 2422 transitions. Second operand has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:16,610 INFO L93 Difference]: Finished difference Result 3535 states and 8673 transitions. [2022-03-15 19:41:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 19:41:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 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 32 [2022-03-15 19:41:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:16,615 INFO L225 Difference]: With dead ends: 3535 [2022-03-15 19:41:16,615 INFO L226 Difference]: Without dead ends: 3112 [2022-03-15 19:41:16,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 171 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8344 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3429, Invalid=24974, Unknown=5, NotChecked=1348, Total=29756 [2022-03-15 19:41:16,617 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 437 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:16,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 4 Invalid, 4037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:41:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2022-03-15 19:41:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 907. [2022-03-15 19:41:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 2.6578366445916113) internal successors, (2408), 906 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2408 transitions. [2022-03-15 19:41:16,651 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2408 transitions. Word has length 32 [2022-03-15 19:41:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:16,651 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 2408 transitions. [2022-03-15 19:41:16,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.891891891891892) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2408 transitions. [2022-03-15 19:41:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:41:16,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:16,653 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:16,672 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:41:16,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:16,867 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:41:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1049865681, now seen corresponding path program 19 times [2022-03-15 19:41:16,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:16,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326140226] [2022-03-15 19:41:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:17,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:17,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326140226] [2022-03-15 19:41:17,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326140226] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:17,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793363715] [2022-03-15 19:41:17,559 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:41:17,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:17,561 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:41:17,561 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:41:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:17,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:41:17,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:17,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:17,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:41:18,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:18,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:41:18,190 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:18,190 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 47 treesize of output 13 [2022-03-15 19:41:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:18,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:18,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1088) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:41:18,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1087))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1088) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:41:18,574 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1087))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1088) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:41:18,613 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:41:18,613 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 524 treesize of output 459 [2022-03-15 19:41:18,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 378 treesize of output 322 [2022-03-15 19:41:18,637 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:41:18,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 347 treesize of output 290 [2022-03-15 19:41:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-03-15 19:41:19,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793363715] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:19,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:19,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 48 [2022-03-15 19:41:19,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440490168] [2022-03-15 19:41:19,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:19,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:19,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 94 transitions. [2022-03-15 19:41:19,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:20,618 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [72643#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 72638#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 72633#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 72567#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 72644#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 72642#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 72637#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))), 72635#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 72636#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 72639#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 72641#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 72634#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 72640#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)))] [2022-03-15 19:41:20,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:41:20,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:20,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:41:20,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3040, Unknown=5, NotChecked=342, Total=3660 [2022-03-15 19:41:20,619 INFO L87 Difference]: Start difference. First operand 907 states and 2408 transitions. Second operand has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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:41:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:26,343 INFO L93 Difference]: Finished difference Result 2290 states and 5650 transitions. [2022-03-15 19:41:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:41:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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) Word has length 32 [2022-03-15 19:41:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:26,346 INFO L225 Difference]: With dead ends: 2290 [2022-03-15 19:41:26,347 INFO L226 Difference]: Without dead ends: 2042 [2022-03-15 19:41:26,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1408, Invalid=13119, Unknown=5, NotChecked=720, Total=15252 [2022-03-15 19:41:26,355 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:26,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 6 Invalid, 3163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:41:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-03-15 19:41:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 893. [2022-03-15 19:41:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 2.6547085201793723) internal successors, (2368), 892 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2368 transitions. [2022-03-15 19:41:26,372 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2368 transitions. Word has length 32 [2022-03-15 19:41:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:26,372 INFO L470 AbstractCegarLoop]: Abstraction has 893 states and 2368 transitions. [2022-03-15 19:41:26,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 31 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:41:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2368 transitions. [2022-03-15 19:41:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:41:26,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:26,374 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:26,390 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:41:26,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:26,590 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:41:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -468780215, now seen corresponding path program 20 times [2022-03-15 19:41:26,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:26,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316520579] [2022-03-15 19:41:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:27,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:27,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316520579] [2022-03-15 19:41:27,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316520579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:27,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344792283] [2022-03-15 19:41:27,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:41:27,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:27,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:27,524 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:41:27,526 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:41:27,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:41:27,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:27,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:41:27,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:28,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:28,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:41:28,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:28,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:41:28,242 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:28,242 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 47 treesize of output 13 [2022-03-15 19:41:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:28,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:28,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1146) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 19:41:28,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1146) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 19:41:28,672 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:41:28,673 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 135 treesize of output 153 [2022-03-15 19:41:28,678 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:28,678 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 93 treesize of output 67 [2022-03-15 19:41:28,684 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:28,684 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 39 treesize of output 26 [2022-03-15 19:41:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:41:29,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344792283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:29,093 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:29,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 16] total 49 [2022-03-15 19:41:29,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [975802101] [2022-03-15 19:41:29,093 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:29,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:29,119 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 162 transitions. [2022-03-15 19:41:29,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:32,497 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [77098#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 77090#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 77105#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 77101#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 77100#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 77017#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 77096#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 77094#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 77103#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 77095#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 77089#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 77102#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 77097#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 77092#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 77104#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (+ (* ~front~0 4) ~queue~0.offset) 4))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 77099#(and (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~front~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| 1) ~W~0)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (<= 1 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| 1) ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 77091#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 77093#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:41:32,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:41:32,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:41:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=3660, Unknown=3, NotChecked=254, Total=4422 [2022-03-15 19:41:32,498 INFO L87 Difference]: Start difference. First operand 893 states and 2368 transitions. Second operand has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:43,246 INFO L93 Difference]: Finished difference Result 2408 states and 6348 transitions. [2022-03-15 19:41:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 19:41:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 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 33 [2022-03-15 19:41:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:43,249 INFO L225 Difference]: With dead ends: 2408 [2022-03-15 19:41:43,249 INFO L226 Difference]: Without dead ends: 2308 [2022-03-15 19:41:43,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6304 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3418, Invalid=18937, Unknown=3, NotChecked=594, Total=22952 [2022-03-15 19:41:43,253 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 573 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:43,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 2 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:41:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-03-15 19:41:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 966. [2022-03-15 19:41:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 2.638341968911917) internal successors, (2546), 965 states have internal predecessors, (2546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2546 transitions. [2022-03-15 19:41:43,270 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2546 transitions. Word has length 33 [2022-03-15 19:41:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:43,270 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 2546 transitions. [2022-03-15 19:41:43,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2546 transitions. [2022-03-15 19:41:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:41:43,272 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:43,272 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:43,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:43,487 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,SelfDestructingSolverStorable23 [2022-03-15 19:41:43,487 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:41:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 918895187, now seen corresponding path program 21 times [2022-03-15 19:41:43,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:43,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904672681] [2022-03-15 19:41:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:44,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:44,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904672681] [2022-03-15 19:41:44,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904672681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:44,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266759914] [2022-03-15 19:41:44,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:41:44,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:44,461 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:41:44,462 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:41:44,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:41:44,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:44,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:41:44,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:44,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:44,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:41:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:45,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:41:45,167 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:45,168 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 47 treesize of output 13 [2022-03-15 19:41:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:45,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:45,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1204) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 19:41:45,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1204) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-03-15 19:41:45,394 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1204 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1204) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 19:41:45,400 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1204 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1204) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:41:45,410 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1203)) (.cse1 (* c_~front~0 4))) (+ (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1204) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 19:41:45,537 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:41:45,537 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 259 treesize of output 244 [2022-03-15 19:41:45,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 184 treesize of output 156 [2022-03-15 19:41:45,547 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:45,547 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 156 treesize of output 118 [2022-03-15 19:41:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2022-03-15 19:41:45,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266759914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:45,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:45,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 16] total 50 [2022-03-15 19:41:45,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486529601] [2022-03-15 19:41:45,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:45,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:45,863 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 139 transitions. [2022-03-15 19:41:45,863 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:47,983 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [81866#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 81860#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 81862#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 81865#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 81870#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 81868#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 81859#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 81861#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 81871#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 81872#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 81867#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 81864#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 81869#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 81787#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 81863#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:41:47,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:41:47,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:41:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=3136, Unknown=5, NotChecked=600, Total=4160 [2022-03-15 19:41:47,984 INFO L87 Difference]: Start difference. First operand 966 states and 2546 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:56,222 INFO L93 Difference]: Finished difference Result 1969 states and 5183 transitions. [2022-03-15 19:41:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:41:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 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 33 [2022-03-15 19:41:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:56,225 INFO L225 Difference]: With dead ends: 1969 [2022-03-15 19:41:56,225 INFO L226 Difference]: Without dead ends: 1875 [2022-03-15 19:41:56,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5081 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2261, Invalid=15046, Unknown=5, NotChecked=1320, Total=18632 [2022-03-15 19:41:56,226 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 376 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:56,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 14 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:41:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-03-15 19:41:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 945. [2022-03-15 19:41:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.6366525423728815) internal successors, (2489), 944 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2489 transitions. [2022-03-15 19:41:56,241 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2489 transitions. Word has length 33 [2022-03-15 19:41:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:56,242 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2489 transitions. [2022-03-15 19:41:56,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2489 transitions. [2022-03-15 19:41:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:41:56,243 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:56,243 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:56,259 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:41:56,448 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,SelfDestructingSolverStorable24 [2022-03-15 19:41:56,448 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:41:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash 677587559, now seen corresponding path program 22 times [2022-03-15 19:41:56,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:56,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554912232] [2022-03-15 19:41:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:57,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:57,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554912232] [2022-03-15 19:41:57,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554912232] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:57,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511188059] [2022-03-15 19:41:57,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:41:57,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:57,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:57,278 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:41:57,279 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:41:57,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:41:57,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:57,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:41:57,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:57,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:57,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:41:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:57,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:41:57,946 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:41:57,946 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 47 treesize of output 13 [2022-03-15 19:41:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:58,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:58,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1262) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:41:58,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1262) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)))) is different from false [2022-03-15 19:41:58,288 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1262) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:41:58,326 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:41:58,327 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 404 treesize of output 396 [2022-03-15 19:41:58,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:41:58,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:58,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 238 [2022-03-15 19:41:58,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:41:58,370 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:58,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 300 treesize of output 255 [2022-03-15 19:41:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:41:58,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511188059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:58,955 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:58,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 16] total 49 [2022-03-15 19:41:58,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542244522] [2022-03-15 19:41:58,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:58,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:58,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 194 transitions. [2022-03-15 19:41:58,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:03,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [86141#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 86127#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 86139#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< 0 (* ~front~0 4)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 86136#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (<= ~front~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~front~0 1)) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (<= ~front~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~front~0 1)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 86124#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86118#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 86138#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 86132#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86135#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 86121#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 86130#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 86119#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 86128#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 86137#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 86133#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86131#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 86125#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86126#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86134#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 86120#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 86046#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 86122#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0))), 86142#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< 0 (* ~front~0 4)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 86123#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 86140#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 86129#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0)))] [2022-03-15 19:42:03,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:42:03,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:42:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=4489, Unknown=3, NotChecked=426, Total=5550 [2022-03-15 19:42:03,915 INFO L87 Difference]: Start difference. First operand 945 states and 2489 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:23,779 INFO L93 Difference]: Finished difference Result 4714 states and 11476 transitions. [2022-03-15 19:42:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-03-15 19:42:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 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 33 [2022-03-15 19:42:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:23,785 INFO L225 Difference]: With dead ends: 4714 [2022-03-15 19:42:23,785 INFO L226 Difference]: Without dead ends: 4193 [2022-03-15 19:42:23,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 235 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 17352 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=7143, Invalid=47388, Unknown=3, NotChecked=1398, Total=55932 [2022-03-15 19:42:23,788 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 988 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 3821 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:23,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [988 Valid, 2 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3821 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 19:42:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2022-03-15 19:42:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 969. [2022-03-15 19:42:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 2.645661157024793) internal successors, (2561), 968 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2561 transitions. [2022-03-15 19:42:23,812 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2561 transitions. Word has length 33 [2022-03-15 19:42:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:23,812 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 2561 transitions. [2022-03-15 19:42:23,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2561 transitions. [2022-03-15 19:42:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:23,813 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:23,814 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:23,830 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:42:24,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:42:24,022 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:42:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 827274921, now seen corresponding path program 23 times [2022-03-15 19:42:24,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:24,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481040211] [2022-03-15 19:42:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:25,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:25,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481040211] [2022-03-15 19:42:25,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481040211] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:25,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833835044] [2022-03-15 19:42:25,036 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:42:25,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:25,037 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:42:25,038 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:42:25,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:42:25,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:25,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:42:25,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:42:25,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:42:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:42:25,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:42:25,661 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:42:25,661 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 47 treesize of output 13 [2022-03-15 19:42:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:42:25,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:25,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1320) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0)) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))) is different from false [2022-03-15 19:42:26,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1320) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= 1 (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4)))))))) is different from false [2022-03-15 19:42:26,015 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1320) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= 1 (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))))))))) is different from false [2022-03-15 19:42:26,068 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:42:26,068 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 198 treesize of output 216 [2022-03-15 19:42:26,085 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:42:26,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 160 treesize of output 146 [2022-03-15 19:42:26,103 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:42:26,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 93 treesize of output 99 [2022-03-15 19:42:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:42:26,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833835044] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:26,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:26,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 48 [2022-03-15 19:42:26,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919703588] [2022-03-15 19:42:26,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:26,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:26,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 150 transitions. [2022-03-15 19:42:26,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:29,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [93370#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 93377#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 93368#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 93378#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 93373#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 93367#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 93374#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 93371#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 93361#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)), 93375#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 93381#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 93363#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 93369#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 93376#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 4)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 93291#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 93360#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 93362#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 93364#(and (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 93379#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 93372#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 93365#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 93380#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 93366#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:42:29,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:42:29,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:29,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:42:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=4101, Unknown=3, NotChecked=402, Total=4970 [2022-03-15 19:42:29,735 INFO L87 Difference]: Start difference. First operand 969 states and 2561 transitions. Second operand has 42 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:49,984 INFO L93 Difference]: Finished difference Result 3405 states and 7998 transitions. [2022-03-15 19:42:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 19:42:49,984 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 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 33 [2022-03-15 19:42:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:49,988 INFO L225 Difference]: With dead ends: 3405 [2022-03-15 19:42:49,989 INFO L226 Difference]: Without dead ends: 3052 [2022-03-15 19:42:49,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 238 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18495 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=6066, Invalid=49875, Unknown=3, NotChecked=1416, Total=57360 [2022-03-15 19:42:49,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1000 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 5899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:49,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1000 Valid, 6 Invalid, 5899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:42:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2022-03-15 19:42:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 937. [2022-03-15 19:42:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 936 states have (on average 2.6538461538461537) internal successors, (2484), 936 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2484 transitions. [2022-03-15 19:42:50,011 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2484 transitions. Word has length 33 [2022-03-15 19:42:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:50,011 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 2484 transitions. [2022-03-15 19:42:50,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5714285714285716) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2484 transitions. [2022-03-15 19:42:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:50,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:50,013 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:50,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:50,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:50,215 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:42:50,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2040569453, now seen corresponding path program 24 times [2022-03-15 19:42:50,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:50,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16711321] [2022-03-15 19:42:50,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:51,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:51,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16711321] [2022-03-15 19:42:51,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16711321] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:51,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908702420] [2022-03-15 19:42:51,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:42:51,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:51,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:51,033 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:42:51,034 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:42:51,152 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:42:51,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:51,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:42:51,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:51,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:42:51,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:42:51,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:42:51,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:42:51,673 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:42:51,673 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 47 treesize of output 13 [2022-03-15 19:42:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:42:51,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:51,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1378 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1378) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:42:51,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1378 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1378) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:42:52,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1377 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1377))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1378) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:42:52,031 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1377 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1377))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1378) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:42:52,067 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:42:52,067 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 280 treesize of output 265 [2022-03-15 19:42:52,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 184 treesize of output 156 [2022-03-15 19:42:52,091 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:42:52,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 181 treesize of output 162 [2022-03-15 19:42:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-03-15 19:42:52,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908702420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:52,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:52,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 15] total 48 [2022-03-15 19:42:52,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404448870] [2022-03-15 19:42:52,601 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:52,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:52,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 147 transitions. [2022-03-15 19:42:52,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:55,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [99244#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 99243#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 99247#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 99251#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 99248#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 99253#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 99254#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 99240#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 99252#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 99246#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 99169#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 99256#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 99242#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 99245#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 99250#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 99249#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 99255#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 99241#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)))] [2022-03-15 19:42:55,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:42:55,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:42:55,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3408, Unknown=5, NotChecked=492, Total=4290 [2022-03-15 19:42:55,659 INFO L87 Difference]: Start difference. First operand 937 states and 2484 transitions. Second operand has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call 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:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:07,457 INFO L93 Difference]: Finished difference Result 3380 states and 8390 transitions. [2022-03-15 19:43:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:43:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:07,461 INFO L225 Difference]: With dead ends: 3380 [2022-03-15 19:43:07,461 INFO L226 Difference]: Without dead ends: 2973 [2022-03-15 19:43:07,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 169 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3443, Invalid=24290, Unknown=5, NotChecked=1332, Total=29070 [2022-03-15 19:43:07,463 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 584 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:07,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 6 Invalid, 4488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:43:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-03-15 19:43:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 931. [2022-03-15 19:43:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 930 states have (on average 2.649462365591398) internal successors, (2464), 930 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call 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:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2464 transitions. [2022-03-15 19:43:07,481 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2464 transitions. Word has length 33 [2022-03-15 19:43:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:07,481 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 2464 transitions. [2022-03-15 19:43:07,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call 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:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2464 transitions. [2022-03-15 19:43:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:07,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:07,483 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:07,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:07,683 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,SelfDestructingSolverStorable27 [2022-03-15 19:43:07,685 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:07,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1480902837, now seen corresponding path program 25 times [2022-03-15 19:43:07,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:07,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793969270] [2022-03-15 19:43:07,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:08,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:08,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793969270] [2022-03-15 19:43:08,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793969270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:08,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672038404] [2022-03-15 19:43:08,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:43:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:08,565 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:43:08,565 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:43:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:08,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:43:08,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:09,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:09,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:43:09,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:09,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:43:09,266 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:09,266 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 47 treesize of output 13 [2022-03-15 19:43:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:09,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:09,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:43:09,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:43:09,684 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1435))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1436) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-03-15 19:43:09,722 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:43:09,723 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 524 treesize of output 459 [2022-03-15 19:43:09,742 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:43:09,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 403 treesize of output 346 [2022-03-15 19:43:09,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 302 treesize of output 246 [2022-03-15 19:43:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-03-15 19:43:10,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672038404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:10,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:10,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 16] total 50 [2022-03-15 19:43:10,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888173580] [2022-03-15 19:43:10,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:10,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:10,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 95 transitions. [2022-03-15 19:43:10,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:12,061 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [104959#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 104883#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 104963#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))), 104957#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 104954#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 104955#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 104956#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) ~queue~0.offset) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 104960#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 104958#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 104961#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 104953#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 104962#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 104952#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))] [2022-03-15 19:43:12,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:43:12,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:43:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3249, Unknown=5, NotChecked=354, Total=3906 [2022-03-15 19:43:12,062 INFO L87 Difference]: Start difference. First operand 931 states and 2464 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 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:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:19,355 INFO L93 Difference]: Finished difference Result 2353 states and 5791 transitions. [2022-03-15 19:43:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 19:43:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 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) Word has length 33 [2022-03-15 19:43:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:19,358 INFO L225 Difference]: With dead ends: 2353 [2022-03-15 19:43:19,358 INFO L226 Difference]: Without dead ends: 2105 [2022-03-15 19:43:19,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4972 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2000, Invalid=17467, Unknown=5, NotChecked=834, Total=20306 [2022-03-15 19:43:19,360 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 496 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:19,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 7 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:43:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2022-03-15 19:43:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 894. [2022-03-15 19:43:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 2.653975363941769) internal successors, (2370), 893 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call 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:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 2370 transitions. [2022-03-15 19:43:19,375 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 2370 transitions. Word has length 33 [2022-03-15 19:43:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:19,375 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 2370 transitions. [2022-03-15 19:43:19,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 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:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 2370 transitions. [2022-03-15 19:43:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:43:19,377 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:19,377 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:19,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 19:43:19,577 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,SelfDestructingSolverStorable28 [2022-03-15 19:43:19,577 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1337703784, now seen corresponding path program 26 times [2022-03-15 19:43:19,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:19,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473977823] [2022-03-15 19:43:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:43:19,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:19,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473977823] [2022-03-15 19:43:19,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473977823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:19,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91195471] [2022-03-15 19:43:19,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:19,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:19,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:19,613 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:43:19,614 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:43:19,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:19,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:19,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:43:19,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:43:19,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:43:19,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91195471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:19,916 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:19,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2022-03-15 19:43:19,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304423902] [2022-03-15 19:43:19,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:19,920 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:19,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 211 transitions. [2022-03-15 19:43:19,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:20,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [109408#(or (<= ~back~0 ~front~0) (< ~front~0 0)), 109474#(or (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 109473#(or (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0))] [2022-03-15 19:43:20,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:43:20,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:43:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:43:20,772 INFO L87 Difference]: Start difference. First operand 894 states and 2370 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:20,845 INFO L93 Difference]: Finished difference Result 1404 states and 3643 transitions. [2022-03-15 19:43:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:43:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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 34 [2022-03-15 19:43:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:20,847 INFO L225 Difference]: With dead ends: 1404 [2022-03-15 19:43:20,847 INFO L226 Difference]: Without dead ends: 1320 [2022-03-15 19:43:20,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:43:20,848 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 70 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:20,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 14 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-03-15 19:43:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1010. [2022-03-15 19:43:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 2.6005946481665014) internal successors, (2624), 1009 states have internal predecessors, (2624), 0 states have call successors, (0), 0 states have call 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:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2624 transitions. [2022-03-15 19:43:20,862 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2624 transitions. Word has length 34 [2022-03-15 19:43:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:20,862 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 2624 transitions. [2022-03-15 19:43:20,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call 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:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2624 transitions. [2022-03-15 19:43:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:43:20,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:20,863 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:20,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:21,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:21,064 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -946030163, now seen corresponding path program 27 times [2022-03-15 19:43:21,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:21,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545176888] [2022-03-15 19:43:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:21,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:21,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545176888] [2022-03-15 19:43:21,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545176888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:21,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943037073] [2022-03-15 19:43:21,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:21,791 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:43:21,792 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:43:21,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:43:21,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:21,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:43:21,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:22,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:22,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:43:22,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:22,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:43:22,526 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:22,526 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 47 treesize of output 13 [2022-03-15 19:43:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:43:22,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:22,820 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1546 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1546) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0))) is different from false [2022-03-15 19:43:22,838 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1545) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1546) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 19:43:22,972 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:43:22,973 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 255 treesize of output 256 [2022-03-15 19:43:22,980 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:22,981 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 196 treesize of output 144 [2022-03-15 19:43:22,986 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:22,987 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 144 treesize of output 118 [2022-03-15 19:43:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2022-03-15 19:43:23,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943037073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:23,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:23,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-03-15 19:43:23,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735855721] [2022-03-15 19:43:23,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:23,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:23,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 163 transitions. [2022-03-15 19:43:23,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:25,751 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [113157#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 113154#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)))), 113145#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 113146#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 113144#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 113158#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 113159#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 113152#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 113150#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 113155#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 113156#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 113151#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 113149#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 113153#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 113148#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 113147#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:43:25,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:43:25,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:43:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=3237, Unknown=2, NotChecked=238, Total=3906 [2022-03-15 19:43:25,752 INFO L87 Difference]: Start difference. First operand 1010 states and 2624 transitions. Second operand has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:40,164 INFO L93 Difference]: Finished difference Result 3945 states and 10316 transitions. [2022-03-15 19:43:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-15 19:43:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 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 34 [2022-03-15 19:43:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:40,169 INFO L225 Difference]: With dead ends: 3945 [2022-03-15 19:43:40,169 INFO L226 Difference]: Without dead ends: 3514 [2022-03-15 19:43:40,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 185 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10619 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=4574, Invalid=29472, Unknown=2, NotChecked=734, Total=34782 [2022-03-15 19:43:40,171 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 760 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:40,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 6 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:43:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-03-15 19:43:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 1111. [2022-03-15 19:43:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 2.5945945945945947) internal successors, (2880), 1110 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call 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:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2880 transitions. [2022-03-15 19:43:40,195 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2880 transitions. Word has length 34 [2022-03-15 19:43:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:40,195 INFO L470 AbstractCegarLoop]: Abstraction has 1111 states and 2880 transitions. [2022-03-15 19:43:40,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2880 transitions. [2022-03-15 19:43:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:43:40,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:40,197 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:40,215 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:43:40,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:40,411 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 441645239, now seen corresponding path program 28 times [2022-03-15 19:43:40,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:40,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857556041] [2022-03-15 19:43:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:41,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:41,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857556041] [2022-03-15 19:43:41,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857556041] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:41,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760077345] [2022-03-15 19:43:41,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:41,394 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:43:41,394 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:43:41,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:41,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:41,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:43:41,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:41,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:41,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:43:42,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:42,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:43:42,143 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:42,143 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 47 treesize of output 13 [2022-03-15 19:43:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:42,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:42,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1608 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1608) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:43:42,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1608 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1608) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:43:42,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1608 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1608) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) c_~W~0)) is different from false [2022-03-15 19:43:42,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1607)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1608) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 19:43:42,528 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:43:42,528 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 259 treesize of output 244 [2022-03-15 19:43:42,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 184 treesize of output 156 [2022-03-15 19:43:42,539 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:42,539 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 156 treesize of output 118 [2022-03-15 19:43:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 6 not checked. [2022-03-15 19:43:43,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760077345] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:43,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:43,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 16] total 52 [2022-03-15 19:43:43,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097500734] [2022-03-15 19:43:43,004 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:43,008 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:43,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 140 transitions. [2022-03-15 19:43:43,030 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:45,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [119838#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 119751#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 119835#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 119832#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 119831#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 119829#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 119826#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 119828#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 119836#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 119833#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 119834#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (<= |thread2Thread1of1ForFork2_~temp~0#1| 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 119839#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (not (= (mod ~v_assert~0 256) 0)))), 119827#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 119837#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 119830#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))))] [2022-03-15 19:43:45,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:43:45,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:43:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=3466, Unknown=4, NotChecked=500, Total=4422 [2022-03-15 19:43:45,211 INFO L87 Difference]: Start difference. First operand 1111 states and 2880 transitions. Second operand has 36 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:58,116 INFO L93 Difference]: Finished difference Result 3250 states and 8465 transitions. [2022-03-15 19:43:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 19:43:58,116 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 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 34 [2022-03-15 19:43:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:58,120 INFO L225 Difference]: With dead ends: 3250 [2022-03-15 19:43:58,121 INFO L226 Difference]: Without dead ends: 2886 [2022-03-15 19:43:58,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9080 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=4226, Invalid=25888, Unknown=4, NotChecked=1388, Total=31506 [2022-03-15 19:43:58,123 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 728 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:58,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 6 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:43:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2022-03-15 19:43:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1062. [2022-03-15 19:43:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 2.587181903864279) internal successors, (2745), 1061 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call 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,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 2745 transitions. [2022-03-15 19:43:58,153 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 2745 transitions. Word has length 34 [2022-03-15 19:43:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:58,153 INFO L470 AbstractCegarLoop]: Abstraction has 1062 states and 2745 transitions. [2022-03-15 19:43:58,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.75) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call 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,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 2745 transitions. [2022-03-15 19:43:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:43:58,155 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:58,155 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:58,171 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:43:58,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:58,358 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 200337611, now seen corresponding path program 29 times [2022-03-15 19:43:58,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:58,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703036588] [2022-03-15 19:43:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:59,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:59,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703036588] [2022-03-15 19:43:59,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703036588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:59,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669179914] [2022-03-15 19:43:59,268 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:43:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:59,269 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:43:59,269 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:43:59,393 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:43:59,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:59,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:43:59,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:59,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:59,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:59,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:59,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:59,940 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:43:59,940 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 47 treesize of output 13 [2022-03-15 19:44:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:00,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:00,305 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1670 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1670) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:44:00,320 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1669) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1670) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:44:00,401 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:44:00,401 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 198 treesize of output 216 [2022-03-15 19:44:00,419 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:44:00,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 160 treesize of output 146 [2022-03-15 19:44:00,438 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:44:00,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 93 treesize of output 99 [2022-03-15 19:44:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:44:01,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669179914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:01,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:01,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2022-03-15 19:44:01,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520224043] [2022-03-15 19:44:01,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:01,315 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:01,348 INFO L252 McrAutomatonBuilder]: Finished intersection with 105 states and 195 transitions. [2022-03-15 19:44:01,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:06,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [125685#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 125689#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125687#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0))), 125698#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 125707#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 125693#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125700#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 125704#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 125686#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 125703#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (<= ~back~0 1)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 125702#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 125697#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 125696#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 125608#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 125695#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125683#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 125692#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 125690#(or (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125684#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 125691#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (< 1 |thread1Thread1of1ForFork1_~w~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) ~queue~0.offset)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 125694#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125706#(or (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 125688#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 125699#(and (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 125705#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 125701#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)))] [2022-03-15 19:44:06,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:44:06,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:44:06,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=4502, Unknown=4, NotChecked=282, Total=5402 [2022-03-15 19:44:06,023 INFO L87 Difference]: Start difference. First operand 1062 states and 2745 transitions. Second operand has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call 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:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:27,405 INFO L93 Difference]: Finished difference Result 6033 states and 14672 transitions. [2022-03-15 19:44:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-03-15 19:44:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 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 34 [2022-03-15 19:44:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:27,412 INFO L225 Difference]: With dead ends: 6033 [2022-03-15 19:44:27,412 INFO L226 Difference]: Without dead ends: 5336 [2022-03-15 19:44:27,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 245 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 19724 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=7986, Invalid=51798, Unknown=4, NotChecked=974, Total=60762 [2022-03-15 19:44:27,415 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 936 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 5003 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 5003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:27,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 4 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 5003 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 19:44:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2022-03-15 19:44:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 1095. [2022-03-15 19:44:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 2.59963436928702) internal successors, (2844), 1094 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call 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:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 2844 transitions. [2022-03-15 19:44:27,467 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 2844 transitions. Word has length 34 [2022-03-15 19:44:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:27,467 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 2844 transitions. [2022-03-15 19:44:27,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9565217391304346) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call 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:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 2844 transitions. [2022-03-15 19:44:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:44:27,470 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:27,470 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:27,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:27,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:27,679 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 350024973, now seen corresponding path program 30 times [2022-03-15 19:44:27,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:27,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984105883] [2022-03-15 19:44:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:28,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:28,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984105883] [2022-03-15 19:44:28,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984105883] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:28,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900737746] [2022-03-15 19:44:28,574 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:28,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:28,575 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:44:28,576 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:44:28,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:44:28,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:28,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:44:28,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:29,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:29,361 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:29,362 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 47 treesize of output 13 [2022-03-15 19:44:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:29,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:29,771 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1732 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1732) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:44:29,788 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1731) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1732) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:44:29,881 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:44:29,881 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 404 treesize of output 396 [2022-03-15 19:44:29,901 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:44:29,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 340 treesize of output 286 [2022-03-15 19:44:29,919 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:44:29,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 260 treesize of output 246 [2022-03-15 19:44:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:44:31,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900737746] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:31,142 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:31,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 16] total 52 [2022-03-15 19:44:31,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457252054] [2022-03-15 19:44:31,142 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:31,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:31,170 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 151 transitions. [2022-03-15 19:44:31,170 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:35,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [134540#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))), 134550#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134547#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134534#(and (or (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 134528#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 134532#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 134536#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 134548#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134531#(and (or (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 134539#(and (or (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134546#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134529#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (<= 2 ~W~0)), 134537#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134541#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)) (or (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 134549#(and (<= 2 ~W~0) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2)) (= ~queue~0.offset 0) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2))), 134530#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 134542#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134544#(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 (< ~back~0 0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~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)) ~d~0) 2) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~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)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2) (<= ~n~0 ~back~0))), 134543#(and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134533#(and (or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 134535#(and (or (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 134545#(and (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)) ~d~0) 2) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 134538#(and (or (<= (+ ~back~0 1) ~front~0) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)))] [2022-03-15 19:44:35,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:44:35,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:44:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=4852, Unknown=5, NotChecked=290, Total=5700 [2022-03-15 19:44:35,410 INFO L87 Difference]: Start difference. First operand 1095 states and 2844 transitions. Second operand has 43 states, 43 states have (on average 2.5813953488372094) internal successors, (111), 42 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:57,026 INFO L93 Difference]: Finished difference Result 4671 states and 10863 transitions. [2022-03-15 19:44:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-03-15 19:44:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.5813953488372094) internal successors, (111), 42 states have internal predecessors, (111), 0 states have call successors, (0), 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 34 [2022-03-15 19:44:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:57,032 INFO L225 Difference]: With dead ends: 4671 [2022-03-15 19:44:57,032 INFO L226 Difference]: Without dead ends: 4162 [2022-03-15 19:44:57,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 247 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20233 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=6663, Invalid=54102, Unknown=5, NotChecked=982, Total=61752 [2022-03-15 19:44:57,034 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 920 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 5086 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 5558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 5086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:57,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [920 Valid, 16 Invalid, 5558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 5086 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 19:44:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2022-03-15 19:44:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 1129. [2022-03-15 19:44:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 2.6382978723404253) internal successors, (2976), 1128 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call 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:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 2976 transitions. [2022-03-15 19:44:57,057 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 2976 transitions. Word has length 34 [2022-03-15 19:44:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:57,057 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 2976 transitions. [2022-03-15 19:44:57,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.5813953488372094) internal successors, (111), 42 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 2976 transitions. [2022-03-15 19:44:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:44:57,058 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:57,059 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:57,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:57,259 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,SelfDestructingSolverStorable33 [2022-03-15 19:44:57,259 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1777147895, now seen corresponding path program 31 times [2022-03-15 19:44:57,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:57,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450122972] [2022-03-15 19:44:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:58,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:58,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450122972] [2022-03-15 19:44:58,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450122972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:58,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620453604] [2022-03-15 19:44:58,197 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:58,198 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:44:58,202 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:44:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:58,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:44:58,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:58,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:58,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:58,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:58,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:44:58,932 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:44:58,932 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 47 treesize of output 13 [2022-03-15 19:44:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:59,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:59,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1794) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) c_~W~0)) is different from false [2022-03-15 19:44:59,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1794) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) c_~W~0)) is different from false [2022-03-15 19:44:59,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1793))) (let ((.cse0 (select .cse1 c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse2 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1794) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) (select .cse0 (+ c_~queue~0.offset .cse2)))) c_~W~0))))) is different from false [2022-03-15 19:44:59,260 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1793))) (let ((.cse0 (select .cse1 c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse2 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1794) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) (select .cse0 (+ c_~queue~0.offset .cse2)))) c_~W~0))))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:44:59,298 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:44:59,299 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 280 treesize of output 265 [2022-03-15 19:44:59,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 184 treesize of output 156 [2022-03-15 19:44:59,322 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:44:59,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 181 treesize of output 162 [2022-03-15 19:45:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 5 not checked. [2022-03-15 19:45:00,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620453604] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:00,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:00,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 16] total 50 [2022-03-15 19:45:00,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520988403] [2022-03-15 19:45:00,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:00,588 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:00,611 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 148 transitions. [2022-03-15 19:45:00,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:04,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [142091#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 142083#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 142078#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 142000#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 142090#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 142077#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 142080#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 142087#(and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 142089#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 142076#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 142084#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (<= |thread2Thread1of1ForFork2_~temp~0#1| 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 142088#(and (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~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)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~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)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (< 1 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 ~back~0))), 142086#(and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 142079#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 142085#(and (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 142082#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 142075#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 142081#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:45:04,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:45:04,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:45:04,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=3615, Unknown=5, NotChecked=508, Total=4556 [2022-03-15 19:45:04,343 INFO L87 Difference]: Start difference. First operand 1129 states and 2976 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:13,890 INFO L93 Difference]: Finished difference Result 4387 states and 10872 transitions. [2022-03-15 19:45:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 19:45:13,891 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 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 34 [2022-03-15 19:45:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:13,896 INFO L225 Difference]: With dead ends: 4387 [2022-03-15 19:45:13,896 INFO L226 Difference]: Without dead ends: 3820 [2022-03-15 19:45:13,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6808 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3029, Invalid=19934, Unknown=5, NotChecked=1212, Total=24180 [2022-03-15 19:45:13,897 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 465 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:13,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 2 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:45:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2022-03-15 19:45:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 1084. [2022-03-15 19:45:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 2.5964912280701755) internal successors, (2812), 1083 states have internal predecessors, (2812), 0 states have call successors, (0), 0 states have call 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:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 2812 transitions. [2022-03-15 19:45:13,921 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 2812 transitions. Word has length 34 [2022-03-15 19:45:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:13,921 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 2812 transitions. [2022-03-15 19:45:13,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 36 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call 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:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 2812 transitions. [2022-03-15 19:45:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:45:13,923 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:13,923 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:13,942 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:45:14,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:14,141 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1958152785, now seen corresponding path program 32 times [2022-03-15 19:45:14,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:14,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796038587] [2022-03-15 19:45:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:15,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:15,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796038587] [2022-03-15 19:45:15,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796038587] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:15,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594129861] [2022-03-15 19:45:15,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:15,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:15,052 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:45:15,052 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:45:15,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:15,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:15,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:45:15,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:15,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:45:15,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:15,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:45:15,794 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:15,794 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 47 treesize of output 13 [2022-03-15 19:45:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:15,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:16,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1856 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1856) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:45:16,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1855 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1856) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:45:16,180 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_1856 (Array Int Int)) (v_ArrVal_1855 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1856) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)))))) is different from false [2022-03-15 19:45:16,216 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:16,216 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 280 treesize of output 265 [2022-03-15 19:45:16,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 184 treesize of output 156 [2022-03-15 19:45:16,245 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:45:16,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 181 treesize of output 162 [2022-03-15 19:45:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 3 not checked. [2022-03-15 19:45:16,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594129861] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:16,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:16,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 16] total 52 [2022-03-15 19:45:16,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832344332] [2022-03-15 19:45:16,863 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:16,866 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:16,883 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 96 transitions. [2022-03-15 19:45:16,884 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:18,198 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [149085#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))), 149077#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 149083#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 149081#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 149076#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 149002#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 149075#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 149084#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 149078#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 149074#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 149080#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 149079#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 149082#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:45:18,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:45:18,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:45:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3474, Unknown=4, NotChecked=366, Total=4160 [2022-03-15 19:45:18,199 INFO L87 Difference]: Start difference. First operand 1084 states and 2812 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:25,716 INFO L93 Difference]: Finished difference Result 3190 states and 7753 transitions. [2022-03-15 19:45:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 19:45:25,716 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 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 34 [2022-03-15 19:45:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:25,719 INFO L225 Difference]: With dead ends: 3190 [2022-03-15 19:45:25,720 INFO L226 Difference]: Without dead ends: 2846 [2022-03-15 19:45:25,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5012 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2006, Invalid=17742, Unknown=4, NotChecked=840, Total=20592 [2022-03-15 19:45:25,721 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 411 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 3892 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 3892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:25,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 7 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 3892 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 19:45:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2022-03-15 19:45:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1041. [2022-03-15 19:45:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1040 states have (on average 2.5961538461538463) internal successors, (2700), 1040 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call 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,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2700 transitions. [2022-03-15 19:45:25,738 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 2700 transitions. Word has length 34 [2022-03-15 19:45:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:25,738 INFO L470 AbstractCegarLoop]: Abstraction has 1041 states and 2700 transitions. [2022-03-15 19:45:25,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 2700 transitions. [2022-03-15 19:45:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:25,739 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:25,739 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:25,756 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:45:25,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:25,940 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1439090633, now seen corresponding path program 33 times [2022-03-15 19:45:25,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:25,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136147877] [2022-03-15 19:45:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:26,869 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:45:26,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:26,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136147877] [2022-03-15 19:45:26,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136147877] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:26,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615752200] [2022-03-15 19:45:26,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:26,871 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:45:26,872 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:45:27,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:45:27,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:27,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:45:27,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:27,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:27,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:45:27,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:27,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:45:27,689 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:27,690 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 47 treesize of output 13 [2022-03-15 19:45:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:45:27,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:28,001 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1922 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1922) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:45:28,011 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1921) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1922) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))) is different from false [2022-03-15 19:45:28,142 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:28,143 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 135 treesize of output 153 [2022-03-15 19:45:28,149 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:28,149 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 93 treesize of output 67 [2022-03-15 19:45:28,155 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:28,155 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 39 treesize of output 26 [2022-03-15 19:45:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2022-03-15 19:45:28,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615752200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:28,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:28,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 49 [2022-03-15 19:45:28,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291852801] [2022-03-15 19:45:28,498 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:28,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:28,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 164 transitions. [2022-03-15 19:45:28,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:32,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [154782#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 2 ~W~0) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))), 154774#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 154783#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 2 ~W~0) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154771#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 154775#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 154776#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 154780#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154787#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 154785#(and (or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= 2 ~W~0) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154778#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154772#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 154770#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (<= 2 ~W~0)), 154777#(and (or (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154779#(and (or (<= 2 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))), 154773#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ ~d~0 1) ~W~0)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= |thread2Thread1of1ForFork2_~temp~0#1| 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= (+ ~d~0 1) ~W~0))), 154781#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 154784#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 2 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= 2 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (not (= (mod ~v_assert~0 256) 0)))), 154786#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 2 ~W~0) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)))] [2022-03-15 19:45:32,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:45:32,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:45:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=3790, Unknown=2, NotChecked=258, Total=4556 [2022-03-15 19:45:32,501 INFO L87 Difference]: Start difference. First operand 1041 states and 2700 transitions. Second operand has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:48,072 INFO L93 Difference]: Finished difference Result 3491 states and 9089 transitions. [2022-03-15 19:45:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-03-15 19:45:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:48,076 INFO L225 Difference]: With dead ends: 3491 [2022-03-15 19:45:48,076 INFO L226 Difference]: Without dead ends: 3115 [2022-03-15 19:45:48,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12329 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=4839, Invalid=32223, Unknown=2, NotChecked=766, Total=37830 [2022-03-15 19:45:48,078 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 858 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:48,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 17 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:45:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2022-03-15 19:45:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 1093. [2022-03-15 19:45:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 2.5833333333333335) internal successors, (2821), 1092 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call 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:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2821 transitions. [2022-03-15 19:45:48,098 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 2821 transitions. Word has length 35 [2022-03-15 19:45:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:48,098 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 2821 transitions. [2022-03-15 19:45:48,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.948717948717949) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 2821 transitions. [2022-03-15 19:45:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:48,100 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:48,100 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:48,119 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:45:48,309 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,SelfDestructingSolverStorable36 [2022-03-15 19:45:48,310 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1559821527, now seen corresponding path program 34 times [2022-03-15 19:45:48,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:48,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406007040] [2022-03-15 19:45:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:49,185 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:45:49,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:49,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406007040] [2022-03-15 19:45:49,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406007040] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:49,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449116271] [2022-03-15 19:45:49,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:49,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:49,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:49,187 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:45:49,196 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:45:49,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:49,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:49,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:45:49,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:49,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:49,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:45:49,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:49,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:45:49,932 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:49,933 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 47 treesize of output 13 [2022-03-15 19:45:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:50,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:50,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1988) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)))) is different from false [2022-03-15 19:45:50,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1988) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) is different from false [2022-03-15 19:45:50,289 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1987 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1988) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:45:50,326 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:50,327 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 198 treesize of output 216 [2022-03-15 19:45:50,345 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:45:50,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 160 treesize of output 146 [2022-03-15 19:45:50,363 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:45:50,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 93 treesize of output 99 [2022-03-15 19:45:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2022-03-15 19:45:51,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449116271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:51,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:51,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 16] total 53 [2022-03-15 19:45:51,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130819412] [2022-03-15 19:45:51,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:51,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:51,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 152 transitions. [2022-03-15 19:45:51,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:53,739 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [160978#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 160994#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 160992#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 160902#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 160980#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)), 160977#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 160981#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 160984#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 160989#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 160997#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 160979#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 160987#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 160983#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 160990#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 160998#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 160996#(and (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 160982#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 160995#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 160985#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 160986#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 160991#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 160993#(and (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 160988#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))] [2022-03-15 19:45:53,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:45:53,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:45:53,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=4703, Unknown=3, NotChecked=432, Total=5700 [2022-03-15 19:45:53,740 INFO L87 Difference]: Start difference. First operand 1093 states and 2821 transitions. Second operand has 44 states, 44 states have (on average 2.5) internal successors, (110), 43 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call 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:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:11,203 INFO L93 Difference]: Finished difference Result 4613 states and 10722 transitions. [2022-03-15 19:46:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-03-15 19:46:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5) internal successors, (110), 43 states have internal predecessors, (110), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:11,209 INFO L225 Difference]: With dead ends: 4613 [2022-03-15 19:46:11,209 INFO L226 Difference]: Without dead ends: 4128 [2022-03-15 19:46:11,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 253 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 21036 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=7135, Invalid=56126, Unknown=3, NotChecked=1506, Total=64770 [2022-03-15 19:46:11,211 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1375 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:11,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1375 Valid, 2 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 19:46:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2022-03-15 19:46:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 1085. [2022-03-15 19:46:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 2.595940959409594) internal successors, (2814), 1084 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call 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:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 2814 transitions. [2022-03-15 19:46:11,235 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 2814 transitions. Word has length 35 [2022-03-15 19:46:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:11,235 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 2814 transitions. [2022-03-15 19:46:11,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5) internal successors, (110), 43 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call 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:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 2814 transitions. [2022-03-15 19:46:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:11,237 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:11,237 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:11,272 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:11,455 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,SelfDestructingSolverStorable37 [2022-03-15 19:46:11,455 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 426968011, now seen corresponding path program 35 times [2022-03-15 19:46:11,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:11,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219130190] [2022-03-15 19:46:11,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:13,022 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:13,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:13,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219130190] [2022-03-15 19:46:13,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219130190] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:13,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762011704] [2022-03-15 19:46:13,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:13,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:13,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:13,023 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:13,024 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:13,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:46:13,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:13,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:46:13,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:13,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:13,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:46:13,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:13,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:46:13,978 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:13,978 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 47 treesize of output 13 [2022-03-15 19:46:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:14,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:14,220 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2054 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2054) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-03-15 19:46:14,226 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_2054 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2054) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0))) is different from false [2022-03-15 19:46:14,393 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2053))) (let ((.cse0 (select .cse1 c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse2 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2054) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) (select .cse0 (+ c_~queue~0.offset .cse2)))) c_~W~0))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:46:14,487 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:14,487 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 280 treesize of output 265 [2022-03-15 19:46:14,505 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:46:14,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 209 treesize of output 190 [2022-03-15 19:46:14,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 146 treesize of output 118 [2022-03-15 19:46:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 1 not checked. [2022-03-15 19:46:15,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762011704] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:15,335 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:15,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 16] total 53 [2022-03-15 19:46:15,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394205259] [2022-03-15 19:46:15,336 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:15,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:15,356 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 97 transitions. [2022-03-15 19:46:15,356 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:17,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [168398#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 168405#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 168406#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (= ~queue~0.offset 0)), 168399#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 168401#(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 (< ~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0))), 168408#(and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 8) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 (- 4)) (* ~front~0 4) 12)))) (<= (+ 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 (- 4)) (* ~front~0 4) 12))) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= 0 ~front~0) (not (<= ~back~0 1)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (not (<= ~back~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= (+ 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~back~0 (- 4)) (* ~front~0 4) 12))) ~W~0) (= (+ (* ~back~0 8) ~queue~0.offset) (+ (* ~front~0 4) 12)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= (+ ~queue~0.offset (* ~back~0 4)) 8) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 168403#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (< 1 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 168404#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 168400#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 168407#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= 2 ~W~0) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) ~W~0) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= 2 ~W~0) (< 1 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= 2 ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 168402#(and (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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 168409#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))] [2022-03-15 19:46:17,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:46:17,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:46:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3580, Unknown=9, NotChecked=372, Total=4290 [2022-03-15 19:46:17,718 INFO L87 Difference]: Start difference. First operand 1085 states and 2814 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:32,830 INFO L93 Difference]: Finished difference Result 3586 states and 8588 transitions. [2022-03-15 19:46:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-03-15 19:46:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:32,834 INFO L225 Difference]: With dead ends: 3586 [2022-03-15 19:46:32,834 INFO L226 Difference]: Without dead ends: 3226 [2022-03-15 19:46:32,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8016 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=2861, Invalid=25872, Unknown=9, NotChecked=1014, Total=29756 [2022-03-15 19:46:32,836 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 835 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:32,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 2 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:46:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-03-15 19:46:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 1042. [2022-03-15 19:46:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 2.595581171950048) internal successors, (2702), 1041 states have internal predecessors, (2702), 0 states have call successors, (0), 0 states have call 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:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2702 transitions. [2022-03-15 19:46:32,855 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2702 transitions. Word has length 35 [2022-03-15 19:46:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:32,855 INFO L470 AbstractCegarLoop]: Abstraction has 1042 states and 2702 transitions. [2022-03-15 19:46:32,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2702 transitions. [2022-03-15 19:46:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:46:32,857 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:32,857 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:32,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:33,073 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,SelfDestructingSolverStorable38 [2022-03-15 19:46:33,073 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -858707769, now seen corresponding path program 36 times [2022-03-15 19:46:33,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:33,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488501742] [2022-03-15 19:46:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:33,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:46:33,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:33,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488501742] [2022-03-15 19:46:33,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488501742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:33,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973521389] [2022-03-15 19:46:33,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:33,117 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:33,118 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:33,271 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:46:33,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:33,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:46:33,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:46:33,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:46:33,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973521389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:33,509 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:33,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:46:33,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017847990] [2022-03-15 19:46:33,509 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:33,512 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:33,587 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 230 transitions. [2022-03-15 19:46:33,587 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:34,058 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:34,429 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [174522#(or (<= ~n~0 0) (<= ~back~0 0)), 174466#(or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)))] [2022-03-15 19:46:34,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:46:34,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:34,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:46:34,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:46:34,429 INFO L87 Difference]: Start difference. First operand 1042 states and 2702 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call 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:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:34,533 INFO L93 Difference]: Finished difference Result 1100 states and 2780 transitions. [2022-03-15 19:46:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:46:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 36 [2022-03-15 19:46:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:34,534 INFO L225 Difference]: With dead ends: 1100 [2022-03-15 19:46:34,534 INFO L226 Difference]: Without dead ends: 881 [2022-03-15 19:46:34,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:46:34,535 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:34,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:46:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-03-15 19:46:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-03-15 19:46:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.6295454545454544) internal successors, (2314), 880 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call 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:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2314 transitions. [2022-03-15 19:46:34,544 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 2314 transitions. Word has length 36 [2022-03-15 19:46:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:34,544 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 2314 transitions. [2022-03-15 19:46:34,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call 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:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 2314 transitions. [2022-03-15 19:46:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:46:34,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:34,546 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:34,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 19:46:34,746 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,SelfDestructingSolverStorable39 [2022-03-15 19:46:34,747 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1931576019, now seen corresponding path program 37 times [2022-03-15 19:46:34,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:34,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108726673] [2022-03-15 19:46:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:36,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:36,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108726673] [2022-03-15 19:46:36,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108726673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:36,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205445085] [2022-03-15 19:46:36,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:36,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:36,465 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:36,465 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:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:36,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:46:36,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:37,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:37,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:46:37,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:37,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:46:37,388 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:37,388 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 47 treesize of output 13 [2022-03-15 19:46:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:37,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:37,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2172 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2172) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 19:46:37,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2172) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0)) is different from false [2022-03-15 19:46:37,849 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:37,850 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 255 treesize of output 256 [2022-03-15 19:46:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:46:37,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 98 treesize of output 72 [2022-03-15 19:46:37,872 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:37,872 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 170 treesize of output 118 [2022-03-15 19:46:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 2 not checked. [2022-03-15 19:46:38,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205445085] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:38,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:38,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 16] total 54 [2022-03-15 19:46:38,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409080854] [2022-03-15 19:46:38,267 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:38,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:38,296 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 165 transitions. [2022-03-15 19:46:38,297 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:41,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [177664#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 177668#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~front~0)) (or (<= 1 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 177670#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 177671#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 1 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 1 ~front~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0)))), 177669#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 1 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= 1 ~front~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0)) (or (<= (+ (* ~front~0 4) ~queue~0.offset) 4) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod ~v_assert~0 256) 0)))), 177667#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~front~0)) (or (<= 1 ~front~0) (not (= (mod ~v_assert~0 256) 0)))), 177663#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 177661#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 177666#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 177656#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 177662#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 177658#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 177665#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 177659#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 177657#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 177660#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0))] [2022-03-15 19:46:41,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:46:41,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:41,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:46:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=4123, Unknown=3, NotChecked=270, Total=4970 [2022-03-15 19:46:41,470 INFO L87 Difference]: Start difference. First operand 881 states and 2314 transitions. Second operand has 38 states, 38 states have (on average 2.973684210526316) internal successors, (113), 37 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:59,612 INFO L93 Difference]: Finished difference Result 3637 states and 9583 transitions. [2022-03-15 19:46:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-03-15 19:46:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.973684210526316) internal successors, (113), 37 states have internal predecessors, (113), 0 states have call successors, (0), 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 36 [2022-03-15 19:46:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:59,616 INFO L225 Difference]: With dead ends: 3637 [2022-03-15 19:46:59,617 INFO L226 Difference]: Without dead ends: 3206 [2022-03-15 19:46:59,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9588 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=4635, Invalid=28312, Unknown=3, NotChecked=722, Total=33672 [2022-03-15 19:46:59,618 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 544 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:59,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 2 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 19:46:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2022-03-15 19:46:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 944. [2022-03-15 19:46:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 2.638388123011665) internal successors, (2488), 943 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call 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:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2488 transitions. [2022-03-15 19:46:59,638 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 2488 transitions. Word has length 36 [2022-03-15 19:46:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:59,639 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 2488 transitions. [2022-03-15 19:46:59,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.973684210526316) internal successors, (113), 37 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 2488 transitions. [2022-03-15 19:46:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:46:59,640 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:59,640 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:59,657 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:59,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:59,841 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -543900617, now seen corresponding path program 38 times [2022-03-15 19:46:59,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:59,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228049885] [2022-03-15 19:46:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:01,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:01,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228049885] [2022-03-15 19:47:01,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228049885] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:01,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899993414] [2022-03-15 19:47:01,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:47:01,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:01,550 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:47:01,551 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:47:01,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:01,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:47:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:02,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:02,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:47:02,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:02,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:47:02,472 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:02,472 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 47 treesize of output 13 [2022-03-15 19:47:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:02,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:02,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2242) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:47:02,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 (Array Int Int))) (<= (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2242) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:47:02,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2242) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) c_~W~0)) is different from false [2022-03-15 19:47:02,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2241 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2241)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2242) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) is different from false [2022-03-15 19:47:02,883 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:02,883 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 503 treesize of output 438 [2022-03-15 19:47:02,891 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:02,891 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 378 treesize of output 302 [2022-03-15 19:47:02,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 302 treesize of output 246 [2022-03-15 19:47:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 6 not checked. [2022-03-15 19:47:03,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899993414] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:03,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:03,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 16] total 54 [2022-03-15 19:47:03,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [45505841] [2022-03-15 19:47:03,491 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:03,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:03,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 142 transitions. [2022-03-15 19:47:03,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:05,523 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [183692#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 183688#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 183690#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 183691#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 183699#(and (or (<= 0 ~front~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front~0))), 183698#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 183689#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 183697#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 183694#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 183695#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 183693#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))), 183696#(and (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)))] [2022-03-15 19:47:05,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:47:05,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:47:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=3502, Unknown=4, NotChecked=500, Total=4422 [2022-03-15 19:47:05,524 INFO L87 Difference]: Start difference. First operand 944 states and 2488 transitions. Second operand has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:21,114 INFO L93 Difference]: Finished difference Result 2932 states and 7739 transitions. [2022-03-15 19:47:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 19:47:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 19:47:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:21,118 INFO L225 Difference]: With dead ends: 2932 [2022-03-15 19:47:21,118 INFO L226 Difference]: Without dead ends: 2550 [2022-03-15 19:47:21,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6600 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3266, Invalid=20616, Unknown=4, NotChecked=1236, Total=25122 [2022-03-15 19:47:21,119 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 562 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:21,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 2 Invalid, 4304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:47:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-03-15 19:47:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 841. [2022-03-15 19:47:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 2.638095238095238) internal successors, (2216), 840 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call 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:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2216 transitions. [2022-03-15 19:47:21,134 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2216 transitions. Word has length 36 [2022-03-15 19:47:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:21,135 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 2216 transitions. [2022-03-15 19:47:21,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2216 transitions. [2022-03-15 19:47:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:47:21,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:21,136 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:21,153 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:47:21,336 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,SelfDestructingSolverStorable41 [2022-03-15 19:47:21,337 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:47:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -635520883, now seen corresponding path program 39 times [2022-03-15 19:47:21,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:21,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341281743] [2022-03-15 19:47:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:24,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:24,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341281743] [2022-03-15 19:47:24,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341281743] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:24,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9975205] [2022-03-15 19:47:24,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:24,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:24,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:24,814 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:47:24,815 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:47:24,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:47:24,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:24,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:47:24,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:25,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:25,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:25,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:25,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:25,489 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:25,490 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 47 treesize of output 13 [2022-03-15 19:47:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:47:25,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:25,847 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2312 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2312) c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:47:25,862 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2311) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2312) c_~queue~0.base))) (or (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0))))) is different from false [2022-03-15 19:47:25,952 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:25,952 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 198 treesize of output 216 [2022-03-15 19:47:25,971 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:47:25,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 160 treesize of output 146 [2022-03-15 19:47:25,989 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:47:25,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 93 treesize of output 99 [2022-03-15 19:47:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:47:26,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9975205] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:26,922 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:26,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 48 [2022-03-15 19:47:26,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1706972616] [2022-03-15 19:47:26,922 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:26,925 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:26,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 153 transitions. [2022-03-15 19:47:26,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:29,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [188768#(and (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 188766#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 188763#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 188760#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0)), 188765#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 188776#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~back~0 1)) (<= (+ ~front~0 1) ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 188775#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 188764#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 188759#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 188774#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 0 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (<= ~back~0 1)) (<= (+ ~front~0 1) ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 188778#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 188770#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 188767#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 188772#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0))), 188679#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 188758#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 188777#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 188769#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 188771#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= 1 ~front~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (<= ~front~0 ~back~0) (not (<= ~back~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 188762#(or (<= (+ ~back~0 1) ~front~0) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 188773#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~back~0 ~front~0) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)), 188761#(or (<= (+ ~back~0 1) ~front~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)) ~d~0) ~W~0) (<= ~n~0 ~back~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 188757#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))] [2022-03-15 19:47:29,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:47:29,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:47:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4134, Unknown=6, NotChecked=270, Total=4970 [2022-03-15 19:47:29,778 INFO L87 Difference]: Start difference. First operand 841 states and 2216 transitions. Second operand has 44 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:43,325 INFO L93 Difference]: Finished difference Result 4488 states and 10281 transitions. [2022-03-15 19:47:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-03-15 19:47:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 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 36 [2022-03-15 19:47:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:43,329 INFO L225 Difference]: With dead ends: 4488 [2022-03-15 19:47:43,330 INFO L226 Difference]: Without dead ends: 3927 [2022-03-15 19:47:43,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15893 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=6140, Invalid=42042, Unknown=6, NotChecked=874, Total=49062 [2022-03-15 19:47:43,332 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 996 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 4354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:43,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 3 Invalid, 4354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 3949 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:47:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2022-03-15 19:47:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 805. [2022-03-15 19:47:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.66044776119403) internal successors, (2139), 804 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call 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:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2139 transitions. [2022-03-15 19:47:43,352 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 2139 transitions. Word has length 36 [2022-03-15 19:47:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:43,353 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 2139 transitions. [2022-03-15 19:47:43,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.5681818181818183) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 2139 transitions. [2022-03-15 19:47:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:47:43,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:43,354 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:43,380 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:43,567 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,SelfDestructingSolverStorable42 [2022-03-15 19:47:43,567 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:47:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1351268655, now seen corresponding path program 40 times [2022-03-15 19:47:43,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:43,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579499758] [2022-03-15 19:47:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:44,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:44,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579499758] [2022-03-15 19:47:44,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579499758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:44,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375352302] [2022-03-15 19:47:44,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:44,862 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:44,865 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:45,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:45,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:45,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:47:45,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:45,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:45,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:45,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:45,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:47:45,740 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:45,740 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 47 treesize of output 13 [2022-03-15 19:47:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:45,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:46,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2382 (Array Int Int))) (<= (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2382) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) c_~W~0)) is different from false [2022-03-15 19:47:46,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2382 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2381))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2382) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-03-15 19:47:46,161 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2382 (Array Int Int)) (v_ArrVal_2381 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2381))) (let ((.cse2 (select .cse0 c_~queue~0.base))) (or (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2382) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse2 (+ c_~queue~0.offset .cse1)))) c_~W~0) (not (= (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-03-15 19:47:46,198 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:46,199 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 524 treesize of output 459 [2022-03-15 19:47:46,219 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:47:46,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 403 treesize of output 346 [2022-03-15 19:47:46,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 302 treesize of output 246 [2022-03-15 19:47:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2022-03-15 19:47:47,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375352302] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:47,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:47,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 16] total 56 [2022-03-15 19:47:47,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85350156] [2022-03-15 19:47:47,161 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:47,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:47,184 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 98 transitions. [2022-03-15 19:47:47,184 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:48,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [195457#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))), 195446#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 195456#(and (or (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (= (mod ~v_assert~0 256) 0)))), 195447#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 195450#(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 (< ~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)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0))), 195449#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0 1) ~W~0) (= ~queue~0.offset 0)), 195452#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 195454#(and (or (= (+ (* ~front~0 4) 4) (* ~back~0 4)) (< (* ~n~0 4) (+ (* ~back~0 4) 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 195448#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 195453#(and (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~d~0 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= (+ (- 1) |thread2Thread1of1ForFork2_~temp~0#1|) 0)) (<= 2 ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~back~0 4))) (= (* ~front~0 4) (* ~back~0 4)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 195451#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 ~back~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~d~0 1) ~W~0) (<= |thread1Thread1of1ForFork1_~w~0#1| 0)) (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) (<= |thread1Thread1of1ForFork1_~w~0#1| 0))), 195368#(<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0), 195455#(and (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:47:48,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:47:48,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:47:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3945, Unknown=6, NotChecked=390, Total=4692 [2022-03-15 19:47:48,514 INFO L87 Difference]: Start difference. First operand 805 states and 2139 transitions. Second operand has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:58,847 INFO L93 Difference]: Finished difference Result 2817 states and 6824 transitions. [2022-03-15 19:47:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 19:47:58,847 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 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 36 [2022-03-15 19:47:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:58,850 INFO L225 Difference]: With dead ends: 2817 [2022-03-15 19:47:58,850 INFO L226 Difference]: Without dead ends: 2473 [2022-03-15 19:47:58,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7308 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2821, Invalid=24907, Unknown=6, NotChecked=996, Total=28730 [2022-03-15 19:47:58,852 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 769 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:58,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 2 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:47:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-03-15 19:47:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 746. [2022-03-15 19:47:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.664429530201342) internal successors, (1985), 745 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call 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:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1985 transitions. [2022-03-15 19:47:58,874 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1985 transitions. Word has length 36 [2022-03-15 19:47:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:58,874 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1985 transitions. [2022-03-15 19:47:58,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1666666666666665) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1985 transitions. [2022-03-15 19:47:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:47:58,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:58,875 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:58,892 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:59,078 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,SelfDestructingSolverStorable43 [2022-03-15 19:47:59,078 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:47:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -179263633, now seen corresponding path program 41 times [2022-03-15 19:47:59,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:59,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077895099] [2022-03-15 19:47:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:00,009 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:48:00,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:00,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077895099] [2022-03-15 19:48:00,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077895099] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:00,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853986283] [2022-03-15 19:48:00,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:48:00,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:00,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:00,011 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:48:00,012 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:48:00,167 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:48:00,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:00,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:48:00,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:00,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 13 treesize of output 9 [2022-03-15 19:48:00,331 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:48:00,400 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:00,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:00,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:48:00,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:00,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-03-15 19:48:01,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:01,305 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:01,305 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 62 treesize of output 18 [2022-03-15 19:48:01,428 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:48:01,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:01,706 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_2441 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2441) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1)))) c_~W~0))) is different from false [2022-03-15 19:48:01,717 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2441 (Array Int Int)) (v_ArrVal_2440 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2440) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2441) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ (select .cse0 (+ c_~queue~0.offset .cse1 8)) c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))) c_~W~0)) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-03-15 19:48:02,352 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 19:48:02,352 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 228 treesize of output 133 [2022-03-15 19:48:02,421 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 19:48:02,421 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 392 treesize of output 460 [2022-03-15 19:48:02,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 266 treesize of output 186 [2022-03-15 19:48:02,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:02,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 186 treesize of output 146 [2022-03-15 19:48:02,507 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 19:48:02,507 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 157 treesize of output 237 [2022-03-15 19:48:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 19:48:04,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853986283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:04,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:04,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 59 [2022-03-15 19:48:04,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926633824] [2022-03-15 19:48:04,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:04,923 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:04,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 214 transitions. [2022-03-15 19:48:04,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:09,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [200252#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 200250#(or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 200256#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 200266#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (<= ~back~0 (+ 2 ~front~0)) (= (mod ~v_assert~0 256) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)), 200268#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 (+ ~front~0 1)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ 2 (select (select |#memory_int| ~queue~0.base) 8)) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~front~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 0 (+ ~front~0 1))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ 2 (select (select |#memory_int| ~queue~0.base) 8)) ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) 4) 1))), 200263#(and (or (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~d~0 1) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~d~0 1) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0)))), 200261#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0)))), 200258#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 200260#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 (+ 2 ~front~0)) (= (mod ~v_assert~0 256) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)), 200267#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~back~0 (+ 2 ~front~0)) (= (mod ~v_assert~0 256) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)), 200247#(and (or (<= ~d~0 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~d~0 ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 200264#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 2) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~front~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 3 (+ (* ~front~0 4) ~queue~0.offset))) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 1)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 2) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|))), 200262#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= |thread2Thread1of1ForFork2_~temp~0#1| 1)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 200246#(or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 200249#(and (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 200257#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 200255#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (<= ~back~0 (+ 2 ~front~0)) (= (mod ~v_assert~0 256) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)), 200254#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 200265#(and (or (= ~d~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 (+ ~front~0 1)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front~0 0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~queue~0.offset 0)) (or (= ~queue~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ 2 (select (select |#memory_int| ~queue~0.base) 8)) ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (= ~d~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~front~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (< 0 (+ ~front~0 1))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ 2 (select (select |#memory_int| ~queue~0.base) 8)) ~W~0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue~0.base) 4) 1) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (select (select |#memory_int| ~queue~0.base) 4) 1))), 200248#(and (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) ~W~0) (not (= (mod ~v_assert~0 256) 0)))), 200253#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< ~front~0 0)), 200251#(or (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (= (mod ~v_assert~0 256) 0) (< ~front~0 0)), 200245#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 ~front~0) (< ~front~0 0)), 200259#(or (<= ~n~0 (+ ~front~0 1)) (<= ~back~0 (+ ~front~0 1)) (<= (+ |thread2Thread1of1ForFork2_~temp~0#1| (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) ~W~0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (< ~front~0 0))] [2022-03-15 19:48:09,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:48:09,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:48:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=5940, Unknown=4, NotChecked=322, Total=6972 [2022-03-15 19:48:09,129 INFO L87 Difference]: Start difference. First operand 746 states and 1985 transitions. Second operand has 45 states, 45 states have (on average 3.2444444444444445) internal successors, (146), 44 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 19:49:15,100 WARN L244 SmtUtils]: Removed 3 from assertion stack [2022-03-15 19:49:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 400 states. [2022-03-15 19:49:15,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 470 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89956 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=21920, Invalid=198514, Unknown=4, NotChecked=1874, Total=222312 [2022-03-15 19:49:15,109 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1054 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 10687 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 11408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 10687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:15,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 3 Invalid, 11408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 10687 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-03-15 19:49:15,110 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:49:15,125 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:49:15,125 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:49:15,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 19:49:15,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:15,315 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (746states) and FLOYD_HOARE automaton (currently 400 states, 45 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 388ms.. [2022-03-15 19:49:15,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:49:15,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:49:15,317 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:49:15,318 INFO L732 BasicCegarLoop]: Path program histogram: [41, 2, 1, 1] [2022-03-15 19:49:15,319 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:49:15,320 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:49:15,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:49:15 BasicIcfg [2022-03-15 19:49:15,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:49:15,321 INFO L158 Benchmark]: Toolchain (without parser) took 737692.98ms. Allocated memory was 199.2MB in the beginning and 602.9MB in the end (delta: 403.7MB). Free memory was 148.6MB in the beginning and 290.0MB in the end (delta: -141.4MB). Peak memory consumption was 262.8MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.09ms. Allocated memory was 199.2MB in the beginning and 280.0MB in the end (delta: 80.7MB). Free memory was 148.4MB in the beginning and 254.0MB in the end (delta: -105.6MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.29ms. Allocated memory is still 280.0MB. Free memory was 254.0MB in the beginning and 251.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 280.0MB. Free memory was 251.9MB in the beginning and 250.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: RCFGBuilder took 425.02ms. Allocated memory is still 280.0MB. Free memory was 250.5MB in the beginning and 230.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 INFO L158 Benchmark]: TraceAbstraction took 736907.13ms. Allocated memory was 280.0MB in the beginning and 602.9MB in the end (delta: 323.0MB). Free memory was 230.3MB in the beginning and 290.0MB in the end (delta: -59.8MB). Peak memory consumption was 264.3MB. Max. memory is 8.0GB. [2022-03-15 19:49:15,321 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.09ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 164.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.09ms. Allocated memory was 199.2MB in the beginning and 280.0MB in the end (delta: 80.7MB). Free memory was 148.4MB in the beginning and 254.0MB in the end (delta: -105.6MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.29ms. Allocated memory is still 280.0MB. Free memory was 254.0MB in the beginning and 251.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 280.0MB. Free memory was 251.9MB in the beginning and 250.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.02ms. Allocated memory is still 280.0MB. Free memory was 250.5MB in the beginning and 230.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 736907.13ms. Allocated memory was 280.0MB in the beginning and 602.9MB in the end (delta: 323.0MB). Free memory was 230.3MB in the beginning and 290.0MB in the end (delta: -59.8MB). Peak memory consumption was 264.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 155 PlacesBefore, 36 PlacesAfterwards, 156 TransitionsBefore, 29 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 100 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 151 TotalNumberOfCompositions, 2133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1507, positive: 1419, positive conditional: 0, positive unconditional: 1419, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 610, positive: 592, positive conditional: 0, positive unconditional: 592, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1507, positive: 827, positive conditional: 0, positive unconditional: 827, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - 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: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and FLOYD_HOARE automaton (currently 400 states, 45 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 388ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and FLOYD_HOARE automaton (currently 400 states, 45 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 388ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and FLOYD_HOARE automaton (currently 400 states, 45 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 388ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (746states) and FLOYD_HOARE automaton (currently 400 states, 45 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 154 for 388ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 736.8s, OverallIterations: 45, TraceHistogramMax: 7, PathProgramHistogramMax: 41, EmptinessCheckTime: 0.1s, AutomataDifference: 503.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24379 SdHoareTripleChecker+Valid, 75.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24379 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 65.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30200 mSDsCounter, 13705 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125188 IncrementalHoareTripleChecker+Invalid, 138893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13705 mSolverCounterUnsat, 32 mSDtfsCounter, 125188 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9786 GetRequests, 2961 SyntacticMatches, 169 SemanticMatches, 6655 ConstructedPredicates, 97 IntricatePredicates, 0 DeprecatedPredicates, 442739 ImplicationChecksByTransitivity, 492.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1129occurred in iteration=34, InterpolantAutomatonStates: 4203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 44 MinimizatonAttempts, 66326 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 103.0s InterpolantComputationTime, 2740 NumberOfCodeBlocks, 2731 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 3941 ConstructedInterpolants, 279 QuantifiedInterpolants, 89375 SizeOfPredicates, 979 NumberOfNonLiveVariables, 11766 ConjunctsInSsa, 1910 ConjunctsInUnsatCore, 127 InterpolantComputations, 4 PerfectInterpolantSequences, 694/2406 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