/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:05:52,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:05:52,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:05:52,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:05:52,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:05:52,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:05:52,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:05:52,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:05:52,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:05:52,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:05:52,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:05:52,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:05:52,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:05:52,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:05:52,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:05:52,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:05:52,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:05:52,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:05:52,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:05:52,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:05:52,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:05:52,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:05:52,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:05:52,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:05:52,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:05:52,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:05:52,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:05:52,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:05:52,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:05:52,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:05:52,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:05:52,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:05:52,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:05:52,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:05:52,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:05:52,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:05:52,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:05:52,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:05:52,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:05:52,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:05:52,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:05:52,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 23:05:52,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:05:52,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:05:52,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:05:52,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:05:52,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:05:52,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:05:52,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:05:52,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:05:52,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:05:52,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:05:52,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:05:52,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:05:52,608 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:05:52,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:05:52,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 23:05:52,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:05:52,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:05:52,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:05:52,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:05:52,797 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:05:52,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-02-10 23:05:52,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3c488f6/6b22a07af7cc404ab26389baa54069c7/FLAGaa984c497 [2022-02-10 23:05:53,257 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:05:53,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-02-10 23:05:53,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3c488f6/6b22a07af7cc404ab26389baa54069c7/FLAGaa984c497 [2022-02-10 23:05:53,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3c488f6/6b22a07af7cc404ab26389baa54069c7 [2022-02-10 23:05:53,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:05:53,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:05:53,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:05:53,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:05:53,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:05:53,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e002119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53, skipping insertion in model container [2022-02-10 23:05:53,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:05:53,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:05:53,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-02-10 23:05:53,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:05:53,855 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:05:53,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-02-10 23:05:53,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:05:53,887 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:05:53,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53 WrapperNode [2022-02-10 23:05:53,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:05:53,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:05:53,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:05:53,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:05:53,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,922 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-02-10 23:05:53,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:05:53,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:05:53,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:05:53,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:05:53,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:05:53,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:05:53,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:05:53,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:05:53,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (1/1) ... [2022-02-10 23:05:53,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:05:53,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:05:53,984 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-02-10 23:05:53,999 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-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-10 23:05:54,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-10 23:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-10 23:05:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-10 23:05:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 23:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:05:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:05:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:05:54,024 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:05:54,101 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:05:54,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:05:54,396 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:05:54,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:05:54,481 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-10 23:05:54,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:05:54 BoogieIcfgContainer [2022-02-10 23:05:54,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:05:54,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:05:54,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:05:54,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:05:54,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:05:53" (1/3) ... [2022-02-10 23:05:54,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe4b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:05:54, skipping insertion in model container [2022-02-10 23:05:54,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:05:53" (2/3) ... [2022-02-10 23:05:54,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe4b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:05:54, skipping insertion in model container [2022-02-10 23:05:54,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:05:54" (3/3) ... [2022-02-10 23:05:54,493 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-02-10 23:05:54,500 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:05:54,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:05:54,500 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 23:05:54,500 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:05:54,557 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,557 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,557 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,558 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,558 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,558 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,558 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,559 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,560 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,560 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,560 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,560 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,560 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,561 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,562 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,563 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,564 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,564 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,564 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,564 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,565 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,565 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,565 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,566 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,566 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,567 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,567 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,567 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,567 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,567 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,568 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,569 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,569 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,570 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,570 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,571 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,571 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,571 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,571 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,572 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,572 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,572 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,572 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,573 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,573 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,573 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,574 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,575 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,575 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,576 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,576 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,576 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,576 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,578 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,578 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,579 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,579 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,583 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,583 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,585 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,585 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,585 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,585 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,586 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,586 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,586 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,588 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,588 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,589 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_~b~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,590 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,592 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,598 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,598 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,598 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,598 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,599 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:05:54,607 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-10 23:05:54,644 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:05:54,653 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 23:05:54,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-10 23:05:54,671 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 142 transitions, 308 flow [2022-02-10 23:05:54,848 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-10 23:05:54,896 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:54,897 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:54,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 518546796, now seen corresponding path program 1 times [2022-02-10 23:05:54,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:54,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15754167] [2022-02-10 23:05:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:55,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:55,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15754167] [2022-02-10 23:05:55,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15754167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:55,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:55,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:05:55,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128916659] [2022-02-10 23:05:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:55,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:05:55,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:05:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:05:55,183 INFO L87 Difference]: Start difference. First operand has 3113 states, 3112 states have (on average 3.5340616966580978) internal successors, (10998), 3112 states have internal predecessors, (10998), 0 states have call successors, (0), 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 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:55,288 INFO L93 Difference]: Finished difference Result 3113 states and 10261 transitions. [2022-02-10 23:05:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:05:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-10 23:05:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:55,337 INFO L225 Difference]: With dead ends: 3113 [2022-02-10 23:05:55,337 INFO L226 Difference]: Without dead ends: 2945 [2022-02-10 23:05:55,339 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:05:55,343 INFO L934 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:55,343 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:05:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2022-02-10 23:05:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2022-02-10 23:05:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2944 states have (on average 3.297554347826087) internal successors, (9708), 2944 states have internal predecessors, (9708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 9708 transitions. [2022-02-10 23:05:55,543 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 9708 transitions. Word has length 96 [2022-02-10 23:05:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:55,544 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 9708 transitions. [2022-02-10 23:05:55,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 9708 transitions. [2022-02-10 23:05:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-10 23:05:55,557 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:55,557 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:55,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:05:55,558 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1430139861, now seen corresponding path program 1 times [2022-02-10 23:05:55,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:55,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454734912] [2022-02-10 23:05:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:55,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:55,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454734912] [2022-02-10 23:05:55,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454734912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:55,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:55,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 23:05:55,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480322631] [2022-02-10 23:05:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:55,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 23:05:55,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 23:05:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:05:55,760 INFO L87 Difference]: Start difference. First operand 2945 states and 9708 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:55,883 INFO L93 Difference]: Finished difference Result 2975 states and 9924 transitions. [2022-02-10 23:05:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-10 23:05:55,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-10 23:05:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:55,901 INFO L225 Difference]: With dead ends: 2975 [2022-02-10 23:05:55,902 INFO L226 Difference]: Without dead ends: 2975 [2022-02-10 23:05:55,905 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-10 23:05:55,906 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 101 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:55,907 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 313 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:05:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2022-02-10 23:05:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2567. [2022-02-10 23:05:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2566 states have (on average 3.314886983632112) internal successors, (8506), 2566 states have internal predecessors, (8506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 8506 transitions. [2022-02-10 23:05:56,002 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 8506 transitions. Word has length 96 [2022-02-10 23:05:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:56,004 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 8506 transitions. [2022-02-10 23:05:56,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 8506 transitions. [2022-02-10 23:05:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-10 23:05:56,013 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:56,014 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:56,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:05:56,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:56,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1635672389, now seen corresponding path program 2 times [2022-02-10 23:05:56,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:56,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960974537] [2022-02-10 23:05:56,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:56,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:56,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:56,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960974537] [2022-02-10 23:05:56,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960974537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:56,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:56,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 23:05:56,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785590504] [2022-02-10 23:05:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:56,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 23:05:56,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 23:05:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:05:56,146 INFO L87 Difference]: Start difference. First operand 2567 states and 8506 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:56,287 INFO L93 Difference]: Finished difference Result 3707 states and 12439 transitions. [2022-02-10 23:05:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-10 23:05:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-10 23:05:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:56,312 INFO L225 Difference]: With dead ends: 3707 [2022-02-10 23:05:56,313 INFO L226 Difference]: Without dead ends: 3707 [2022-02-10 23:05:56,313 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-10 23:05:56,319 INFO L934 BasicCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:56,320 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 292 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:05:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-02-10 23:05:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2552. [2022-02-10 23:05:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.3171305370442963) internal successors, (8462), 2551 states have internal predecessors, (8462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 8462 transitions. [2022-02-10 23:05:56,402 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 8462 transitions. Word has length 96 [2022-02-10 23:05:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:56,404 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 8462 transitions. [2022-02-10 23:05:56,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 8462 transitions. [2022-02-10 23:05:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-10 23:05:56,424 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:56,424 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:56,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 23:05:56,424 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1043909749, now seen corresponding path program 3 times [2022-02-10 23:05:56,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:56,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509140929] [2022-02-10 23:05:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:56,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:56,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509140929] [2022-02-10 23:05:56,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509140929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:56,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:56,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:05:56,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213130009] [2022-02-10 23:05:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:56,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-10 23:05:56,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-10 23:05:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-10 23:05:56,607 INFO L87 Difference]: Start difference. First operand 2552 states and 8462 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:56,738 INFO L93 Difference]: Finished difference Result 6261 states and 21083 transitions. [2022-02-10 23:05:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-10 23:05:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-10 23:05:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:56,761 INFO L225 Difference]: With dead ends: 6261 [2022-02-10 23:05:56,761 INFO L226 Difference]: Without dead ends: 3651 [2022-02-10 23:05:56,761 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-10 23:05:56,766 INFO L934 BasicCegarLoop]: 120 mSDtfsCounter, 237 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:56,768 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 354 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:05:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2022-02-10 23:05:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2628. [2022-02-10 23:05:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.2401979444232967) internal successors, (8512), 2627 states have internal predecessors, (8512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8512 transitions. [2022-02-10 23:05:56,869 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8512 transitions. Word has length 96 [2022-02-10 23:05:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:56,870 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 8512 transitions. [2022-02-10 23:05:56,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8512 transitions. [2022-02-10 23:05:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-10 23:05:56,877 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:56,877 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:56,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 23:05:56,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:56,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1775513332, now seen corresponding path program 1 times [2022-02-10 23:05:56,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:56,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017844039] [2022-02-10 23:05:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:57,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:57,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017844039] [2022-02-10 23:05:57,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017844039] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:57,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:57,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:05:57,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927712323] [2022-02-10 23:05:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:57,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:05:57,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:05:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:05:57,013 INFO L87 Difference]: Start difference. First operand 2628 states and 8512 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-02-10 23:05:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:57,047 INFO L93 Difference]: Finished difference Result 2664 states and 8430 transitions. [2022-02-10 23:05:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:05:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 99 [2022-02-10 23:05:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:57,073 INFO L225 Difference]: With dead ends: 2664 [2022-02-10 23:05:57,073 INFO L226 Difference]: Without dead ends: 2664 [2022-02-10 23:05:57,073 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:05:57,074 INFO L934 BasicCegarLoop]: 108 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:57,074 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:05:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-02-10 23:05:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2664. [2022-02-10 23:05:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 3.1656027037176115) internal successors, (8430), 2663 states have internal predecessors, (8430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 8430 transitions. [2022-02-10 23:05:57,141 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 8430 transitions. Word has length 99 [2022-02-10 23:05:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:57,141 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 8430 transitions. [2022-02-10 23:05:57,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-02-10 23:05:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 8430 transitions. [2022-02-10 23:05:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:05:57,148 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:57,148 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:57,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 23:05:57,149 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1192942030, now seen corresponding path program 1 times [2022-02-10 23:05:57,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:57,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474849771] [2022-02-10 23:05:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:05:57,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:57,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474849771] [2022-02-10 23:05:57,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474849771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:05:57,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:05:57,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 23:05:57,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471923749] [2022-02-10 23:05:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:05:57,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:05:57,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:05:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:05:57,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:05:57,282 INFO L87 Difference]: Start difference. First operand 2664 states and 8430 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 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-02-10 23:05:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:05:57,388 INFO L93 Difference]: Finished difference Result 3417 states and 10384 transitions. [2022-02-10 23:05:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 23:05:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 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 110 [2022-02-10 23:05:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:05:57,398 INFO L225 Difference]: With dead ends: 3417 [2022-02-10 23:05:57,398 INFO L226 Difference]: Without dead ends: 2670 [2022-02-10 23:05:57,399 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-10 23:05:57,400 INFO L934 BasicCegarLoop]: 101 mSDtfsCounter, 311 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:05:57,401 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 313 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:05:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-02-10 23:05:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2665. [2022-02-10 23:05:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 3.16478978978979) internal successors, (8431), 2664 states have internal predecessors, (8431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:05:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 8431 transitions. [2022-02-10 23:05:57,472 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 8431 transitions. Word has length 110 [2022-02-10 23:05:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:05:57,472 INFO L470 AbstractCegarLoop]: Abstraction has 2665 states and 8431 transitions. [2022-02-10 23:05:57,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 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-02-10 23:05:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 8431 transitions. [2022-02-10 23:05:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-10 23:05:57,480 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:05:57,480 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:05:57,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 23:05:57,481 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:05:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:05:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 623162093, now seen corresponding path program 1 times [2022-02-10 23:05:57,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:05:57,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732934152] [2022-02-10 23:05:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:05:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:05:57,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:05:57,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732934152] [2022-02-10 23:05:57,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732934152] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:05:57,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588048661] [2022-02-10 23:05:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:05:57,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:05:57,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:05:57,820 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-02-10 23:05:57,821 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-02-10 23:05:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:05:57,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-10 23:05:57,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:05:58,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:05:58,094 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 23:05:58,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-02-10 23:05:58,146 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 23:05:58,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-02-10 23:05:58,787 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-02-10 23:05:58,788 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 20 treesize of output 30 [2022-02-10 23:05:59,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:05:59,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-10 23:05:59,598 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-02-10 23:05:59,946 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-02-10 23:06:00,044 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-02-10 23:06:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:06:00,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:06:00,347 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_124 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_124 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_124) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (< c_~front~0 0)) is different from false [2022-02-10 23:06:02,226 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:06:02,227 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 100 treesize of output 76 [2022-02-10 23:06:02,241 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:06:02,241 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 1496 treesize of output 1432 [2022-02-10 23:06:02,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:06:02,269 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 1416 treesize of output 1372 [2022-02-10 23:06:02,283 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 1229 treesize of output 1133 [2022-02-10 23:06:02,304 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:06:02,306 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 1260 treesize of output 1156 [2022-02-10 23:06:02,321 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 1037 treesize of output 941 [2022-02-10 23:06:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:06:10,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588048661] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:06:10,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:06:10,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 61 [2022-02-10 23:06:10,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125646098] [2022-02-10 23:06:10,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:06:10,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-02-10 23:06:10,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-02-10 23:06:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=3100, Unknown=31, NotChecked=116, Total=3660 [2022-02-10 23:06:10,307 INFO L87 Difference]: Start difference. First operand 2665 states and 8431 transitions. Second operand has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:15,276 INFO L93 Difference]: Finished difference Result 17744 states and 59027 transitions. [2022-02-10 23:06:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 23:06:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 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 117 [2022-02-10 23:06:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:15,310 INFO L225 Difference]: With dead ends: 17744 [2022-02-10 23:06:15,310 INFO L226 Difference]: Without dead ends: 9593 [2022-02-10 23:06:15,313 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1368, Invalid=9524, Unknown=32, NotChecked=206, Total=11130 [2022-02-10 23:06:15,313 INFO L934 BasicCegarLoop]: 124 mSDtfsCounter, 2718 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1465 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:15,314 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2718 Valid, 2938 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1040 Invalid, 0 Unknown, 1465 Unchecked, 0.8s Time] [2022-02-10 23:06:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2022-02-10 23:06:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 4109. [2022-02-10 23:06:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4108 states have (on average 3.057205452775073) internal successors, (12559), 4108 states have internal predecessors, (12559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 12559 transitions. [2022-02-10 23:06:15,455 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 12559 transitions. Word has length 117 [2022-02-10 23:06:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:15,456 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 12559 transitions. [2022-02-10 23:06:15,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.721311475409836) internal successors, (288), 61 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 12559 transitions. [2022-02-10 23:06:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-10 23:06:15,466 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:15,467 INFO L515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:15,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-10 23:06:15,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:06:15,692 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 869306436, now seen corresponding path program 2 times [2022-02-10 23:06:15,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:15,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927131239] [2022-02-10 23:06:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:06:15,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:15,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927131239] [2022-02-10 23:06:15,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927131239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:06:15,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:06:15,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 23:06:15,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769454074] [2022-02-10 23:06:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:06:15,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 23:06:15,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 23:06:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:06:15,777 INFO L87 Difference]: Start difference. First operand 4109 states and 12559 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:15,850 INFO L93 Difference]: Finished difference Result 9989 states and 31073 transitions. [2022-02-10 23:06:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-10 23:06:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 120 [2022-02-10 23:06:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:15,881 INFO L225 Difference]: With dead ends: 9989 [2022-02-10 23:06:15,881 INFO L226 Difference]: Without dead ends: 9917 [2022-02-10 23:06:15,882 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:06:15,882 INFO L934 BasicCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:15,882 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 207 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:06:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2022-02-10 23:06:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 8399. [2022-02-10 23:06:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8398 states have (on average 3.1245534651107407) internal successors, (26240), 8398 states have internal predecessors, (26240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 26240 transitions. [2022-02-10 23:06:16,142 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 26240 transitions. Word has length 120 [2022-02-10 23:06:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:16,142 INFO L470 AbstractCegarLoop]: Abstraction has 8399 states and 26240 transitions. [2022-02-10 23:06:16,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 26240 transitions. [2022-02-10 23:06:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-02-10 23:06:16,171 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:16,171 INFO L515 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:16,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 23:06:16,171 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1680628146, now seen corresponding path program 1 times [2022-02-10 23:06:16,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:16,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929147725] [2022-02-10 23:06:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:06:16,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:16,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929147725] [2022-02-10 23:06:16,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929147725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:06:16,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:06:16,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:06:16,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762994797] [2022-02-10 23:06:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:06:16,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:06:16,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:06:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:06:16,240 INFO L87 Difference]: Start difference. First operand 8399 states and 26240 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:16,292 INFO L93 Difference]: Finished difference Result 8199 states and 25593 transitions. [2022-02-10 23:06:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:06:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-02-10 23:06:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:16,322 INFO L225 Difference]: With dead ends: 8199 [2022-02-10 23:06:16,322 INFO L226 Difference]: Without dead ends: 8199 [2022-02-10 23:06:16,322 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:06:16,325 INFO L934 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:16,325 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 223 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:06:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-02-10 23:06:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8149. [2022-02-10 23:06:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8149 states, 8148 states have (on average 3.125306823760432) internal successors, (25465), 8148 states have internal predecessors, (25465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 25465 transitions. [2022-02-10 23:06:16,503 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 25465 transitions. Word has length 124 [2022-02-10 23:06:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:16,503 INFO L470 AbstractCegarLoop]: Abstraction has 8149 states and 25465 transitions. [2022-02-10 23:06:16,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 25465 transitions. [2022-02-10 23:06:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-02-10 23:06:16,522 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:16,522 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:16,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:06:16,522 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1813426250, now seen corresponding path program 3 times [2022-02-10 23:06:16,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:16,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047556844] [2022-02-10 23:06:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-10 23:06:16,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:16,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047556844] [2022-02-10 23:06:16,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047556844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:06:16,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:06:16,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 23:06:16,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408345665] [2022-02-10 23:06:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:06:16,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 23:06:16,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 23:06:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:06:16,620 INFO L87 Difference]: Start difference. First operand 8149 states and 25465 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:16,714 INFO L93 Difference]: Finished difference Result 13321 states and 41453 transitions. [2022-02-10 23:06:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-10 23:06:16,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 131 [2022-02-10 23:06:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:16,756 INFO L225 Difference]: With dead ends: 13321 [2022-02-10 23:06:16,756 INFO L226 Difference]: Without dead ends: 13321 [2022-02-10 23:06:16,756 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-10 23:06:16,757 INFO L934 BasicCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:16,758 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 382 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:06:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2022-02-10 23:06:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12814. [2022-02-10 23:06:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12814 states, 12813 states have (on average 3.1134784984000623) internal successors, (39893), 12813 states have internal predecessors, (39893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 39893 transitions. [2022-02-10 23:06:17,076 INFO L78 Accepts]: Start accepts. Automaton has 12814 states and 39893 transitions. Word has length 131 [2022-02-10 23:06:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:17,076 INFO L470 AbstractCegarLoop]: Abstraction has 12814 states and 39893 transitions. [2022-02-10 23:06:17,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12814 states and 39893 transitions. [2022-02-10 23:06:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-02-10 23:06:17,102 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:17,102 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:17,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 23:06:17,103 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 154122346, now seen corresponding path program 1 times [2022-02-10 23:06:17,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:17,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386986041] [2022-02-10 23:06:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-10 23:06:17,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:17,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386986041] [2022-02-10 23:06:17,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386986041] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:06:17,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692598853] [2022-02-10 23:06:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:17,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:06:17,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:06:17,544 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-02-10 23:06:17,546 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-02-10 23:06:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:17,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-10 23:06:17,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:06:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 23:06:18,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:06:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:06:18,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692598853] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:06:18,962 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:06:18,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2022-02-10 23:06:18,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581230644] [2022-02-10 23:06:18,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:06:18,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-10 23:06:18,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-10 23:06:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2022-02-10 23:06:18,965 INFO L87 Difference]: Start difference. First operand 12814 states and 39893 transitions. Second operand has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:19,801 INFO L93 Difference]: Finished difference Result 14512 states and 46254 transitions. [2022-02-10 23:06:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 23:06:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 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 131 [2022-02-10 23:06:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:19,848 INFO L225 Difference]: With dead ends: 14512 [2022-02-10 23:06:19,848 INFO L226 Difference]: Without dead ends: 13555 [2022-02-10 23:06:19,849 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=549, Invalid=1803, Unknown=0, NotChecked=0, Total=2352 [2022-02-10 23:06:19,850 INFO L934 BasicCegarLoop]: 196 mSDtfsCounter, 1174 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:19,850 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1174 Valid, 1719 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:06:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2022-02-10 23:06:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 9707. [2022-02-10 23:06:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9707 states, 9706 states have (on average 3.217494333402019) internal successors, (31229), 9706 states have internal predecessors, (31229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31229 transitions. [2022-02-10 23:06:20,150 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31229 transitions. Word has length 131 [2022-02-10 23:06:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:20,150 INFO L470 AbstractCegarLoop]: Abstraction has 9707 states and 31229 transitions. [2022-02-10 23:06:20,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.290322580645162) internal successors, (288), 31 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31229 transitions. [2022-02-10 23:06:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:06:20,170 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:20,171 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:20,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 23:06:20,394 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,SelfDestructingSolverStorable10 [2022-02-10 23:06:20,395 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1700635271, now seen corresponding path program 2 times [2022-02-10 23:06:20,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:20,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476536689] [2022-02-10 23:06:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:06:20,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:20,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476536689] [2022-02-10 23:06:20,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476536689] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:06:20,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100986200] [2022-02-10 23:06:20,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:06:20,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:06:20,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:06:20,748 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-02-10 23:06:20,749 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-02-10 23:06:20,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:06:20,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:06:20,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-10 23:06:20,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:06:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:06:22,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 32 treesize of output 32 [2022-02-10 23:06:22,334 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:06:22,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-02-10 23:06:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:06:22,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:06:23,017 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:06:23,018 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 133 treesize of output 134 [2022-02-10 23:06:23,026 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:06:23,026 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 71 treesize of output 58 [2022-02-10 23:06:23,032 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:06:23,033 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 58 treesize of output 45 [2022-02-10 23:06:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:06:25,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100986200] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:06:25,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:06:25,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 25] total 59 [2022-02-10 23:06:25,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527024967] [2022-02-10 23:06:25,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:06:25,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-02-10 23:06:25,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:06:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-02-10 23:06:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3069, Unknown=1, NotChecked=0, Total=3422 [2022-02-10 23:06:25,019 INFO L87 Difference]: Start difference. First operand 9707 states and 31229 transitions. Second operand has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:39,761 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:06:41,584 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-02-10 23:06:42,574 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_243 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1 4)) (select .cse0 (+ c_~queue~0.offset .cse1)))) 1)) (forall ((v_ArrVal_243 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3 4)) (select .cse2 (+ c_~queue~0.offset .cse3))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-02-10 23:06:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:06:54,158 INFO L93 Difference]: Finished difference Result 155715 states and 520813 transitions. [2022-02-10 23:06:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 328 states. [2022-02-10 23:06:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-02-10 23:06:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:06:54,918 INFO L225 Difference]: With dead ends: 155715 [2022-02-10 23:06:54,918 INFO L226 Difference]: Without dead ends: 124185 [2022-02-10 23:06:54,950 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 252 SyntacticMatches, 34 SemanticMatches, 369 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 62575 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=13106, Invalid=121830, Unknown=132, NotChecked=2202, Total=137270 [2022-02-10 23:06:54,950 INFO L934 BasicCegarLoop]: 256 mSDtfsCounter, 7113 mSDsluCounter, 10949 mSDsCounter, 0 mSdLazyCounter, 5055 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7113 SdHoareTripleChecker+Valid, 9988 SdHoareTripleChecker+Invalid, 8426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 5055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2408 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:06:54,951 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7113 Valid, 9988 Invalid, 8426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 5055 Invalid, 0 Unknown, 2408 Unchecked, 3.2s Time] [2022-02-10 23:06:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124185 states. [2022-02-10 23:06:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124185 to 29896. [2022-02-10 23:06:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29896 states, 29895 states have (on average 3.205418966382338) internal successors, (95826), 29895 states have internal predecessors, (95826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29896 states to 29896 states and 95826 transitions. [2022-02-10 23:06:56,827 INFO L78 Accepts]: Start accepts. Automaton has 29896 states and 95826 transitions. Word has length 138 [2022-02-10 23:06:56,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:06:56,827 INFO L470 AbstractCegarLoop]: Abstraction has 29896 states and 95826 transitions. [2022-02-10 23:06:56,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 5.813559322033898) internal successors, (343), 59 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:06:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29896 states and 95826 transitions. [2022-02-10 23:06:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:06:56,865 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:06:56,865 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:06:56,891 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-02-10 23:06:57,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:06:57,088 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:06:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:06:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1880030863, now seen corresponding path program 3 times [2022-02-10 23:06:57,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:06:57,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685605751] [2022-02-10 23:06:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:06:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:06:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:06:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:06:58,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:06:58,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685605751] [2022-02-10 23:06:58,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685605751] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:06:58,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538014845] [2022-02-10 23:06:58,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:06:58,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:06:58,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:06:58,406 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-02-10 23:06:58,406 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-02-10 23:06:58,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-10 23:06:58,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:06:58,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-10 23:06:58,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:07:00,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:07:00,421 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 44 treesize of output 42 [2022-02-10 23:07:00,530 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:07:00,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-02-10 23:07:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:07:00,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:07:00,848 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:07:00,879 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~front~0 0)) is different from false [2022-02-10 23:07:00,911 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:07:00,962 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:07:00,987 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:07:01,029 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:07:01,170 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:07:01,170 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 137 treesize of output 122 [2022-02-10 23:07:01,176 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 59 treesize of output 52 [2022-02-10 23:07:01,180 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 52 treesize of output 45 [2022-02-10 23:07:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-02-10 23:07:03,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538014845] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:07:03,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:07:03,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 28] total 82 [2022-02-10 23:07:03,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042098336] [2022-02-10 23:07:03,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:07:03,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-10 23:07:03,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:07:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-10 23:07:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=5245, Unknown=6, NotChecked=918, Total=6642 [2022-02-10 23:07:03,670 INFO L87 Difference]: Start difference. First operand 29896 states and 95826 transitions. Second operand has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:11,292 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-02-10 23:07:11,530 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:07:17,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (or (< (+ c_~back~0 1) 0) (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) (* c_~back~0 4))) (<= 2 c_~front~0) (<= 1 c_~back~0) (< c_~front~0 0))) is different from false [2022-02-10 23:07:17,835 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:07:22,092 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:07:22,322 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-02-10 23:07:23,274 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:07:23,700 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-02-10 23:07:23,789 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_280 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) 1)) (forall ((v_ArrVal_280 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_280) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1))))))) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-02-10 23:07:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:07:28,009 INFO L93 Difference]: Finished difference Result 157769 states and 508843 transitions. [2022-02-10 23:07:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2022-02-10 23:07:28,010 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 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 138 [2022-02-10 23:07:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:07:28,789 INFO L225 Difference]: With dead ends: 157769 [2022-02-10 23:07:28,789 INFO L226 Difference]: Without dead ends: 135622 [2022-02-10 23:07:28,793 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 227 SyntacticMatches, 17 SemanticMatches, 291 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 32244 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=10050, Invalid=67001, Unknown=15, NotChecked=8490, Total=85556 [2022-02-10 23:07:28,794 INFO L934 BasicCegarLoop]: 371 mSDtfsCounter, 7126 mSDsluCounter, 12872 mSDsCounter, 0 mSdLazyCounter, 6846 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7126 SdHoareTripleChecker+Valid, 11832 SdHoareTripleChecker+Invalid, 13971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 6846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6305 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:07:28,794 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7126 Valid, 11832 Invalid, 13971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 6846 Invalid, 0 Unknown, 6305 Unchecked, 3.6s Time] [2022-02-10 23:07:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135622 states. [2022-02-10 23:07:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135622 to 39843. [2022-02-10 23:07:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39843 states, 39842 states have (on average 3.1450228402188647) internal successors, (125304), 39842 states have internal predecessors, (125304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39843 states to 39843 states and 125304 transitions. [2022-02-10 23:07:30,888 INFO L78 Accepts]: Start accepts. Automaton has 39843 states and 125304 transitions. Word has length 138 [2022-02-10 23:07:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:07:30,888 INFO L470 AbstractCegarLoop]: Abstraction has 39843 states and 125304 transitions. [2022-02-10 23:07:30,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.390243902439025) internal successors, (360), 82 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 39843 states and 125304 transitions. [2022-02-10 23:07:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:07:30,936 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:07:30,936 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:07:30,954 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-02-10 23:07:31,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:07:31,139 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:07:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:07:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 412402409, now seen corresponding path program 4 times [2022-02-10 23:07:31,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:07:31,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991785404] [2022-02-10 23:07:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:07:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:07:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:07:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:07:32,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:07:32,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991785404] [2022-02-10 23:07:32,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991785404] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:07:32,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797919340] [2022-02-10 23:07:32,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:07:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:07:32,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:07:32,543 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-02-10 23:07:32,544 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-02-10 23:07:32,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:07:32,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:07:32,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-10 23:07:32,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:07:32,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:07:32,956 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:07:32,956 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 11 treesize of output 11 [2022-02-10 23:07:34,259 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-02-10 23:07:34,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:07:34,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:07:34,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:07:34,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 44 treesize of output 19 [2022-02-10 23:07:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:07:34,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:07:35,481 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-02-10 23:07:35,481 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 154 treesize of output 144 [2022-02-10 23:07:35,495 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-02-10 23:07:35,495 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 100 treesize of output 82 [2022-02-10 23:07:40,000 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 10 treesize of output 8 [2022-02-10 23:07:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:07:40,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797919340] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:07:40,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:07:40,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 28] total 80 [2022-02-10 23:07:40,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635386471] [2022-02-10 23:07:40,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:07:40,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-02-10 23:07:40,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:07:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-02-10 23:07:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=5600, Unknown=1, NotChecked=0, Total=6320 [2022-02-10 23:07:40,044 INFO L87 Difference]: Start difference. First operand 39843 states and 125304 transitions. Second operand has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:07:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:07:58,398 INFO L93 Difference]: Finished difference Result 118469 states and 387783 transitions. [2022-02-10 23:07:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-10 23:07:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 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 138 [2022-02-10 23:07:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:07:58,915 INFO L225 Difference]: With dead ends: 118469 [2022-02-10 23:07:58,915 INFO L226 Difference]: Without dead ends: 100973 [2022-02-10 23:07:58,917 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 234 SyntacticMatches, 10 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13746 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=5149, Invalid=31105, Unknown=36, NotChecked=0, Total=36290 [2022-02-10 23:07:58,917 INFO L934 BasicCegarLoop]: 313 mSDtfsCounter, 4226 mSDsluCounter, 9824 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4226 SdHoareTripleChecker+Valid, 8241 SdHoareTripleChecker+Invalid, 8341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5351 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:07:58,917 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4226 Valid, 8241 Invalid, 8341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2528 Invalid, 0 Unknown, 5351 Unchecked, 1.5s Time] [2022-02-10 23:07:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100973 states. [2022-02-10 23:08:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100973 to 44528. [2022-02-10 23:08:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44528 states, 44527 states have (on average 3.1311788353134054) internal successors, (139422), 44527 states have internal predecessors, (139422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44528 states to 44528 states and 139422 transitions. [2022-02-10 23:08:00,417 INFO L78 Accepts]: Start accepts. Automaton has 44528 states and 139422 transitions. Word has length 138 [2022-02-10 23:08:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:08:00,417 INFO L470 AbstractCegarLoop]: Abstraction has 44528 states and 139422 transitions. [2022-02-10 23:08:00,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.3625) internal successors, (349), 80 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 44528 states and 139422 transitions. [2022-02-10 23:08:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:08:00,476 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:08:00,476 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:08:00,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-10 23:08:00,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-10 23:08:00,677 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:08:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:08:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 873258863, now seen corresponding path program 5 times [2022-02-10 23:08:00,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:08:00,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613017400] [2022-02-10 23:08:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:08:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:08:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:08:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:08:00,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:08:00,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613017400] [2022-02-10 23:08:00,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613017400] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:08:00,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455385589] [2022-02-10 23:08:00,997 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:08:00,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:08:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:08:00,999 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-02-10 23:08:01,004 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-02-10 23:08:01,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-10 23:08:01,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:08:01,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-10 23:08:01,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:08:01,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:08:01,154 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 23:08:01,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-02-10 23:08:01,196 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-02-10 23:08:01,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-02-10 23:08:01,758 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-02-10 23:08:01,759 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 24 treesize of output 34 [2022-02-10 23:08:02,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:08:02,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-10 23:08:02,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-10 23:08:03,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:03,936 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-02-10 23:08:04,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:04,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:04,210 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:04,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 47 treesize of output 22 [2022-02-10 23:08:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:08:04,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:08:04,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-02-10 23:08:04,653 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-02-10 23:08:04,673 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)) (select .cse1 (+ c_~queue~0.offset .cse2 4)))))) (and (<= 0 .cse0) (<= .cse0 1))) (not (= 0 (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1))))))) is different from false [2022-02-10 23:08:11,448 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:11,448 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 197 treesize of output 137 [2022-02-10 23:08:11,485 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:08:11,485 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 694 treesize of output 696 [2022-02-10 23:08:11,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:11,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:11,506 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 580 treesize of output 485 [2022-02-10 23:08:11,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:11,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:11,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:11,533 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 516 treesize of output 506 [2022-02-10 23:08:11,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:11,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:11,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:11,567 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 440 treesize of output 468 [2022-02-10 23:08:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-02-10 23:08:28,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455385589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:08:28,002 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:08:28,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 37, 36] total 83 [2022-02-10 23:08:28,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078953546] [2022-02-10 23:08:28,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:08:28,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-02-10 23:08:28,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:08:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-02-10 23:08:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=5811, Unknown=19, NotChecked=474, Total=6806 [2022-02-10 23:08:28,004 INFO L87 Difference]: Start difference. First operand 44528 states and 139422 transitions. Second operand has 83 states, 83 states have (on average 4.27710843373494) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:08:40,656 INFO L93 Difference]: Finished difference Result 93468 states and 296541 transitions. [2022-02-10 23:08:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-02-10 23:08:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 4.27710843373494) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 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 138 [2022-02-10 23:08:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:08:40,920 INFO L225 Difference]: With dead ends: 93468 [2022-02-10 23:08:40,921 INFO L226 Difference]: Without dead ends: 88164 [2022-02-10 23:08:40,924 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 223 SyntacticMatches, 34 SemanticMatches, 168 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11521 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3803, Invalid=23912, Unknown=19, NotChecked=996, Total=28730 [2022-02-10 23:08:40,926 INFO L934 BasicCegarLoop]: 266 mSDtfsCounter, 4656 mSDsluCounter, 9273 mSDsCounter, 0 mSdLazyCounter, 4630 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4656 SdHoareTripleChecker+Valid, 8210 SdHoareTripleChecker+Invalid, 10378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 4630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5292 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:08:40,926 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4656 Valid, 8210 Invalid, 10378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 4630 Invalid, 0 Unknown, 5292 Unchecked, 2.3s Time] [2022-02-10 23:08:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88164 states. [2022-02-10 23:08:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88164 to 45463. [2022-02-10 23:08:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45463 states, 45462 states have (on average 3.1258193656240376) internal successors, (142106), 45462 states have internal predecessors, (142106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45463 states to 45463 states and 142106 transitions. [2022-02-10 23:08:42,446 INFO L78 Accepts]: Start accepts. Automaton has 45463 states and 142106 transitions. Word has length 138 [2022-02-10 23:08:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:08:42,446 INFO L470 AbstractCegarLoop]: Abstraction has 45463 states and 142106 transitions. [2022-02-10 23:08:42,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.27710843373494) internal successors, (355), 83 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:08:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 45463 states and 142106 transitions. [2022-02-10 23:08:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:08:42,497 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:08:42,498 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:08:42,514 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-02-10 23:08:42,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-10 23:08:42,699 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:08:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:08:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1910641701, now seen corresponding path program 6 times [2022-02-10 23:08:42,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:08:42,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756288626] [2022-02-10 23:08:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:08:42,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:08:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:08:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:08:43,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:08:43,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756288626] [2022-02-10 23:08:43,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756288626] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:08:43,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485001170] [2022-02-10 23:08:43,335 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:08:43,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:08:43,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:08:43,336 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-02-10 23:08:43,337 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-02-10 23:08:43,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-02-10 23:08:43,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:08:43,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-10 23:08:43,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:08:44,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:08:44,916 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-02-10 23:08:45,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 23:08:45,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:45,838 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-02-10 23:08:46,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:46,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:08:46,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:46,072 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:46,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 42 treesize of output 17 [2022-02-10 23:08:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:08:46,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:08:46,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)))))) (and (<= .cse0 1) (<= 0 .cse0))) (not (= (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))))) is different from false [2022-02-10 23:08:46,485 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_403 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)))))) (and (<= .cse0 1) (<= 0 .cse0))) (not (= (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-02-10 23:08:46,505 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_403 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~queue~0.base))) (or (let ((.cse0 (let ((.cse2 (* c_~front~0 4))) (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) c_~sum~0 (select .cse1 (+ c_~queue~0.offset .cse2)))))) (and (<= .cse0 1) (<= 0 .cse0))) (not (= (+ (select .cse1 (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-02-10 23:08:52,588 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:52,588 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 197 treesize of output 137 [2022-02-10 23:08:52,629 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:08:52,630 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 2726 treesize of output 2594 [2022-02-10 23:08:52,677 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-02-10 23:08:52,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2542 treesize of output 2454 [2022-02-10 23:08:52,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:52,711 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:52,712 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 2276 treesize of output 1797 [2022-02-10 23:08:52,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:52,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 23:08:52,751 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:08:52,751 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 1890 treesize of output 1676 [2022-02-10 23:09:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-02-10 23:09:27,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485001170] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:09:27,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:09:27,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 37, 35] total 82 [2022-02-10 23:09:27,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938582784] [2022-02-10 23:09:27,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:09:27,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-10 23:09:27,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:09:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-10 23:09:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=5679, Unknown=21, NotChecked=468, Total=6642 [2022-02-10 23:09:27,908 INFO L87 Difference]: Start difference. First operand 45463 states and 142106 transitions. Second operand has 82 states, 82 states have (on average 4.329268292682927) internal successors, (355), 82 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:09:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:09:39,848 INFO L93 Difference]: Finished difference Result 119609 states and 380365 transitions. [2022-02-10 23:09:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-10 23:09:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 4.329268292682927) internal successors, (355), 82 states have internal predecessors, (355), 0 states have call successors, (0), 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 138 [2022-02-10 23:09:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:09:40,176 INFO L225 Difference]: With dead ends: 119609 [2022-02-10 23:09:40,177 INFO L226 Difference]: Without dead ends: 110949 [2022-02-10 23:09:40,180 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 216 SyntacticMatches, 19 SemanticMatches, 187 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13394 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=4343, Invalid=30058, Unknown=21, NotChecked=1110, Total=35532 [2022-02-10 23:09:40,181 INFO L934 BasicCegarLoop]: 242 mSDtfsCounter, 4736 mSDsluCounter, 8376 mSDsCounter, 0 mSdLazyCounter, 4264 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4736 SdHoareTripleChecker+Valid, 7581 SdHoareTripleChecker+Invalid, 10060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 4264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5193 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:09:40,181 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4736 Valid, 7581 Invalid, 10060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 4264 Invalid, 0 Unknown, 5193 Unchecked, 2.2s Time] [2022-02-10 23:09:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110949 states. [2022-02-10 23:09:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110949 to 47370. [2022-02-10 23:09:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47370 states, 47369 states have (on average 3.1187907703350293) internal successors, (147734), 47369 states have internal predecessors, (147734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:09:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47370 states to 47370 states and 147734 transitions. [2022-02-10 23:09:41,743 INFO L78 Accepts]: Start accepts. Automaton has 47370 states and 147734 transitions. Word has length 138 [2022-02-10 23:09:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:09:41,743 INFO L470 AbstractCegarLoop]: Abstraction has 47370 states and 147734 transitions. [2022-02-10 23:09:41,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.329268292682927) internal successors, (355), 82 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:09:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 47370 states and 147734 transitions. [2022-02-10 23:09:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-02-10 23:09:41,793 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:09:41,793 INFO L515 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:09:41,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-10 23:09:41,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:09:41,994 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:09:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:09:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash -547652913, now seen corresponding path program 7 times [2022-02-10 23:09:41,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:09:41,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981043465] [2022-02-10 23:09:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:09:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:09:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:09:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:42,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:09:42,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981043465] [2022-02-10 23:09:42,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981043465] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:09:42,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397977021] [2022-02-10 23:09:42,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:09:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:09:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:09:42,837 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-02-10 23:09:42,839 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-02-10 23:09:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:09:42,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-10 23:09:42,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:09:44,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:09:44,311 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 44 treesize of output 42 [2022-02-10 23:09:44,415 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:09:44,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-02-10 23:09:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:09:44,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:09:44,735 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) is different from false [2022-02-10 23:09:44,767 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:09:44,798 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-02-10 23:09:44,981 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:09:44,982 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 137 treesize of output 108 [2022-02-10 23:09:44,986 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 59 treesize of output 52 [2022-02-10 23:09:44,988 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 52 treesize of output 45 [2022-02-10 23:09:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-02-10 23:09:47,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397977021] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:09:47,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:09:47,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 25] total 69 [2022-02-10 23:09:47,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745862018] [2022-02-10 23:09:47,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:09:47,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-02-10 23:09:47,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:09:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-02-10 23:09:47,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3876, Unknown=3, NotChecked=390, Total=4692 [2022-02-10 23:09:47,641 INFO L87 Difference]: Start difference. First operand 47370 states and 147734 transitions. Second operand has 69 states, 69 states have (on average 4.840579710144928) internal successors, (334), 69 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:09:52,676 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2022-02-10 23:09:52,933 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-02-10 23:09:52,939 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:09:57,713 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0))) is different from false [2022-02-10 23:10:00,822 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= c_~sum~0 0)) is different from false [2022-02-10 23:10:00,870 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= c_~sum~0 0)) is different from false [2022-02-10 23:10:03,030 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:10:16,627 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:10:18,122 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:10:18,338 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:10:18,364 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (and (forall ((v_ArrVal_440 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (forall ((v_ArrVal_440 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 1))) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:10:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:10:18,770 INFO L93 Difference]: Finished difference Result 230108 states and 744161 transitions. [2022-02-10 23:10:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 330 states. [2022-02-10 23:10:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 4.840579710144928) internal successors, (334), 69 states have internal predecessors, (334), 0 states have call successors, (0), 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 138 [2022-02-10 23:10:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:10:19,675 INFO L225 Difference]: With dead ends: 230108 [2022-02-10 23:10:19,675 INFO L226 Difference]: Without dead ends: 183467 [2022-02-10 23:10:19,680 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 231 SyntacticMatches, 21 SemanticMatches, 379 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 58193 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=12292, Invalid=121766, Unknown=320, NotChecked=10402, Total=144780 [2022-02-10 23:10:19,681 INFO L934 BasicCegarLoop]: 288 mSDtfsCounter, 7979 mSDsluCounter, 10720 mSDsCounter, 0 mSdLazyCounter, 5195 mSolverCounterSat, 1227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 9841 SdHoareTripleChecker+Invalid, 14206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1227 IncrementalHoareTripleChecker+Valid, 5195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7784 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:10:19,681 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [7979 Valid, 9841 Invalid, 14206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1227 Valid, 5195 Invalid, 0 Unknown, 7784 Unchecked, 3.3s Time] [2022-02-10 23:10:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183467 states. [2022-02-10 23:10:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183467 to 53410. [2022-02-10 23:10:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53410 states, 53409 states have (on average 3.0971559100526127) internal successors, (165416), 53409 states have internal predecessors, (165416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 165416 transitions. [2022-02-10 23:10:22,400 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 165416 transitions. Word has length 138 [2022-02-10 23:10:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:10:22,400 INFO L470 AbstractCegarLoop]: Abstraction has 53410 states and 165416 transitions. [2022-02-10 23:10:22,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 4.840579710144928) internal successors, (334), 69 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 165416 transitions. [2022-02-10 23:10:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-02-10 23:10:22,459 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:10:22,459 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:10:22,476 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-02-10 23:10:22,659 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,SelfDestructingSolverStorable16 [2022-02-10 23:10:22,660 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:10:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:10:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 721946978, now seen corresponding path program 8 times [2022-02-10 23:10:22,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:10:22,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980688336] [2022-02-10 23:10:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:10:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:10:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:10:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:10:22,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:10:22,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980688336] [2022-02-10 23:10:22,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980688336] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:10:22,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353830529] [2022-02-10 23:10:22,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:10:22,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:10:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:10:22,746 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-02-10 23:10:22,748 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-02-10 23:10:22,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:10:22,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:10:22,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-10 23:10:22,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:10:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-10 23:10:23,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:10:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 23:10:23,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353830529] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:10:23,637 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:10:23,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-02-10 23:10:23,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577698040] [2022-02-10 23:10:23,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:10:23,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:10:23,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:10:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:10:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:10:23,638 INFO L87 Difference]: Start difference. First operand 53410 states and 165416 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:10:24,112 INFO L93 Difference]: Finished difference Result 87741 states and 272235 transitions. [2022-02-10 23:10:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:10:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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 141 [2022-02-10 23:10:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:10:24,478 INFO L225 Difference]: With dead ends: 87741 [2022-02-10 23:10:24,478 INFO L226 Difference]: Without dead ends: 86949 [2022-02-10 23:10:24,478 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-10 23:10:24,479 INFO L934 BasicCegarLoop]: 112 mSDtfsCounter, 521 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:10:24,479 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 416 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:10:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86949 states. [2022-02-10 23:10:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86949 to 73601. [2022-02-10 23:10:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73601 states, 73600 states have (on average 3.100217391304348) internal successors, (228176), 73600 states have internal predecessors, (228176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73601 states to 73601 states and 228176 transitions. [2022-02-10 23:10:26,611 INFO L78 Accepts]: Start accepts. Automaton has 73601 states and 228176 transitions. Word has length 141 [2022-02-10 23:10:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:10:26,611 INFO L470 AbstractCegarLoop]: Abstraction has 73601 states and 228176 transitions. [2022-02-10 23:10:26,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 73601 states and 228176 transitions. [2022-02-10 23:10:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:10:26,674 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:10:26,675 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:10:26,691 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-02-10 23:10:26,875 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,SelfDestructingSolverStorable17 [2022-02-10 23:10:26,875 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:10:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:10:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1877924540, now seen corresponding path program 9 times [2022-02-10 23:10:26,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:10:26,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711041524] [2022-02-10 23:10:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:10:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:10:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:10:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:10:27,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:10:27,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711041524] [2022-02-10 23:10:27,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711041524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:10:27,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327635242] [2022-02-10 23:10:27,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:10:27,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:10:27,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:10:27,187 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-02-10 23:10:27,187 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-02-10 23:10:27,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-10 23:10:27,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:10:27,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-10 23:10:27,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:10:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:10:28,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 48 treesize of output 46 [2022-02-10 23:10:28,491 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:10:28,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-02-10 23:10:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:10:28,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:10:28,727 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:10:28,739 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_517 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_517) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) is different from false [2022-02-10 23:10:28,891 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:10:28,891 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 137 treesize of output 122 [2022-02-10 23:10:28,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 59 treesize of output 52 [2022-02-10 23:10:28,897 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 52 treesize of output 45 [2022-02-10 23:10:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2022-02-10 23:10:29,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327635242] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:10:29,963 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:10:29,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 17] total 50 [2022-02-10 23:10:29,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128832108] [2022-02-10 23:10:29,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:10:29,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-10 23:10:29,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:10:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-10 23:10:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2041, Unknown=2, NotChecked=186, Total=2450 [2022-02-10 23:10:29,965 INFO L87 Difference]: Start difference. First operand 73601 states and 228176 transitions. Second operand has 50 states, 50 states have (on average 7.04) internal successors, (352), 50 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:33,476 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (forall ((v_ArrVal_517 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_517 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_517) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:10:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:10:35,360 INFO L93 Difference]: Finished difference Result 141351 states and 442525 transitions. [2022-02-10 23:10:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-02-10 23:10:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 7.04) internal successors, (352), 50 states have internal predecessors, (352), 0 states have call successors, (0), 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 145 [2022-02-10 23:10:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:10:35,755 INFO L225 Difference]: With dead ends: 141351 [2022-02-10 23:10:35,756 INFO L226 Difference]: Without dead ends: 123625 [2022-02-10 23:10:35,757 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 136 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6695 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2420, Invalid=15668, Unknown=14, NotChecked=804, Total=18906 [2022-02-10 23:10:35,757 INFO L934 BasicCegarLoop]: 227 mSDtfsCounter, 2598 mSDsluCounter, 4989 mSDsCounter, 0 mSdLazyCounter, 2557 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 2557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 992 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:10:35,757 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2598 Valid, 4798 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 2557 Invalid, 0 Unknown, 992 Unchecked, 1.2s Time] [2022-02-10 23:10:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123625 states. [2022-02-10 23:10:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123625 to 70662. [2022-02-10 23:10:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70662 states, 70661 states have (on average 3.100776949094975) internal successors, (219104), 70661 states have internal predecessors, (219104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70662 states to 70662 states and 219104 transitions. [2022-02-10 23:10:37,838 INFO L78 Accepts]: Start accepts. Automaton has 70662 states and 219104 transitions. Word has length 145 [2022-02-10 23:10:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:10:37,838 INFO L470 AbstractCegarLoop]: Abstraction has 70662 states and 219104 transitions. [2022-02-10 23:10:37,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.04) internal successors, (352), 50 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:10:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 70662 states and 219104 transitions. [2022-02-10 23:10:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:10:38,171 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:10:38,171 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:10:38,194 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-02-10 23:10:38,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:10:38,388 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:10:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:10:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 503837740, now seen corresponding path program 10 times [2022-02-10 23:10:38,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:10:38,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896619048] [2022-02-10 23:10:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:10:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:10:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:10:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:10:42,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:10:42,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896619048] [2022-02-10 23:10:42,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896619048] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:10:42,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431986824] [2022-02-10 23:10:42,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:10:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:10:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:10:42,800 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-02-10 23:10:42,800 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-02-10 23:10:42,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:10:42,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:10:42,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjunts are in the unsatisfiable core [2022-02-10 23:10:42,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:10:42,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:10:43,253 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:10:43,253 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 11 treesize of output 11 [2022-02-10 23:10:45,025 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 44 treesize of output 42 [2022-02-10 23:10:45,120 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:10:45,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-02-10 23:10:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:10:45,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:10:45,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:10:45,501 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:10:45,548 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:10:45,567 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:10:45,606 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:10:45,697 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:10:45,697 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 137 treesize of output 108 [2022-02-10 23:10:45,701 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 59 treesize of output 52 [2022-02-10 23:10:45,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 52 treesize of output 45 [2022-02-10 23:10:48,452 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 10 treesize of output 8 [2022-02-10 23:10:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-02-10 23:10:48,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431986824] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:10:48,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:10:48,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 30, 30] total 95 [2022-02-10 23:10:48,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415418264] [2022-02-10 23:10:48,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:10:48,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-02-10 23:10:48,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:10:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-02-10 23:10:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=7502, Unknown=5, NotChecked=900, Total=8930 [2022-02-10 23:10:48,491 INFO L87 Difference]: Start difference. First operand 70662 states and 219104 transitions. Second operand has 95 states, 95 states have (on average 3.9157894736842107) internal successors, (372), 95 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:00,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))))) (forall ((v_ArrVal_559 (Array Int Int))) (<= (let ((.cse2 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) 1))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~sum~0 0))) is different from false [2022-02-10 23:11:04,996 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_559 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_559 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:11:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:11:18,122 INFO L93 Difference]: Finished difference Result 261232 states and 822946 transitions. [2022-02-10 23:11:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-02-10 23:11:18,123 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 3.9157894736842107) internal successors, (372), 95 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-02-10 23:11:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:11:19,329 INFO L225 Difference]: With dead ends: 261232 [2022-02-10 23:11:19,329 INFO L226 Difference]: Without dead ends: 217307 [2022-02-10 23:11:19,331 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 269 SyntacticMatches, 44 SemanticMatches, 268 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 29104 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=6984, Invalid=61943, Unknown=7, NotChecked=3696, Total=72630 [2022-02-10 23:11:19,332 INFO L934 BasicCegarLoop]: 281 mSDtfsCounter, 6889 mSDsluCounter, 13469 mSDsCounter, 0 mSdLazyCounter, 7249 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6889 SdHoareTripleChecker+Valid, 12141 SdHoareTripleChecker+Invalid, 12477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 7249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4681 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:11:19,332 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6889 Valid, 12141 Invalid, 12477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 7249 Invalid, 0 Unknown, 4681 Unchecked, 4.0s Time] [2022-02-10 23:11:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217307 states. [2022-02-10 23:11:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217307 to 71962. [2022-02-10 23:11:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71962 states, 71961 states have (on average 3.07278942760662) internal successors, (221121), 71961 states have internal predecessors, (221121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71962 states to 71962 states and 221121 transitions. [2022-02-10 23:11:22,515 INFO L78 Accepts]: Start accepts. Automaton has 71962 states and 221121 transitions. Word has length 145 [2022-02-10 23:11:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:11:22,515 INFO L470 AbstractCegarLoop]: Abstraction has 71962 states and 221121 transitions. [2022-02-10 23:11:22,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 3.9157894736842107) internal successors, (372), 95 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 71962 states and 221121 transitions. [2022-02-10 23:11:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:11:22,568 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:11:22,568 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:11:22,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-10 23:11:22,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:11:22,768 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:11:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:11:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash -190497132, now seen corresponding path program 11 times [2022-02-10 23:11:22,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:11:22,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004023220] [2022-02-10 23:11:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:11:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:11:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:11:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:11:23,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:11:23,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004023220] [2022-02-10 23:11:23,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004023220] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:11:23,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498897387] [2022-02-10 23:11:23,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:11:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:11:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:11:23,006 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-02-10 23:11:23,006 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-02-10 23:11:23,163 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-10 23:11:23,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:11:23,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-10 23:11:23,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:11:23,828 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 31 treesize of output 13 [2022-02-10 23:11:23,908 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 40 treesize of output 16 [2022-02-10 23:11:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:11:23,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:11:24,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:24,097 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 42 treesize of output 34 [2022-02-10 23:11:24,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:11:24,224 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 51 treesize of output 43 [2022-02-10 23:11:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:11:24,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498897387] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:11:24,765 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:11:24,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 21 [2022-02-10 23:11:24,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837711861] [2022-02-10 23:11:24,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:11:24,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-10 23:11:24,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:11:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-10 23:11:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:11:24,766 INFO L87 Difference]: Start difference. First operand 71962 states and 221121 transitions. Second operand has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:11:26,581 INFO L93 Difference]: Finished difference Result 116730 states and 361570 transitions. [2022-02-10 23:11:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-10 23:11:26,582 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 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 145 [2022-02-10 23:11:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:11:26,943 INFO L225 Difference]: With dead ends: 116730 [2022-02-10 23:11:26,944 INFO L226 Difference]: Without dead ends: 110550 [2022-02-10 23:11:26,944 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 275 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=555, Invalid=2201, Unknown=0, NotChecked=0, Total=2756 [2022-02-10 23:11:26,945 INFO L934 BasicCegarLoop]: 235 mSDtfsCounter, 1120 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:11:26,945 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1120 Valid, 2069 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:11:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110550 states. [2022-02-10 23:11:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110550 to 71917. [2022-02-10 23:11:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71917 states, 71916 states have (on average 3.0730435508092775) internal successors, (221001), 71916 states have internal predecessors, (221001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71917 states to 71917 states and 221001 transitions. [2022-02-10 23:11:29,212 INFO L78 Accepts]: Start accepts. Automaton has 71917 states and 221001 transitions. Word has length 145 [2022-02-10 23:11:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:11:29,213 INFO L470 AbstractCegarLoop]: Abstraction has 71917 states and 221001 transitions. [2022-02-10 23:11:29,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 71917 states and 221001 transitions. [2022-02-10 23:11:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:11:29,276 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:11:29,276 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:11:29,303 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-02-10 23:11:29,500 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,SelfDestructingSolverStorable20 [2022-02-10 23:11:29,501 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:11:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:11:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1169933966, now seen corresponding path program 12 times [2022-02-10 23:11:29,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:11:29,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351048863] [2022-02-10 23:11:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:11:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:11:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:11:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:11:29,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:11:29,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351048863] [2022-02-10 23:11:29,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351048863] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:11:29,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107974263] [2022-02-10 23:11:29,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:11:29,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:11:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:11:29,812 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-02-10 23:11:29,820 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-02-10 23:11:29,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-02-10 23:11:29,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:11:29,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-10 23:11:29,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:11:30,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:11:30,885 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 44 treesize of output 42 [2022-02-10 23:11:30,937 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:11:30,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-02-10 23:11:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:11:31,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:11:31,164 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_640 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_640) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_640 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_640) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:11:31,513 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:11:31,513 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 137 treesize of output 122 [2022-02-10 23:11:31,521 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 59 treesize of output 52 [2022-02-10 23:11:31,523 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 52 treesize of output 45 [2022-02-10 23:11:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2022-02-10 23:11:32,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107974263] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:11:32,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:11:32,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 17] total 47 [2022-02-10 23:11:32,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987086061] [2022-02-10 23:11:32,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:11:32,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-10 23:11:32,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:11:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-10 23:11:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1864, Unknown=1, NotChecked=88, Total=2162 [2022-02-10 23:11:32,516 INFO L87 Difference]: Start difference. First operand 71917 states and 221001 transitions. Second operand has 47 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:11:37,612 INFO L93 Difference]: Finished difference Result 158675 states and 487472 transitions. [2022-02-10 23:11:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-02-10 23:11:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 0 states have call successors, (0), 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 145 [2022-02-10 23:11:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:11:38,061 INFO L225 Difference]: With dead ends: 158675 [2022-02-10 23:11:38,061 INFO L226 Difference]: Without dead ends: 144152 [2022-02-10 23:11:38,062 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 260 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 5830 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1988, Invalid=14769, Unknown=17, NotChecked=256, Total=17030 [2022-02-10 23:11:38,063 INFO L934 BasicCegarLoop]: 285 mSDtfsCounter, 1733 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 5799 SdHoareTripleChecker+Invalid, 3738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:11:38,063 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1733 Valid, 5799 Invalid, 3738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2678 Invalid, 0 Unknown, 891 Unchecked, 1.2s Time] [2022-02-10 23:11:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144152 states. [2022-02-10 23:11:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144152 to 71915. [2022-02-10 23:11:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71915 states, 71914 states have (on average 3.073226353700253) internal successors, (221008), 71914 states have internal predecessors, (221008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71915 states to 71915 states and 221008 transitions. [2022-02-10 23:11:40,535 INFO L78 Accepts]: Start accepts. Automaton has 71915 states and 221008 transitions. Word has length 145 [2022-02-10 23:11:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:11:40,535 INFO L470 AbstractCegarLoop]: Abstraction has 71915 states and 221008 transitions. [2022-02-10 23:11:40,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:11:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 71915 states and 221008 transitions. [2022-02-10 23:11:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:11:40,591 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:11:40,591 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:11:40,608 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-02-10 23:11:40,792 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,SelfDestructingSolverStorable21 [2022-02-10 23:11:40,792 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:11:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:11:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1602519430, now seen corresponding path program 13 times [2022-02-10 23:11:40,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:11:40,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163431255] [2022-02-10 23:11:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:11:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:11:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:11:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:11:41,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:11:41,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163431255] [2022-02-10 23:11:41,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163431255] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:11:41,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628318947] [2022-02-10 23:11:41,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:11:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:11:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:11:41,068 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-02-10 23:11:41,068 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-02-10 23:11:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:11:41,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2022-02-10 23:11:41,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:11:43,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:11:43,010 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 44 treesize of output 42 [2022-02-10 23:11:43,094 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:11:43,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-02-10 23:11:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:11:43,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:11:43,358 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:11:43,442 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) is different from false [2022-02-10 23:11:43,454 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) is different from false [2022-02-10 23:11:43,560 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_681) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:11:43,658 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:11:43,658 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 137 treesize of output 108 [2022-02-10 23:11:43,662 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 59 treesize of output 52 [2022-02-10 23:11:43,666 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 52 treesize of output 45 [2022-02-10 23:11:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-10 23:11:45,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628318947] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:11:45,812 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:11:45,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31, 30] total 71 [2022-02-10 23:11:45,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702290324] [2022-02-10 23:11:45,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:11:45,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-02-10 23:11:45,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:11:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-02-10 23:11:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=4013, Unknown=4, NotChecked=532, Total=4970 [2022-02-10 23:11:45,814 INFO L87 Difference]: Start difference. First operand 71915 states and 221008 transitions. Second operand has 71 states, 71 states have (on average 5.169014084507042) internal successors, (367), 71 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:02,995 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (.cse1 (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0 .cse1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) .cse0 .cse1))) is different from false [2022-02-10 23:12:05,629 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_681) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:12:09,635 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (.cse1 (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0 .cse1) (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse0 .cse1))) is different from false [2022-02-10 23:12:10,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (.cse1 (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0 .cse1) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse0 .cse1))) is different from false [2022-02-10 23:12:13,359 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (.cse1 (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) (and (or (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and .cse0 .cse1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) .cse0 (<= c_~sum~0 1) .cse1)) is different from false [2022-02-10 23:12:13,900 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= c_~sum~0 1) (= c_~sum~0 0) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:12:13,995 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:12:15,474 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (.cse1 (and (forall ((v_ArrVal_681 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_681) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0 .cse1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse0 .cse1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0))) is different from false [2022-02-10 23:12:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:12:21,619 INFO L93 Difference]: Finished difference Result 270916 states and 832678 transitions. [2022-02-10 23:12:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 338 states. [2022-02-10 23:12:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 5.169014084507042) internal successors, (367), 71 states have internal predecessors, (367), 0 states have call successors, (0), 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 145 [2022-02-10 23:12:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:12:22,738 INFO L225 Difference]: With dead ends: 270916 [2022-02-10 23:12:22,738 INFO L226 Difference]: Without dead ends: 241984 [2022-02-10 23:12:22,744 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 286 SyntacticMatches, 70 SemanticMatches, 390 ConstructedPredicates, 12 IntricatePredicates, 5 DeprecatedPredicates, 74695 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=16230, Invalid=127432, Unknown=406, NotChecked=9204, Total=153272 [2022-02-10 23:12:22,744 INFO L934 BasicCegarLoop]: 437 mSDtfsCounter, 9716 mSDsluCounter, 13550 mSDsCounter, 0 mSdLazyCounter, 5579 mSolverCounterSat, 1049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9716 SdHoareTripleChecker+Valid, 12439 SdHoareTripleChecker+Invalid, 14820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1049 IncrementalHoareTripleChecker+Valid, 5579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8192 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:12:22,744 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [9716 Valid, 12439 Invalid, 14820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1049 Valid, 5579 Invalid, 0 Unknown, 8192 Unchecked, 3.2s Time] [2022-02-10 23:12:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241984 states. [2022-02-10 23:12:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241984 to 74631. [2022-02-10 23:12:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74631 states, 74630 states have (on average 3.066916789494841) internal successors, (228884), 74630 states have internal predecessors, (228884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74631 states to 74631 states and 228884 transitions. [2022-02-10 23:12:26,101 INFO L78 Accepts]: Start accepts. Automaton has 74631 states and 228884 transitions. Word has length 145 [2022-02-10 23:12:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:12:26,101 INFO L470 AbstractCegarLoop]: Abstraction has 74631 states and 228884 transitions. [2022-02-10 23:12:26,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 5.169014084507042) internal successors, (367), 71 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74631 states and 228884 transitions. [2022-02-10 23:12:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:12:26,153 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:12:26,154 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:12:26,173 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-02-10 23:12:26,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:12:26,363 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:12:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:12:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1258748306, now seen corresponding path program 14 times [2022-02-10 23:12:26,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:12:26,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323428055] [2022-02-10 23:12:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:12:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:12:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:12:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:12:26,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:12:26,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323428055] [2022-02-10 23:12:26,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323428055] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:12:26,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482275712] [2022-02-10 23:12:26,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:12:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:12:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:12:26,688 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-02-10 23:12:26,689 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-02-10 23:12:26,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:12:26,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:12:26,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-10 23:12:26,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:12:26,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:12:27,099 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:12:27,099 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 11 treesize of output 11 [2022-02-10 23:12:28,604 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 44 treesize of output 42 [2022-02-10 23:12:28,683 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:12:28,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 16 [2022-02-10 23:12:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:12:28,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:12:28,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:12:29,044 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) is different from false [2022-02-10 23:12:29,059 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) is different from false [2022-02-10 23:12:29,163 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_723) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_723 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:12:29,259 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:12:29,260 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 137 treesize of output 108 [2022-02-10 23:12:29,263 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 59 treesize of output 52 [2022-02-10 23:12:29,266 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 52 treesize of output 45 [2022-02-10 23:12:31,852 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 10 treesize of output 8 [2022-02-10 23:12:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-02-10 23:12:31,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482275712] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:12:31,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:12:31,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 30] total 70 [2022-02-10 23:12:31,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688438572] [2022-02-10 23:12:31,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:12:31,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-10 23:12:31,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:12:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-10 23:12:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=3886, Unknown=4, NotChecked=524, Total=4830 [2022-02-10 23:12:31,893 INFO L87 Difference]: Start difference. First operand 74631 states and 228884 transitions. Second operand has 70 states, 70 states have (on average 5.1) internal successors, (357), 70 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:41,500 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_723) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_723 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:12:42,045 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (= c_~sum~0 0)) is different from false [2022-02-10 23:12:42,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (= c_~sum~0 0)) is different from false [2022-02-10 23:12:42,799 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:12:44,173 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_723) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_723 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:12:44,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (.cse1 (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse0 .cse1) (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0 .cse1))) is different from false [2022-02-10 23:12:45,763 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:12:45,796 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (and (forall ((v_ArrVal_723 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_723) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_723 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-02-10 23:12:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:12:47,055 INFO L93 Difference]: Finished difference Result 126309 states and 387128 transitions. [2022-02-10 23:12:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2022-02-10 23:12:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 5.1) internal successors, (357), 70 states have internal predecessors, (357), 0 states have call successors, (0), 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 145 [2022-02-10 23:12:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:12:47,394 INFO L225 Difference]: With dead ends: 126309 [2022-02-10 23:12:47,395 INFO L226 Difference]: Without dead ends: 126264 [2022-02-10 23:12:47,397 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 281 SyntacticMatches, 51 SemanticMatches, 267 ConstructedPredicates, 12 IntricatePredicates, 2 DeprecatedPredicates, 32319 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=6588, Invalid=59035, Unknown=217, NotChecked=6252, Total=72092 [2022-02-10 23:12:47,397 INFO L934 BasicCegarLoop]: 352 mSDtfsCounter, 4373 mSDsluCounter, 11441 mSDsCounter, 0 mSdLazyCounter, 3874 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 11986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 3874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7806 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:12:47,398 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4373 Valid, 10900 Invalid, 11986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 3874 Invalid, 0 Unknown, 7806 Unchecked, 1.8s Time] [2022-02-10 23:12:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126264 states. [2022-02-10 23:12:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126264 to 79266. [2022-02-10 23:12:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79266 states, 79265 states have (on average 3.082381883555163) internal successors, (244325), 79265 states have internal predecessors, (244325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79266 states to 79266 states and 244325 transitions. [2022-02-10 23:12:50,003 INFO L78 Accepts]: Start accepts. Automaton has 79266 states and 244325 transitions. Word has length 145 [2022-02-10 23:12:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:12:50,004 INFO L470 AbstractCegarLoop]: Abstraction has 79266 states and 244325 transitions. [2022-02-10 23:12:50,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 5.1) internal successors, (357), 70 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 79266 states and 244325 transitions. [2022-02-10 23:12:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:12:50,063 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:12:50,063 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:12:50,079 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-02-10 23:12:50,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:12:50,267 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:12:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:12:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1773966686, now seen corresponding path program 15 times [2022-02-10 23:12:50,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:12:50,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606572542] [2022-02-10 23:12:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:12:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:12:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:12:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:12:50,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:12:50,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606572542] [2022-02-10 23:12:50,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606572542] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:12:50,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958838676] [2022-02-10 23:12:50,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:12:50,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:12:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:12:50,600 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-02-10 23:12:50,600 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-02-10 23:12:50,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-10 23:12:50,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:12:50,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-10 23:12:50,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:12:50,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:12:50,914 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:12:50,914 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 11 treesize of output 11 [2022-02-10 23:12:51,929 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 50 treesize of output 48 [2022-02-10 23:12:52,007 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-02-10 23:12:52,008 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 50 treesize of output 19 [2022-02-10 23:12:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:12:52,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:12:52,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_765 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_765) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_765 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_765) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:12:52,410 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:12:52,411 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 137 treesize of output 122 [2022-02-10 23:12:52,415 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 59 treesize of output 52 [2022-02-10 23:12:52,418 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 52 treesize of output 45 [2022-02-10 23:12:53,618 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 10 treesize of output 8 [2022-02-10 23:12:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 4 not checked. [2022-02-10 23:12:53,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958838676] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:12:53,656 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:12:53,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 17] total 43 [2022-02-10 23:12:53,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164310049] [2022-02-10 23:12:53,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:12:53,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-10 23:12:53,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:12:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-10 23:12:53,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1548, Unknown=1, NotChecked=80, Total=1806 [2022-02-10 23:12:53,657 INFO L87 Difference]: Start difference. First operand 79266 states and 244325 transitions. Second operand has 43 states, 43 states have (on average 6.930232558139535) internal successors, (298), 43 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:12:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:12:58,543 INFO L93 Difference]: Finished difference Result 209735 states and 652640 transitions. [2022-02-10 23:12:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-02-10 23:12:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.930232558139535) internal successors, (298), 43 states have internal predecessors, (298), 0 states have call successors, (0), 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 145 [2022-02-10 23:12:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:12:59,417 INFO L225 Difference]: With dead ends: 209735 [2022-02-10 23:12:59,417 INFO L226 Difference]: Without dead ends: 180310 [2022-02-10 23:12:59,417 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 267 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5708 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2076, Invalid=14174, Unknown=10, NotChecked=252, Total=16512 [2022-02-10 23:12:59,418 INFO L934 BasicCegarLoop]: 256 mSDtfsCounter, 1814 mSDsluCounter, 5379 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 3816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1678 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-10 23:12:59,418 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1814 Valid, 5021 Invalid, 3816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1986 Invalid, 0 Unknown, 1678 Unchecked, 0.9s Time] [2022-02-10 23:12:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180310 states. [2022-02-10 23:13:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180310 to 80573. [2022-02-10 23:13:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80573 states, 80572 states have (on average 3.0662264806632575) internal successors, (247052), 80572 states have internal predecessors, (247052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:13:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80573 states to 80573 states and 247052 transitions. [2022-02-10 23:13:02,305 INFO L78 Accepts]: Start accepts. Automaton has 80573 states and 247052 transitions. Word has length 145 [2022-02-10 23:13:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:13:02,306 INFO L470 AbstractCegarLoop]: Abstraction has 80573 states and 247052 transitions. [2022-02-10 23:13:02,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.930232558139535) internal successors, (298), 43 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:13:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 80573 states and 247052 transitions. [2022-02-10 23:13:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 23:13:02,367 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:13:02,367 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:13:02,385 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-02-10 23:13:02,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-10 23:13:02,568 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:13:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:13:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1620864870, now seen corresponding path program 16 times [2022-02-10 23:13:02,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:13:02,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069969514] [2022-02-10 23:13:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:13:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:13:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:13:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:13:02,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:13:02,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069969514] [2022-02-10 23:13:02,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069969514] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:13:02,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796412314] [2022-02-10 23:13:02,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:13:02,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:13:02,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:13:02,871 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-02-10 23:13:02,872 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-02-10 23:13:02,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:13:02,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:13:02,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-10 23:13:02,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:13:03,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:13:03,235 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:13:03,235 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 11 treesize of output 11 [2022-02-10 23:13:04,879 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 44 treesize of output 42 [2022-02-10 23:13:04,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:13:04,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:13:04,957 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 42 treesize of output 14 [2022-02-10 23:13:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:13:05,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:13:05,158 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:13:05,297 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-02-10 23:13:05,429 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:13:05,478 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:13:05,478 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 137 treesize of output 108 [2022-02-10 23:13:05,481 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 59 treesize of output 52 [2022-02-10 23:13:05,484 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 52 treesize of output 45 [2022-02-10 23:13:07,936 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 10 treesize of output 8 [2022-02-10 23:13:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-02-10 23:13:07,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796412314] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:13:07,974 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:13:07,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30, 30] total 69 [2022-02-10 23:13:07,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001565825] [2022-02-10 23:13:07,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:13:07,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-02-10 23:13:07,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:13:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-02-10 23:13:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3860, Unknown=20, NotChecked=390, Total=4692 [2022-02-10 23:13:07,976 INFO L87 Difference]: Start difference. First operand 80573 states and 247052 transitions. Second operand has 69 states, 69 states have (on average 5.159420289855072) internal successors, (356), 69 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:13:13,468 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)))) is different from false [2022-02-10 23:13:13,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~back~0 4))) (and (let ((.cse0 (+ c_~back~0 1))) (or (<= .cse0 c_~front~0) (<= c_~n~0 .cse0) (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= (* c_~front~0 4) .cse1) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (< c_~front~0 0))) (or (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1) 0))))) is different from false [2022-02-10 23:13:22,480 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:23,589 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~back~0 1)) (.cse6 (* c_~back~0 4))) (let ((.cse0 (<= 0 c_~sum~0)) (.cse1 (<= c_~sum~0 1)) (.cse2 (= (* c_~front~0 4) .cse6)) (.cse3 (<= .cse7 c_~front~0)) (.cse4 (<= c_~n~0 .cse7)) (.cse5 (< c_~front~0 0))) (and (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 .cse4 .cse5) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse0 .cse1 .cse2) .cse5) (or .cse3 .cse4 (and .cse0 .cse1 .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse5) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) 1) 0))) (= c_~sum~0 0)))) is different from false [2022-02-10 23:13:23,677 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:28,424 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:28,558 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:29,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~back~0 1)) (.cse8 (* c_~back~0 4))) (let ((.cse0 (<= 0 c_~sum~0)) (.cse1 (<= c_~sum~0 1)) (.cse2 (= (* c_~front~0 4) .cse8)) (.cse3 (<= .cse9 c_~front~0)) (.cse4 (<= c_~n~0 .cse9)) (.cse5 (< c_~front~0 0)) (.cse6 (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) (.cse7 (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) 0)))) (and (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or (and .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse2) .cse3 .cse4 .cse5) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse0 .cse1 .cse2) .cse5) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse6 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse7) (or .cse3 .cse4 (and .cse0 .cse1 .cse2 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse5) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or .cse6 (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse7) (= c_~sum~0 0)))) is different from false [2022-02-10 23:13:30,561 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:30,597 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-02-10 23:13:31,571 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:34,911 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:37,465 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:13:42,072 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:42,085 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:42,092 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_807) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (<= c_~back~0 c_~front~0) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:43,618 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:44,390 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-02-10 23:13:49,231 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:49,615 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:13:50,010 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:50,088 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-02-10 23:13:51,851 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:13:52,264 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_807 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_807) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:13:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:13:53,787 INFO L93 Difference]: Finished difference Result 297727 states and 916392 transitions. [2022-02-10 23:13:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 484 states. [2022-02-10 23:13:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 5.159420289855072) internal successors, (356), 69 states have internal predecessors, (356), 0 states have call successors, (0), 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 145 [2022-02-10 23:13:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:13:55,172 INFO L225 Difference]: With dead ends: 297727 [2022-02-10 23:13:55,172 INFO L226 Difference]: Without dead ends: 296692 [2022-02-10 23:13:55,184 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 277 SyntacticMatches, 49 SemanticMatches, 531 ConstructedPredicates, 27 IntricatePredicates, 1 DeprecatedPredicates, 125730 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=25463, Invalid=228997, Unknown=1178, NotChecked=27918, Total=283556 [2022-02-10 23:13:55,184 INFO L934 BasicCegarLoop]: 552 mSDtfsCounter, 6054 mSDsluCounter, 18505 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6054 SdHoareTripleChecker+Valid, 16813 SdHoareTripleChecker+Invalid, 26726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21259 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:13:55,184 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6054 Valid, 16813 Invalid, 26726 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [542 Valid, 4925 Invalid, 0 Unknown, 21259 Unchecked, 2.6s Time] [2022-02-10 23:13:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296692 states. [2022-02-10 23:13:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296692 to 119859. [2022-02-10 23:13:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119859 states, 119858 states have (on average 3.1125248210382286) internal successors, (373061), 119858 states have internal predecessors, (373061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119859 states to 119859 states and 373061 transitions. [2022-02-10 23:14:00,536 INFO L78 Accepts]: Start accepts. Automaton has 119859 states and 373061 transitions. Word has length 145 [2022-02-10 23:14:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:14:00,537 INFO L470 AbstractCegarLoop]: Abstraction has 119859 states and 373061 transitions. [2022-02-10 23:14:00,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 5.159420289855072) internal successors, (356), 69 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 119859 states and 373061 transitions. [2022-02-10 23:14:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-10 23:14:00,663 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:14:00,663 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:14:00,680 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-02-10 23:14:00,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-10 23:14:00,864 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:14:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:14:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1807247570, now seen corresponding path program 17 times [2022-02-10 23:14:00,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:14:00,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469081025] [2022-02-10 23:14:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:14:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:14:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:14:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-10 23:14:01,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:14:01,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469081025] [2022-02-10 23:14:01,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469081025] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:14:01,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742858937] [2022-02-10 23:14:01,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:14:01,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:14:01,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:14:01,052 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-02-10 23:14:01,082 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-02-10 23:14:01,192 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-02-10 23:14:01,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:14:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-10 23:14:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:14:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-10 23:14:02,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:14:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-10 23:14:03,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742858937] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:14:03,224 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:14:03,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-02-10 23:14:03,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54292632] [2022-02-10 23:14:03,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:14:03,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-10 23:14:03,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:14:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-10 23:14:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1669, Unknown=0, NotChecked=0, Total=1892 [2022-02-10 23:14:03,226 INFO L87 Difference]: Start difference. First operand 119859 states and 373061 transitions. Second operand has 44 states, 44 states have (on average 7.636363636363637) internal successors, (336), 44 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:14:05,635 INFO L93 Difference]: Finished difference Result 84942 states and 270353 transitions. [2022-02-10 23:14:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-10 23:14:05,635 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 7.636363636363637) internal successors, (336), 44 states have internal predecessors, (336), 0 states have call successors, (0), 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 152 [2022-02-10 23:14:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:14:05,918 INFO L225 Difference]: With dead ends: 84942 [2022-02-10 23:14:05,918 INFO L226 Difference]: Without dead ends: 79986 [2022-02-10 23:14:05,918 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1314, Invalid=5996, Unknown=0, NotChecked=0, Total=7310 [2022-02-10 23:14:05,921 INFO L934 BasicCegarLoop]: 339 mSDtfsCounter, 2242 mSDsluCounter, 6112 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 6024 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:14:05,924 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2242 Valid, 6024 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:14:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79986 states. [2022-02-10 23:14:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79986 to 63801. [2022-02-10 23:14:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63801 states, 63800 states have (on average 3.1717241379310344) internal successors, (202356), 63800 states have internal predecessors, (202356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63801 states to 63801 states and 202356 transitions. [2022-02-10 23:14:08,024 INFO L78 Accepts]: Start accepts. Automaton has 63801 states and 202356 transitions. Word has length 152 [2022-02-10 23:14:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:14:08,024 INFO L470 AbstractCegarLoop]: Abstraction has 63801 states and 202356 transitions. [2022-02-10 23:14:08,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.636363636363637) internal successors, (336), 44 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63801 states and 202356 transitions. [2022-02-10 23:14:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:14:08,116 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:14:08,116 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:14:08,133 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-02-10 23:14:08,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-02-10 23:14:08,317 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:14:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:14:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -678827956, now seen corresponding path program 18 times [2022-02-10 23:14:08,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:14:08,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34554029] [2022-02-10 23:14:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:14:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:14:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:14:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:14:09,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:14:09,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34554029] [2022-02-10 23:14:09,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34554029] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:14:09,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968749631] [2022-02-10 23:14:09,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:14:09,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:14:09,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:14:09,377 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-02-10 23:14:09,378 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-02-10 23:14:09,601 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-02-10 23:14:09,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:14:09,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-10 23:14:09,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:14:09,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:14:09,765 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:14:09,765 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 11 treesize of output 11 [2022-02-10 23:14:10,884 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 44 treesize of output 42 [2022-02-10 23:14:10,944 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:14:10,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-02-10 23:14:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-10 23:14:11,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:14:11,228 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_887 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_887 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:14:11,505 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:14:11,506 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 137 treesize of output 122 [2022-02-10 23:14:11,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 59 treesize of output 52 [2022-02-10 23:14:11,511 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 52 treesize of output 45 [2022-02-10 23:14:12,794 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 10 treesize of output 8 [2022-02-10 23:14:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 25 not checked. [2022-02-10 23:14:12,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968749631] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:14:12,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:14:12,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 17] total 64 [2022-02-10 23:14:12,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310835368] [2022-02-10 23:14:12,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:14:12,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-02-10 23:14:12,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:14:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-02-10 23:14:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3615, Unknown=1, NotChecked=122, Total=4032 [2022-02-10 23:14:12,834 INFO L87 Difference]: Start difference. First operand 63801 states and 202356 transitions. Second operand has 64 states, 64 states have (on average 6.046875) internal successors, (387), 64 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:18,605 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (= c_~queue~0.offset 0) (forall ((v_ArrVal_887 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (<= 1 c_~v_assert~0) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 (* c_~back~0 4))) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= (- 1) (select (select |c_#memory_int| c_~queue~0.base) .cse0)) (= .cse0 4) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (<= c_~sum~0 1) (forall ((v_ArrVal_887 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:14:19,002 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (= c_~queue~0.offset 0) (forall ((v_ArrVal_887 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 (* c_~back~0 4))) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= (- 1) (select (select |c_#memory_int| c_~queue~0.base) .cse0)) (= .cse0 4) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (<= c_~sum~0 1) (forall ((v_ArrVal_887 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:14:19,005 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (= c_~queue~0.offset 0) (forall ((v_ArrVal_887 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 (* c_~back~0 4))) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= (- 1) (select (select |c_#memory_int| c_~queue~0.base) .cse0)) (= .cse0 4) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))))) (<= c_~sum~0 1) (forall ((v_ArrVal_887 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:14:19,352 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_887 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_887 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_887) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:14:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:14:32,414 INFO L93 Difference]: Finished difference Result 293634 states and 937920 transitions. [2022-02-10 23:14:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2022-02-10 23:14:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.046875) internal successors, (387), 64 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2022-02-10 23:14:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:14:33,191 INFO L225 Difference]: With dead ends: 293634 [2022-02-10 23:14:33,191 INFO L226 Difference]: Without dead ends: 199383 [2022-02-10 23:14:33,194 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 287 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 33971 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=7123, Invalid=72938, Unknown=331, NotChecked=2840, Total=83232 [2022-02-10 23:14:33,194 INFO L934 BasicCegarLoop]: 594 mSDtfsCounter, 4219 mSDsluCounter, 14203 mSDsCounter, 0 mSdLazyCounter, 5936 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 13319 SdHoareTripleChecker+Invalid, 11041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 5936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4644 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:14:33,194 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4219 Valid, 13319 Invalid, 11041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 5936 Invalid, 0 Unknown, 4644 Unchecked, 3.0s Time] [2022-02-10 23:14:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199383 states. [2022-02-10 23:14:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199383 to 61431. [2022-02-10 23:14:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61431 states, 61430 states have (on average 3.185642194367573) internal successors, (195694), 61430 states have internal predecessors, (195694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61431 states to 61431 states and 195694 transitions. [2022-02-10 23:14:36,363 INFO L78 Accepts]: Start accepts. Automaton has 61431 states and 195694 transitions. Word has length 156 [2022-02-10 23:14:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:14:36,363 INFO L470 AbstractCegarLoop]: Abstraction has 61431 states and 195694 transitions. [2022-02-10 23:14:36,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.046875) internal successors, (387), 64 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 61431 states and 195694 transitions. [2022-02-10 23:14:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:14:36,435 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:14:36,435 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:14:36,452 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-02-10 23:14:36,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:14:36,636 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:14:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:14:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1457492608, now seen corresponding path program 19 times [2022-02-10 23:14:36,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:14:36,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265784317] [2022-02-10 23:14:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:14:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:14:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:14:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:14:37,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:14:37,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265784317] [2022-02-10 23:14:37,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265784317] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:14:37,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138948240] [2022-02-10 23:14:37,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 23:14:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:14:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:14:37,309 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-02-10 23:14:37,310 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-02-10 23:14:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:14:37,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-10 23:14:37,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:14:37,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:14:37,716 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:14:37,716 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 11 treesize of output 11 [2022-02-10 23:14:39,291 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 44 treesize of output 42 [2022-02-10 23:14:39,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:14:39,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:14:39,381 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 44 treesize of output 16 [2022-02-10 23:14:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:14:39,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:14:39,625 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:14:39,642 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) is different from false [2022-02-10 23:14:39,650 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) is different from false [2022-02-10 23:14:39,874 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) is different from false [2022-02-10 23:14:40,034 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:14:40,085 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:14:40,085 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 137 treesize of output 108 [2022-02-10 23:14:40,089 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 59 treesize of output 52 [2022-02-10 23:14:40,092 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 52 treesize of output 45 [2022-02-10 23:14:42,419 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 10 treesize of output 8 [2022-02-10 23:14:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2022-02-10 23:14:42,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138948240] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:14:42,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:14:42,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 31, 30] total 70 [2022-02-10 23:14:42,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578920418] [2022-02-10 23:14:42,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:14:42,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-02-10 23:14:42,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:14:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-02-10 23:14:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=3712, Unknown=5, NotChecked=650, Total=4830 [2022-02-10 23:14:42,475 INFO L87 Difference]: Start difference. First operand 61431 states and 195694 transitions. Second operand has 70 states, 70 states have (on average 5.557142857142857) internal successors, (389), 70 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:47,919 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:14:47,924 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:14:48,200 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:14:48,316 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-02-10 23:14:48,431 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:14:48,462 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-02-10 23:14:48,469 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_929) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:14:49,451 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))))) is different from false [2022-02-10 23:14:49,748 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((v_ArrVal_929 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_929 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_929) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))))) (and (or (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse0) (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) .cse0))) is different from false [2022-02-10 23:14:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:14:51,689 INFO L93 Difference]: Finished difference Result 170846 states and 552365 transitions. [2022-02-10 23:14:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-02-10 23:14:51,689 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 5.557142857142857) internal successors, (389), 70 states have internal predecessors, (389), 0 states have call successors, (0), 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 156 [2022-02-10 23:14:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:14:52,270 INFO L225 Difference]: With dead ends: 170846 [2022-02-10 23:14:52,270 INFO L226 Difference]: Without dead ends: 170846 [2022-02-10 23:14:52,272 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 270 SyntacticMatches, 34 SemanticMatches, 191 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 13911 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=4222, Invalid=27679, Unknown=17, NotChecked=5138, Total=37056 [2022-02-10 23:14:52,272 INFO L934 BasicCegarLoop]: 276 mSDtfsCounter, 5070 mSDsluCounter, 7443 mSDsCounter, 0 mSdLazyCounter, 2847 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5070 SdHoareTripleChecker+Valid, 6807 SdHoareTripleChecker+Invalid, 13693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 2847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10219 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:14:52,272 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [5070 Valid, 6807 Invalid, 13693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 2847 Invalid, 0 Unknown, 10219 Unchecked, 1.6s Time] [2022-02-10 23:14:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170846 states. [2022-02-10 23:14:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170846 to 81778. [2022-02-10 23:14:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81778 states, 81777 states have (on average 3.22852391259156) internal successors, (264019), 81777 states have internal predecessors, (264019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81778 states to 81778 states and 264019 transitions. [2022-02-10 23:14:55,673 INFO L78 Accepts]: Start accepts. Automaton has 81778 states and 264019 transitions. Word has length 156 [2022-02-10 23:14:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:14:55,673 INFO L470 AbstractCegarLoop]: Abstraction has 81778 states and 264019 transitions. [2022-02-10 23:14:55,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 5.557142857142857) internal successors, (389), 70 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:14:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 81778 states and 264019 transitions. [2022-02-10 23:14:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:14:55,784 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:14:55,784 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:14:55,801 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-02-10 23:14:55,987 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,SelfDestructingSolverStorable28 [2022-02-10 23:14:55,987 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:14:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:14:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1787909406, now seen corresponding path program 20 times [2022-02-10 23:14:55,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:14:55,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947611607] [2022-02-10 23:14:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:14:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:14:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:14:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:14:56,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:14:56,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947611607] [2022-02-10 23:14:56,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947611607] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:14:56,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800925293] [2022-02-10 23:14:56,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:14:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:14:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:14:56,884 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-02-10 23:14:56,884 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-02-10 23:14:57,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 23:14:57,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:14:57,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 23:14:57,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:14:57,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:14:57,282 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:14:57,282 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 11 treesize of output 11 [2022-02-10 23:14:59,525 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 43 treesize of output 41 [2022-02-10 23:14:59,692 INFO L353 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-02-10 23:14:59,693 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 47 treesize of output 20 [2022-02-10 23:14:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:14:59,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:14:59,991 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:15:00,009 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-02-10 23:15:00,019 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-02-10 23:15:00,203 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-02-10 23:15:00,363 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:15:00,416 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-02-10 23:15:00,416 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 136 treesize of output 110 [2022-02-10 23:15:00,431 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 59 treesize of output 52 [2022-02-10 23:15:00,435 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 52 treesize of output 45 [2022-02-10 23:15:05,249 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 10 treesize of output 8 [2022-02-10 23:15:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2022-02-10 23:15:05,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800925293] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:15:05,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:15:05,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 30] total 85 [2022-02-10 23:15:05,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897840029] [2022-02-10 23:15:05,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:15:05,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-10 23:15:05,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:15:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-10 23:15:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=5822, Unknown=5, NotChecked=800, Total=7140 [2022-02-10 23:15:05,289 INFO L87 Difference]: Start difference. First operand 81778 states and 264019 transitions. Second operand has 85 states, 85 states have (on average 4.764705882352941) internal successors, (405), 85 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:12,765 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (= c_~sum~0 0)) is different from false [2022-02-10 23:15:13,890 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:14,150 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (let ((.cse1 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) 1))) (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:14,882 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (and (forall ((v_ArrVal_971 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_971 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_971) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)))) is different from false [2022-02-10 23:15:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:15:18,342 INFO L93 Difference]: Finished difference Result 159704 states and 515841 transitions. [2022-02-10 23:15:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-02-10 23:15:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 4.764705882352941) internal successors, (405), 85 states have internal predecessors, (405), 0 states have call successors, (0), 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 156 [2022-02-10 23:15:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:15:19,133 INFO L225 Difference]: With dead ends: 159704 [2022-02-10 23:15:19,134 INFO L226 Difference]: Without dead ends: 159704 [2022-02-10 23:15:19,135 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 272 SyntacticMatches, 21 SemanticMatches, 209 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 15096 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3793, Invalid=36832, Unknown=13, NotChecked=3672, Total=44310 [2022-02-10 23:15:19,136 INFO L934 BasicCegarLoop]: 329 mSDtfsCounter, 2432 mSDsluCounter, 15862 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 14927 SdHoareTripleChecker+Invalid, 12602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 4614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7830 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:15:19,136 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2432 Valid, 14927 Invalid, 12602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 4614 Invalid, 0 Unknown, 7830 Unchecked, 2.2s Time] [2022-02-10 23:15:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159704 states. [2022-02-10 23:15:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159704 to 90100. [2022-02-10 23:15:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90100 states, 90099 states have (on average 3.2331768388106417) internal successors, (291306), 90099 states have internal predecessors, (291306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90100 states to 90100 states and 291306 transitions. [2022-02-10 23:15:22,167 INFO L78 Accepts]: Start accepts. Automaton has 90100 states and 291306 transitions. Word has length 156 [2022-02-10 23:15:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:15:22,168 INFO L470 AbstractCegarLoop]: Abstraction has 90100 states and 291306 transitions. [2022-02-10 23:15:22,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 4.764705882352941) internal successors, (405), 85 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 90100 states and 291306 transitions. [2022-02-10 23:15:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:15:22,273 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:15:22,274 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:15:22,290 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-02-10 23:15:22,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:15:22,474 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:15:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:15:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash 8189124, now seen corresponding path program 21 times [2022-02-10 23:15:22,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:15:22,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019075627] [2022-02-10 23:15:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:15:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:15:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:15:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:15:23,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:15:23,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019075627] [2022-02-10 23:15:23,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019075627] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:15:23,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841316078] [2022-02-10 23:15:23,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 23:15:23,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:15:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:15:23,827 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-02-10 23:15:23,827 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-02-10 23:15:24,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-10 23:15:24,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:15:24,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 83 conjunts are in the unsatisfiable core [2022-02-10 23:15:24,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:15:24,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:15:24,301 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:15:24,302 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 11 treesize of output 11 [2022-02-10 23:15:26,113 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 44 treesize of output 42 [2022-02-10 23:15:26,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:15:26,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 23:15:26,180 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 42 treesize of output 14 [2022-02-10 23:15:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:15:26,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:15:26,399 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) is different from false [2022-02-10 23:15:26,419 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-02-10 23:15:26,427 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-02-10 23:15:26,729 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) is different from false [2022-02-10 23:15:26,777 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-10 23:15:26,777 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 137 treesize of output 108 [2022-02-10 23:15:26,780 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 59 treesize of output 52 [2022-02-10 23:15:26,783 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 52 treesize of output 45 [2022-02-10 23:15:29,234 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 10 treesize of output 8 [2022-02-10 23:15:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-02-10 23:15:29,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841316078] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:15:29,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:15:29,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 76 [2022-02-10 23:15:29,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774318313] [2022-02-10 23:15:29,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:15:29,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-02-10 23:15:29,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:15:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-02-10 23:15:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=4521, Unknown=4, NotChecked=572, Total=5700 [2022-02-10 23:15:29,274 INFO L87 Difference]: Start difference. First operand 90100 states and 291306 transitions. Second operand has 76 states, 76 states have (on average 4.671052631578948) internal successors, (355), 76 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:33,717 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:33,729 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:33,872 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:15:33,880 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))))) (and (or .cse0 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (or .cse0 (<= c_~n~0 c_~back~0) (< c_~back~0 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)))) is different from false [2022-02-10 23:15:34,168 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|)) is different from false [2022-02-10 23:15:34,172 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0)) is different from false [2022-02-10 23:15:35,992 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:36,320 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-02-10 23:15:39,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~back~0 1)) (.cse7 (* c_~back~0 4))) (let ((.cse2 (<= 0 c_~sum~0)) (.cse3 (<= c_~sum~0 1)) (.cse4 (= (* c_~front~0 4) .cse7)) (.cse0 (<= c_~n~0 (+ c_~back~0 2))) (.cse1 (<= .cse6 c_~front~0)) (.cse5 (< c_~front~0 0))) (and (or (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 0) .cse0 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse2 .cse3 .cse4) .cse5) (or (< .cse6 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))))) (<= c_~n~0 .cse6) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse7)) 1) 0))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2 .cse3 .cse4) .cse0 .cse1 .cse5) (or .cse0 (and .cse2 .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|)) .cse4) .cse1 .cse5) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse5) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2 .cse3 .cse4) .cse0 .cse1 .cse5)))) is different from false [2022-02-10 23:15:41,066 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-02-10 23:15:41,280 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0) (and (forall ((v_ArrVal_1013 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1013 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1013) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-02-10 23:15:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:15:42,357 INFO L93 Difference]: Finished difference Result 316315 states and 1046101 transitions. [2022-02-10 23:15:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-02-10 23:15:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 4.671052631578948) internal successors, (355), 76 states have internal predecessors, (355), 0 states have call successors, (0), 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 156 [2022-02-10 23:15:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:15:43,740 INFO L225 Difference]: With dead ends: 316315 [2022-02-10 23:15:43,741 INFO L226 Difference]: Without dead ends: 273652 [2022-02-10 23:15:43,742 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 284 SyntacticMatches, 59 SemanticMatches, 189 ConstructedPredicates, 15 IntricatePredicates, 3 DeprecatedPredicates, 15269 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3865, Invalid=26956, Unknown=39, NotChecked=5430, Total=36290 [2022-02-10 23:15:43,742 INFO L934 BasicCegarLoop]: 268 mSDtfsCounter, 5333 mSDsluCounter, 12397 mSDsCounter, 0 mSdLazyCounter, 4577 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5333 SdHoareTripleChecker+Valid, 11212 SdHoareTripleChecker+Invalid, 15002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10013 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:15:43,743 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [5333 Valid, 11212 Invalid, 15002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4577 Invalid, 0 Unknown, 10013 Unchecked, 2.4s Time] [2022-02-10 23:15:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273652 states. [2022-02-10 23:15:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273652 to 134392. [2022-02-10 23:15:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134392 states, 134391 states have (on average 3.2456116853063075) internal successors, (436181), 134391 states have internal predecessors, (436181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134392 states to 134392 states and 436181 transitions. [2022-02-10 23:15:50,556 INFO L78 Accepts]: Start accepts. Automaton has 134392 states and 436181 transitions. Word has length 156 [2022-02-10 23:15:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:15:50,556 INFO L470 AbstractCegarLoop]: Abstraction has 134392 states and 436181 transitions. [2022-02-10 23:15:50,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.671052631578948) internal successors, (355), 76 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:15:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 134392 states and 436181 transitions. [2022-02-10 23:15:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:15:50,805 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:15:50,805 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:15:50,831 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-02-10 23:15:51,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:15:51,033 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:15:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:15:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 951718562, now seen corresponding path program 22 times [2022-02-10 23:15:51,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:15:51,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743451338] [2022-02-10 23:15:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:15:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:15:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:15:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:15:52,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:15:52,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743451338] [2022-02-10 23:15:52,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743451338] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:15:52,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772340261] [2022-02-10 23:15:52,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 23:15:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:15:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:15:53,004 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-02-10 23:15:53,006 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-02-10 23:15:53,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 23:15:53,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:15:53,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-10 23:15:53,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:15:53,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:15:53,542 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:15:53,542 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 11 treesize of output 11 [2022-02-10 23:15:56,198 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 43 treesize of output 41 [2022-02-10 23:15:56,406 INFO L353 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-02-10 23:15:56,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 20 [2022-02-10 23:15:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:15:56,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:15:56,717 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:15:56,743 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1)))) is different from false [2022-02-10 23:15:56,758 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-02-10 23:15:56,900 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) is different from false [2022-02-10 23:15:57,027 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1055) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0)) is different from false [2022-02-10 23:15:57,078 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-02-10 23:15:57,078 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 136 treesize of output 110 [2022-02-10 23:15:57,086 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 59 treesize of output 52 [2022-02-10 23:15:57,089 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 52 treesize of output 45 [2022-02-10 23:16:02,201 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 10 treesize of output 8 [2022-02-10 23:16:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2022-02-10 23:16:02,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772340261] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:16:02,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:16:02,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 87 [2022-02-10 23:16:02,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455895755] [2022-02-10 23:16:02,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:16:02,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-02-10 23:16:02,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:16:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-02-10 23:16:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=6207, Unknown=5, NotChecked=820, Total=7482 [2022-02-10 23:16:02,240 INFO L87 Difference]: Start difference. First operand 134392 states and 436181 transitions. Second operand has 87 states, 87 states have (on average 4.632183908045977) internal successors, (403), 87 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:16:09,656 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= (let ((.cse0 (* c_~front~0 4))) (+ c_~sum~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_1055) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) 1)) (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (let ((.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4))))))) (<= c_~back~0 c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)) (< c_~front~0 0))) is different from false [2022-02-10 23:16:11,802 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0)))) is different from false [2022-02-10 23:16:14,956 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (< c_~back~0 0))) is different from false [2022-02-10 23:16:16,818 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 0) (<= c_~n~0 (+ c_~back~0 1)) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (not (= (+ (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1) 0))) (= c_~sum~0 0)) is different from false [2022-02-10 23:16:18,260 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 (+ 2 c_~front~0))) (.cse1 (<= c_~n~0 (+ c_~back~0 2)))) (let ((.cse2 (or .cse0 .cse1 (<= c_~sum~0 1))) (.cse3 (or .cse0 .cse1 (<= 0 c_~sum~0))) (.cse4 (or .cse1 (<= c_~n~0 (+ 3 c_~front~0)))) (.cse5 (or .cse0 .cse1 (= (* c_~front~0 4) (* c_~back~0 4)))) (.cse6 (< c_~front~0 0))) (and (or (and (or .cse0 .cse1 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) .cse2 .cse3 .cse4 .cse5) .cse6) (or (and .cse2 .cse3 .cse4 (or .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret9#1.base|))) .cse5) .cse6) (or (and .cse2 .cse3 .cse4 (or .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|))) .cse5) (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (or (and .cse2 (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse1) .cse3 .cse4 .cse5) .cse6) (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (or (and .cse2 .cse3 .cse4 (or .cse0 .cse1 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse5) .cse6) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))))) is different from false [2022-02-10 23:16:19,216 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-02-10 23:16:21,491 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (< c_~back~0 0))) is different from false [2022-02-10 23:16:21,638 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~back~0) (and (forall ((v_ArrVal_1055 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1055 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1055) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) (< c_~back~0 0))) is different from false [2022-02-10 23:16:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:16:26,311 INFO L93 Difference]: Finished difference Result 336368 states and 1096044 transitions. [2022-02-10 23:16:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-02-10 23:16:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 4.632183908045977) internal successors, (403), 87 states have internal predecessors, (403), 0 states have call successors, (0), 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 156 [2022-02-10 23:16:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:16:27,826 INFO L225 Difference]: With dead ends: 336368 [2022-02-10 23:16:27,826 INFO L226 Difference]: Without dead ends: 325757 [2022-02-10 23:16:27,829 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 298 SyntacticMatches, 51 SemanticMatches, 255 ConstructedPredicates, 13 IntricatePredicates, 8 DeprecatedPredicates, 24040 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=5782, Invalid=53459, Unknown=103, NotChecked=6448, Total=65792 [2022-02-10 23:16:27,829 INFO L934 BasicCegarLoop]: 540 mSDtfsCounter, 4989 mSDsluCounter, 26597 mSDsCounter, 0 mSdLazyCounter, 5783 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4989 SdHoareTripleChecker+Valid, 24259 SdHoareTripleChecker+Invalid, 18009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 5783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12018 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:16:27,829 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4989 Valid, 24259 Invalid, 18009 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [208 Valid, 5783 Invalid, 0 Unknown, 12018 Unchecked, 3.1s Time] [2022-02-10 23:16:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325757 states. [2022-02-10 23:16:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325757 to 156127. [2022-02-10 23:16:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156127 states, 156126 states have (on average 3.2267207255678105) internal successors, (503775), 156126 states have internal predecessors, (503775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:16:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156127 states to 156127 states and 503775 transitions. [2022-02-10 23:16:35,464 INFO L78 Accepts]: Start accepts. Automaton has 156127 states and 503775 transitions. Word has length 156 [2022-02-10 23:16:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:16:35,465 INFO L470 AbstractCegarLoop]: Abstraction has 156127 states and 503775 transitions. [2022-02-10 23:16:35,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 4.632183908045977) internal successors, (403), 87 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:16:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 156127 states and 503775 transitions. [2022-02-10 23:16:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-10 23:16:35,621 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:16:35,621 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:16:35,637 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-02-10 23:16:35,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:16:35,822 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:16:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:16:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash -981717260, now seen corresponding path program 23 times [2022-02-10 23:16:35,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:16:35,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771290059] [2022-02-10 23:16:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:16:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:16:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:16:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:16:37,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:16:37,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771290059] [2022-02-10 23:16:37,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771290059] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:16:37,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701176530] [2022-02-10 23:16:37,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 23:16:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:16:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:16:37,608 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-02-10 23:16:37,609 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-02-10 23:16:37,749 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-02-10 23:16:37,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:16:37,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-10 23:16:37,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:16:38,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 23:16:38,994 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 48 treesize of output 46 [2022-02-10 23:16:39,071 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-10 23:16:39,071 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 53 treesize of output 19 [2022-02-10 23:16:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-10 23:16:39,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:16:39,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1096 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1096) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (forall ((v_ArrVal_1096 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1096) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:16:39,738 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-10 23:16:39,738 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 137 treesize of output 122 [2022-02-10 23:16:39,743 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 59 treesize of output 52 [2022-02-10 23:16:39,745 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 52 treesize of output 45 [2022-02-10 23:16:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 25 not checked. [2022-02-10 23:16:40,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701176530] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:16:40,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:16:40,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 17] total 64 [2022-02-10 23:16:40,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737173617] [2022-02-10 23:16:40,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:16:40,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-02-10 23:16:40,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:16:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-02-10 23:16:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3687, Unknown=2, NotChecked=122, Total=4032 [2022-02-10 23:16:40,831 INFO L87 Difference]: Start difference. First operand 156127 states and 503775 transitions. Second operand has 64 states, 64 states have (on average 6.125) internal successors, (392), 64 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:16:48,626 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1096 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1096) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))))) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1096 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1096) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 1))) is different from false [2022-02-10 23:16:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:16:55,653 INFO L93 Difference]: Finished difference Result 283375 states and 910125 transitions. [2022-02-10 23:16:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-02-10 23:16:55,654 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.125) internal successors, (392), 64 states have internal predecessors, (392), 0 states have call successors, (0), 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 156 [2022-02-10 23:16:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:16:57,180 INFO L225 Difference]: With dead ends: 283375 [2022-02-10 23:16:57,180 INFO L226 Difference]: Without dead ends: 283375 [2022-02-10 23:16:57,182 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 288 SyntacticMatches, 14 SemanticMatches, 188 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11107 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3644, Invalid=31510, Unknown=10, NotChecked=746, Total=35910 [2022-02-10 23:16:57,182 INFO L934 BasicCegarLoop]: 328 mSDtfsCounter, 3216 mSDsluCounter, 14411 mSDsCounter, 0 mSdLazyCounter, 6307 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3216 SdHoareTripleChecker+Valid, 13382 SdHoareTripleChecker+Invalid, 7656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 6307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1090 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:16:57,182 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3216 Valid, 13382 Invalid, 7656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 6307 Invalid, 0 Unknown, 1090 Unchecked, 3.0s Time] [2022-02-10 23:16:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283375 states. [2022-02-10 23:17:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283375 to 173893. [2022-02-10 23:17:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173893 states, 173892 states have (on average 3.2399822878568307) internal successors, (563407), 173892 states have internal predecessors, (563407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:17:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173893 states to 173893 states and 563407 transitions. [2022-02-10 23:17:04,195 INFO L78 Accepts]: Start accepts. Automaton has 173893 states and 563407 transitions. Word has length 156 [2022-02-10 23:17:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:17:04,195 INFO L470 AbstractCegarLoop]: Abstraction has 173893 states and 563407 transitions. [2022-02-10 23:17:04,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.125) internal successors, (392), 64 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:17:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 173893 states and 563407 transitions. [2022-02-10 23:17:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-10 23:17:04,452 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:17:04,452 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-10 23:17:04,469 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-02-10 23:17:04,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:17:04,653 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 23:17:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:17:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1304434893, now seen corresponding path program 24 times [2022-02-10 23:17:04,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:17:04,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168757475] [2022-02-10 23:17:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:17:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:17:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:17:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-10 23:17:05,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:17:05,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168757475] [2022-02-10 23:17:05,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168757475] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:17:05,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135667584] [2022-02-10 23:17:05,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 23:17:05,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:17:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:17:05,024 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-02-10 23:17:05,025 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-02-10 23:17:05,225 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-02-10 23:17:05,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:17:05,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-10 23:17:05,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:17:05,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-02-10 23:17:05,386 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 23:17:05,387 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 11 treesize of output 11 [2022-02-10 23:17:06,252 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-02-10 23:17:06,541 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-02-10 23:17:06,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 22 [2022-02-10 23:17:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 23:17:06,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:17:06,789 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1138 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))))) (forall ((v_ArrVal_1138 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3)) (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)))) 1))) is different from false [2022-02-10 23:17:07,135 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-02-10 23:17:07,136 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 182 treesize of output 224 [2022-02-10 23:17:07,144 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-02-10 23:17:07,144 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 89 treesize of output 69 [2022-02-10 23:17:07,150 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-02-10 23:17:07,150 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 69 treesize of output 49 [2022-02-10 23:17:08,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 10 treesize of output 8 [2022-02-10 23:17:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2022-02-10 23:17:08,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135667584] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:17:08,591 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:17:08,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 20] total 47 [2022-02-10 23:17:08,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380147850] [2022-02-10 23:17:08,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:17:08,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-10 23:17:08,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:17:08,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-10 23:17:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1856, Unknown=1, NotChecked=88, Total=2162 [2022-02-10 23:17:08,592 INFO L87 Difference]: Start difference. First operand 173893 states and 563407 transitions. Second operand has 47 states, 47 states have (on average 6.659574468085107) internal successors, (313), 47 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:17:11,099 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_1138 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~queue~0.base)) (.cse1 (* c_~front~0 4))) (+ c_~sum~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select .cse0 (+ c_~queue~0.offset .cse1 8)) (select .cse0 (+ c_~queue~0.offset .cse1 4)))))) (= (+ (- 1) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (forall ((v_ArrVal_1138 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1138) c_~queue~0.base)) (.cse3 (* c_~front~0 4))) (+ c_~sum~0 (select .cse2 (+ c_~queue~0.offset .cse3)) (select .cse2 (+ c_~queue~0.offset .cse3 8)) (select .cse2 (+ c_~queue~0.offset .cse3 4)))) 1)) (= c_~sum~0 0)) is different from false [2022-02-10 23:17:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:17:13,962 INFO L93 Difference]: Finished difference Result 240756 states and 778151 transitions. [2022-02-10 23:17:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-02-10 23:17:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.659574468085107) internal successors, (313), 47 states have internal predecessors, (313), 0 states have call successors, (0), 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 159 [2022-02-10 23:17:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:17:15,250 INFO L225 Difference]: With dead ends: 240756 [2022-02-10 23:17:15,250 INFO L226 Difference]: Without dead ends: 230103 [2022-02-10 23:17:15,250 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 286 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3920 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1525, Invalid=10691, Unknown=2, NotChecked=438, Total=12656 [2022-02-10 23:17:15,251 INFO L934 BasicCegarLoop]: 283 mSDtfsCounter, 2181 mSDsluCounter, 5786 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 5487 SdHoareTripleChecker+Invalid, 4261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1622 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:17:15,251 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2181 Valid, 5487 Invalid, 4261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 2404 Invalid, 0 Unknown, 1622 Unchecked, 1.3s Time] [2022-02-10 23:17:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230103 states. Received shutdown request... [2022-02-10 23:17:19,295 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-10 23:17:19,295 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-02-10 23:17:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230103 to 177553. [2022-02-10 23:17:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177553 states, 177552 states have (on average 3.233379516986573) internal successors, (574093), 177552 states have internal predecessors, (574093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:17:20,168 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-10 23:17:20,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-10 23:17:20,383 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,SelfDestructingSolverStorable33 [2022-02-10 23:17:20,384 WARN L594 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). [2022-02-10 23:17:20,386 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-10 23:17:20,386 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-02-10 23:17:20,386 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-02-10 23:17:20,389 INFO L733 BasicCegarLoop]: Path program histogram: [24, 3, 3, 1, 1, 1, 1] [2022-02-10 23:17:20,390 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 23:17:20,390 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 23:17:20,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 11:17:20 BasicIcfg [2022-02-10 23:17:20,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 23:17:20,392 INFO L158 Benchmark]: Toolchain (without parser) took 686733.25ms. Allocated memory was 174.1MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 118.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-02-10 23:17:20,392 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:17:20,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.77ms. Allocated memory was 174.1MB in the beginning and 244.3MB in the end (delta: 70.3MB). Free memory was 117.9MB in the beginning and 214.9MB in the end (delta: -97.0MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-02-10 23:17:20,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 244.3MB. Free memory was 214.9MB in the beginning and 213.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:17:20,393 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 244.3MB. Free memory was 212.8MB in the beginning and 211.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 23:17:20,393 INFO L158 Benchmark]: RCFGBuilder took 536.39ms. Allocated memory is still 244.3MB. Free memory was 211.7MB in the beginning and 192.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-10 23:17:20,393 INFO L158 Benchmark]: TraceAbstraction took 685905.52ms. Allocated memory was 244.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 191.8MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-02-10 23:17:20,394 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.77ms. Allocated memory was 174.1MB in the beginning and 244.3MB in the end (delta: 70.3MB). Free memory was 117.9MB in the beginning and 214.9MB in the end (delta: -97.0MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 244.3MB. Free memory was 214.9MB in the beginning and 213.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 244.3MB. Free memory was 212.8MB in the beginning and 211.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 536.39ms. Allocated memory is still 244.3MB. Free memory was 211.7MB in the beginning and 192.3MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 685905.52ms. Allocated memory was 244.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 191.8MB in the beginning and 6.1GB in the end (delta: -5.9GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - 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 ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 685.7s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 2.4s, AutomataDifference: 398.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105221 SdHoareTripleChecker+Valid, 50.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105221 mSDsluCounter, 228516 SdHoareTripleChecker+Invalid, 42.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 126733 IncrementalHoareTripleChecker+Unchecked, 246804 mSDsCounter, 10575 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94078 IncrementalHoareTripleChecker+Invalid, 231386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10575 mSolverCounterUnsat, 8829 mSDtfsCounter, 94078 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12365 GetRequests, 6592 SyntacticMatches, 591 SemanticMatches, 5182 ConstructedPredicates, 162 IntricatePredicates, 27 DeprecatedPredicates, 595689 ImplicationChecksByTransitivity, 334.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173893occurred in iteration=33, InterpolantAutomatonStates: 4041, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 2041476 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 195.1s InterpolantComputationTime, 8216 NumberOfCodeBlocks, 8216 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 11756 ConstructedInterpolants, 909 QuantifiedInterpolants, 225914 SizeOfPredicates, 790 NumberOfNonLiveVariables, 8914 ConjunctsInSsa, 1542 ConjunctsInUnsatCore, 84 InterpolantComputations, 9 PerfectInterpolantSequences, 786/3163 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