/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:40:58,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:40:58,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:40:58,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:40:58,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:40:58,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:40:58,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:40:58,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:40:58,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:40:58,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:40:58,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:40:58,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:40:58,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:40:58,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:40:58,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:40:58,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:40:58,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:40:58,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:40:58,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:40:58,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:40:58,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:40:58,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:40:58,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:40:58,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:40:58,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:40:58,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:40:58,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:40:58,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:40:58,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:40:58,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:40:58,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:40:58,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:40:58,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:40:58,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:40:58,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:40:58,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:40:58,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:40:58,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:40:58,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:40:58,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:40:58,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:40:58,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:40:58,435 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:40:58,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:40:58,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:40:58,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:40:58,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:40:58,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:40:58,437 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:40:58,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:40:58,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:40:58,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:40:58,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:40:58,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:40:58,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:40:58,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:40:58,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:40:58,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:40:58,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:40:58,440 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:40:58,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:40:58,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:40:58,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:40:58,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:40:58,650 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:40:58,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-03-15 19:40:58,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab8c8447/e7b3c769906f48cca76b43e91d810b08/FLAG5e63cc499 [2022-03-15 19:40:59,024 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:40:59,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2022-03-15 19:40:59,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab8c8447/e7b3c769906f48cca76b43e91d810b08/FLAG5e63cc499 [2022-03-15 19:40:59,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab8c8447/e7b3c769906f48cca76b43e91d810b08 [2022-03-15 19:40:59,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:40:59,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:40:59,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:40:59,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:40:59,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:40:59,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd08fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59, skipping insertion in model container [2022-03-15 19:40:59,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:40:59,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:40:59,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-03-15 19:40:59,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:40:59,672 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:40:59,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2022-03-15 19:40:59,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:40:59,715 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:40:59,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59 WrapperNode [2022-03-15 19:40:59,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:40:59,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:40:59,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:40:59,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:40:59,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,759 INFO L137 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 267 [2022-03-15 19:40:59,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:40:59,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:40:59,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:40:59,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:40:59,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:40:59,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:40:59,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:40:59,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:40:59,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (1/1) ... [2022-03-15 19:40:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:40:59,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:59,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:40:59,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:40:59,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:40:59,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:40:59,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:40:59,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:40:59,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:40:59,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:40:59,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:40:59,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:40:59,881 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:40:59,964 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:40:59,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:41:00,194 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:41:00,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:41:00,246 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-15 19:41:00,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:41:00 BoogieIcfgContainer [2022-03-15 19:41:00,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:41:00,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:41:00,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:41:00,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:41:00,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:40:59" (1/3) ... [2022-03-15 19:41:00,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316e0620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:41:00, skipping insertion in model container [2022-03-15 19:41:00,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:40:59" (2/3) ... [2022-03-15 19:41:00,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316e0620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:41:00, skipping insertion in model container [2022-03-15 19:41:00,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:41:00" (3/3) ... [2022-03-15 19:41:00,253 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2022-03-15 19:41:00,256 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:41:00,256 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:41:00,256 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:41:00,257 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:41:00,287 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,288 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,289 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,290 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,292 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,293 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,294 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,295 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,296 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,297 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,300 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,301 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,302 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,302 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,302 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,302 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,304 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,304 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,304 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~temp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,305 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~w~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,306 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~temp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,307 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,308 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:41:00,310 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:41:00,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:41:00,340 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:41:00,340 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:41:00,350 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:41:00,355 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 239 transitions, 510 flow [2022-03-15 19:41:00,359 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 239 transitions, 510 flow [2022-03-15 19:41:00,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 234 places, 239 transitions, 510 flow [2022-03-15 19:41:00,447 INFO L129 PetriNetUnfolder]: 18/235 cut-off events. [2022-03-15 19:41:00,447 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:41:00,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 235 events. 18/235 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 201. Up to 3 conditions per place. [2022-03-15 19:41:00,455 INFO L116 LiptonReduction]: Number of co-enabled transitions 2284 [2022-03-15 19:41:07,552 INFO L131 LiptonReduction]: Checked pairs total: 4898 [2022-03-15 19:41:07,552 INFO L133 LiptonReduction]: Total number of compositions: 237 [2022-03-15 19:41:07,558 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 41 transitions, 114 flow [2022-03-15 19:41:07,635 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 778 states, 777 states have (on average 3.7966537966537968) internal successors, (2950), 777 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 778 states, 777 states have (on average 3.7966537966537968) internal successors, (2950), 777 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:41:07,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:07,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:07,653 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 708783858, now seen corresponding path program 1 times [2022-03-15 19:41:07,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:07,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314684783] [2022-03-15 19:41:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:07,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:07,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314684783] [2022-03-15 19:41:07,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314684783] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:07,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:07,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:41:07,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687262306] [2022-03-15 19:41:07,965 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:07,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:08,031 INFO L252 McrAutomatonBuilder]: Finished intersection with 186 states and 467 transitions. [2022-03-15 19:41:08,031 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:09,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1797#(not (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 1798#(not (= (mod ~v_assert~0 256) 0))] [2022-03-15 19:41:09,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:41:09,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:09,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:41:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:41:09,145 INFO L87 Difference]: Start difference. First operand has 778 states, 777 states have (on average 3.7966537966537968) internal successors, (2950), 777 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:09,314 INFO L93 Difference]: Finished difference Result 840 states and 3082 transitions. [2022-03-15 19:41:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:41:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:41:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:09,335 INFO L225 Difference]: With dead ends: 840 [2022-03-15 19:41:09,335 INFO L226 Difference]: Without dead ends: 840 [2022-03-15 19:41:09,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:41:09,339 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:09,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:41:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-15 19:41:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 736. [2022-03-15 19:41:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 3.7197278911564626) internal successors, (2734), 735 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2734 transitions. [2022-03-15 19:41:09,414 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2734 transitions. Word has length 26 [2022-03-15 19:41:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:09,414 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 2734 transitions. [2022-03-15 19:41:09,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2734 transitions. [2022-03-15 19:41:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:41:09,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:09,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:09,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:41:09,418 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash -438912254, now seen corresponding path program 2 times [2022-03-15 19:41:09,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:09,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824504347] [2022-03-15 19:41:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:09,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:09,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824504347] [2022-03-15 19:41:09,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824504347] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:09,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:09,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:41:09,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429732574] [2022-03-15 19:41:09,537 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:09,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:09,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 213 transitions. [2022-03-15 19:41:09,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:10,154 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4118#(not (= (mod ~v_assert~0 256) 0)), 4117#(not (= (mod |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))] [2022-03-15 19:41:10,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:41:10,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:41:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:41:10,156 INFO L87 Difference]: Start difference. First operand 736 states and 2734 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:10,263 INFO L93 Difference]: Finished difference Result 828 states and 2994 transitions. [2022-03-15 19:41:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:41:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:41:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:10,268 INFO L225 Difference]: With dead ends: 828 [2022-03-15 19:41:10,268 INFO L226 Difference]: Without dead ends: 828 [2022-03-15 19:41:10,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:41:10,269 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:10,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 13 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:41:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-03-15 19:41:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 708. [2022-03-15 19:41:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 3.6577086280056577) internal successors, (2586), 707 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2586 transitions. [2022-03-15 19:41:10,286 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 2586 transitions. Word has length 26 [2022-03-15 19:41:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:10,287 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 2586 transitions. [2022-03-15 19:41:10,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 2586 transitions. [2022-03-15 19:41:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:41:10,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:10,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:10,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:41:10,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 659063630, now seen corresponding path program 3 times [2022-03-15 19:41:10,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:10,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296471481] [2022-03-15 19:41:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:10,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:10,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296471481] [2022-03-15 19:41:10,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296471481] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:10,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:10,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:41:10,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [571154041] [2022-03-15 19:41:10,401 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:10,405 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:10,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 136 transitions. [2022-03-15 19:41:10,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:10,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6373#(<= ~d2~0 (* 2 ~W~0)), 6372#(not (= (mod ~v_assert~0 256) 0)), 6371#(not (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))] [2022-03-15 19:41:10,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:41:10,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:41:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:41:10,669 INFO L87 Difference]: Start difference. First operand 708 states and 2586 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:10,835 INFO L93 Difference]: Finished difference Result 1348 states and 4858 transitions. [2022-03-15 19:41:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:41:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:41:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:10,840 INFO L225 Difference]: With dead ends: 1348 [2022-03-15 19:41:10,840 INFO L226 Difference]: Without dead ends: 914 [2022-03-15 19:41:10,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:41:10,841 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:10,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 5 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:41:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-03-15 19:41:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 790. [2022-03-15 19:41:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 3.632446134347275) internal successors, (2866), 789 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2866 transitions. [2022-03-15 19:41:10,857 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2866 transitions. Word has length 26 [2022-03-15 19:41:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:10,857 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2866 transitions. [2022-03-15 19:41:10,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2866 transitions. [2022-03-15 19:41:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:41:10,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:10,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:10,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:41:10,860 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1254338307, now seen corresponding path program 1 times [2022-03-15 19:41:10,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:10,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047786070] [2022-03-15 19:41:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:10,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:10,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047786070] [2022-03-15 19:41:10,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047786070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:10,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:10,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:41:10,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372199547] [2022-03-15 19:41:10,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:10,929 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:10,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 219 transitions. [2022-03-15 19:41:10,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:11,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9313#(or (< ~front2~0 0) (<= ~back2~0 ~front2~0))] [2022-03-15 19:41:11,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:41:11,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:41:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:41:11,455 INFO L87 Difference]: Start difference. First operand 790 states and 2866 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:11,499 INFO L93 Difference]: Finished difference Result 756 states and 2660 transitions. [2022-03-15 19:41:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:41:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:41:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:11,503 INFO L225 Difference]: With dead ends: 756 [2022-03-15 19:41:11,503 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 19:41:11,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:41:11,504 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:11,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:41:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 19:41:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-03-15 19:41:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 3.5231788079470197) internal successors, (2660), 755 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 2660 transitions. [2022-03-15 19:41:11,518 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 2660 transitions. Word has length 29 [2022-03-15 19:41:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:11,518 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 2660 transitions. [2022-03-15 19:41:11,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 2660 transitions. [2022-03-15 19:41:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:41:11,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:11,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:11,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:41:11,520 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1128067871, now seen corresponding path program 1 times [2022-03-15 19:41:11,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:11,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691781507] [2022-03-15 19:41:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:41:11,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:11,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691781507] [2022-03-15 19:41:11,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691781507] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:11,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:11,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:41:11,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986140740] [2022-03-15 19:41:11,593 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:11,598 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:11,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 190 states and 437 transitions. [2022-03-15 19:41:11,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:12,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:41:12,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:41:12,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:41:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:41:12,671 INFO L87 Difference]: Start difference. First operand 756 states and 2660 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:12,740 INFO L93 Difference]: Finished difference Result 898 states and 3049 transitions. [2022-03-15 19:41:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:41:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:41:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:12,744 INFO L225 Difference]: With dead ends: 898 [2022-03-15 19:41:12,744 INFO L226 Difference]: Without dead ends: 757 [2022-03-15 19:41:12,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:41:12,745 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:12,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:41:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-03-15 19:41:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2022-03-15 19:41:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 756 states have (on average 3.5198412698412698) internal successors, (2661), 756 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 2661 transitions. [2022-03-15 19:41:12,759 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 2661 transitions. Word has length 32 [2022-03-15 19:41:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:12,760 INFO L470 AbstractCegarLoop]: Abstraction has 757 states and 2661 transitions. [2022-03-15 19:41:12,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 2661 transitions. [2022-03-15 19:41:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:41:12,762 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:12,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:12,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:41:12,762 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 938800710, now seen corresponding path program 1 times [2022-03-15 19:41:12,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:12,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762890390] [2022-03-15 19:41:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:41:12,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:12,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762890390] [2022-03-15 19:41:12,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762890390] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:12,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:12,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:41:12,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365351581] [2022-03-15 19:41:12,817 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:12,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:12,913 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 438 transitions. [2022-03-15 19:41:12,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:14,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:41:14,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:41:14,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:41:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:41:14,612 INFO L87 Difference]: Start difference. First operand 757 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:14,665 INFO L93 Difference]: Finished difference Result 693 states and 2328 transitions. [2022-03-15 19:41:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:41:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:41:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:14,685 INFO L225 Difference]: With dead ends: 693 [2022-03-15 19:41:14,685 INFO L226 Difference]: Without dead ends: 663 [2022-03-15 19:41:14,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 63 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:41:14,688 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:14,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:41:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-03-15 19:41:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2022-03-15 19:41:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 3.404833836858006) internal successors, (2254), 662 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 2254 transitions. [2022-03-15 19:41:14,713 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 2254 transitions. Word has length 33 [2022-03-15 19:41:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:14,713 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 2254 transitions. [2022-03-15 19:41:14,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 2254 transitions. [2022-03-15 19:41:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:41:14,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:14,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:14,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:41:14,721 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 453410953, now seen corresponding path program 1 times [2022-03-15 19:41:14,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:14,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646790356] [2022-03-15 19:41:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:41:14,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:14,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646790356] [2022-03-15 19:41:14,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646790356] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:41:14,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:41:14,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:41:14,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1651536908] [2022-03-15 19:41:14,770 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:14,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:14,822 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 329 transitions. [2022-03-15 19:41:14,822 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:15,579 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:41:15,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:41:15,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:41:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:41:15,580 INFO L87 Difference]: Start difference. First operand 663 states and 2254 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:15,632 INFO L93 Difference]: Finished difference Result 733 states and 2412 transitions. [2022-03-15 19:41:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:41:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:41:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:15,635 INFO L225 Difference]: With dead ends: 733 [2022-03-15 19:41:15,635 INFO L226 Difference]: Without dead ends: 664 [2022-03-15 19:41:15,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 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-03-15 19:41:15,636 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:15,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:41:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-03-15 19:41:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2022-03-15 19:41:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 3.401206636500754) internal successors, (2255), 663 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 2255 transitions. [2022-03-15 19:41:15,649 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 2255 transitions. Word has length 35 [2022-03-15 19:41:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:15,649 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 2255 transitions. [2022-03-15 19:41:15,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 2255 transitions. [2022-03-15 19:41:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:41:15,651 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:15,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:15,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:41:15,651 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:41:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1492083073, now seen corresponding path program 1 times [2022-03-15 19:41:15,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:15,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201419266] [2022-03-15 19:41:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:16,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:16,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201419266] [2022-03-15 19:41:16,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201419266] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:16,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110466259] [2022-03-15 19:41:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:16,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:16,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:16,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:41:16,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:41:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:16,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 19:41:16,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:17,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:17,018 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 75 treesize of output 73 [2022-03-15 19:41:17,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:41:17,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:41:17,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:41:17,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:41:18,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:41:18,103 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:18,104 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 36 treesize of output 20 [2022-03-15 19:41:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:18,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:18,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:18,700 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 58732 treesize of output 54720 [2022-03-15 19:41:18,942 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:18,943 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 54608 treesize of output 42320 [2022-03-15 19:41:19,076 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:19,077 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 42272 treesize of output 39236 [2022-03-15 19:41:19,218 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:41:19,218 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 39058 treesize of output 32938 [2022-03-15 19:41:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:56,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110466259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:56,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:56,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-03-15 19:41:56,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395621781] [2022-03-15 19:41:56,443 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:56,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:56,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 155 states and 330 transitions. [2022-03-15 19:41:56,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:06,575 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [18353#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0))) (or (<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 18355#(and (or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0)) (or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0))), 18352#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~d2~0 (* 2 ~W~0))) (or (<= ~d2~0 (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 18363#(or (not (= (+ (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (< ~front1~0 0) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~n1~0 ~front1~0) (<= ~back1~0 ~front1~0) (= (mod ~v_assert~0 256) 0)), 18262#(not (<= (mod ~v_assert~0 256) 0)), 18361#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= ~back2~0 ~front2~0)), 18364#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front1~0)) (or (not (= (mod ~v_assert~0 256) 0)) (<= 0 ~front1~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front1~0 0)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= (mod ~v_assert~0 256) 0)) (not (= ~queue1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))) (or (= ~queue1~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= ~queue1~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (not (= ~queue1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= ~front1~0 0))), 18272#(<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0)), 18362#(or (not (= (+ |thread2Thread1of1ForFork3_~temp~0#1| 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0)), 18258#(not (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 18360#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front1~0)) (or (not (= (mod ~v_assert~0 256) 0)) (<= 0 ~front1~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~front1~0 0)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue1~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= ~queue1~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= ~front1~0 0))), 18350#(or (not (= (+ |thread2Thread1of1ForFork3_~temp~0#1| 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod ~v_assert~0 256) 0)), 18346#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0)), 18348#(or (not (= (+ (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (< ~front1~0 0) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (<= ~n1~0 ~front1~0) (<= ~back1~0 ~front1~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 18359#(and (or (not (= (+ (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (< ~front1~0 0) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (<= ~n1~0 ~front1~0) (not (= (mod ~v_assert~0 256) 0)) (<= ~back1~0 ~front1~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (not (= (+ (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (< ~front1~0 0) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~n1~0 ~front1~0) (<= ~back1~0 ~front1~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), 18357#(and (or (not (= (+ |thread2Thread1of1ForFork3_~temp~0#1| 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (not (= (+ |thread2Thread1of1ForFork3_~temp~0#1| 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0))), 18349#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod ~v_assert~0 256) 0) (<= ~back2~0 ~front2~0)), 18358#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (= |thread2Thread1of1ForFork3_~temp~0#1| 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= |thread2Thread1of1ForFork3_~temp~0#1| 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0)))), 18351#(or (not (= (+ (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (< ~front1~0 0) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (<= ~n1~0 ~front1~0) (<= ~back1~0 ~front1~0) (= (mod ~v_assert~0 256) 0)), 18347#(or (not (= (+ |thread2Thread1of1ForFork3_~temp~0#1| 1) (select (select |#memory_int| ~queue2~0.base) (+ (* ~back2~0 4) ~queue2~0.offset)))) (<= ~n2~0 ~back2~0) (< ~front2~0 0) (<= (+ ~back2~0 1) ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 18354#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= |thread3Thread1of1ForFork0_~temp~1#1| (* 2 ~W~0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (<= |thread3Thread1of1ForFork0_~temp~1#1| (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 18356#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= 0 ~front2~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front2~0)) (or (<= ~front2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~front2~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))))] [2022-03-15 19:42:06,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:42:06,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:06,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:42:06,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=4055, Unknown=21, NotChecked=0, Total=4556 [2022-03-15 19:42:06,577 INFO L87 Difference]: Start difference. First operand 664 states and 2255 transitions. Second operand has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:37,343 INFO L93 Difference]: Finished difference Result 4183 states and 14463 transitions. [2022-03-15 19:42:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-03-15 19:42:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-03-15 19:42:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:37,375 INFO L225 Difference]: With dead ends: 4183 [2022-03-15 19:42:37,375 INFO L226 Difference]: Without dead ends: 3551 [2022-03-15 19:42:37,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 109 SyntacticMatches, 25 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28381 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=9449, Invalid=65332, Unknown=21, NotChecked=0, Total=74802 [2022-03-15 19:42:37,390 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1242 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 6340 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 6340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:37,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1242 Valid, 7 Invalid, 7026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 6340 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 19:42:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2022-03-15 19:42:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 1019. [2022-03-15 19:42:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.343811394891945) internal successors, (3404), 1018 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 3404 transitions. [2022-03-15 19:42:37,470 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 3404 transitions. Word has length 36 [2022-03-15 19:42:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:37,470 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 3404 transitions. [2022-03-15 19:42:37,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8461538461538463) internal successors, (150), 38 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 3404 transitions. [2022-03-15 19:42:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:42:37,474 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:37,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:37,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-03-15 19:42:37,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:37,691 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:42:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1908559761, now seen corresponding path program 2 times [2022-03-15 19:42:37,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:37,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714346584] [2022-03-15 19:42:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:38,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:38,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714346584] [2022-03-15 19:42:38,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714346584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:38,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428580369] [2022-03-15 19:42:38,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:42:38,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:38,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:38,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:42:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:42:38,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:42:38,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:38,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:42:38,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:38,867 INFO L353 Elim1Store]: treesize reduction 140, result has 24.3 percent of original size [2022-03-15 19:42:38,867 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 4 case distinctions, treesize of input 113 treesize of output 142 [2022-03-15 19:42:38,992 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:42:38,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-15 19:42:39,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:42:39,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:42:39,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2022-03-15 19:42:39,792 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 0 case distinctions, treesize of input 36 treesize of output 12 [2022-03-15 19:42:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:39,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:40,013 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int))) (<= (+ c_~d2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_369) c_~queue2~0.base) (+ c_~queue2~0.offset (* c_~front2~0 4)))) (* c_~W~0 2))) is different from false [2022-03-15 19:42:40,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:42:40,335 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 3336 treesize of output 3116 [2022-03-15 19:42:40,392 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:42:40,392 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 3004 treesize of output 2812 [2022-03-15 19:42:40,426 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:42:40,427 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 2764 treesize of output 2332 [2022-03-15 19:42:40,454 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 1270 treesize of output 1078 [2022-03-15 19:43:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:07,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428580369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:07,952 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:07,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-03-15 19:43:07,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799896127] [2022-03-15 19:43:07,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:07,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:07,994 INFO L252 McrAutomatonBuilder]: Finished intersection with 119 states and 226 transitions. [2022-03-15 19:43:07,994 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:13,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [25262#(and (or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0)) (or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0))), 25170#(not (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 25267#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 (+ (* ~front1~0 4) ~queue1~0.offset 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (* ~front1~0 4) ~queue1~0.offset) 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (< 0 (+ (* ~front1~0 4) ~queue1~0.offset 1)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (* ~front1~0 4) ~queue1~0.offset) 0)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0)))), 25269#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 (+ (* ~front1~0 4) ~queue1~0.offset 1)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (* ~front1~0 4) ~queue1~0.offset) 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 (+ (* ~front1~0 4) ~queue1~0.offset 1)) (not (= (mod ~v_assert~0 256) 0))) (or (= (select (select |#memory_int| ~queue1~0.base) (+ (* ~front1~0 4) ~queue1~0.offset)) 1) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ (* ~front1~0 4) ~queue1~0.offset) 0)) (or (not (= ~queue1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0)))), 25268#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= (mod ~v_assert~0 256) 0) (<= ~back2~0 ~front2~0)), 25261#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0))) (or (<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 25258#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0) (<= ~back2~0 ~front2~0)), 25187#(<= (+ |thread3Thread1of1ForFork0_~temp~1#1| ~d2~0) (* 2 ~W~0)), 25174#(not (<= (mod ~v_assert~0 256) 0)), 25266#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (not (= (mod ~v_assert~0 256) 0)) (= ~front2~0 ~back2~0)) (or (= |thread2Thread1of1ForFork3_~temp~0#1| 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= 1 ~W~0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= (+ ~queue2~0.offset (* ~front2~0 4)) 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~front2~0 ~back2~0)) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 1 ~W~0)) (or (not (= (+ (* ~back2~0 4) ~queue2~0.offset) 0)) (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))) (or (= |thread2Thread1of1ForFork3_~temp~0#1| 1) (not (= (mod ~v_assert~0 256) 0))) (or (<= (+ (* ~back2~0 4) ~queue2~0.offset) 0) (<= ~n2~0 1) (not (= (mod ~v_assert~0 256) 0)))), 25259#(or (< ~front2~0 0) (<= ~n2~0 ~front2~0) (<= (+ (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) ~d2~0) (* 2 ~W~0)) (= (mod ~v_assert~0 256) 0) (<= ~back2~0 ~front2~0)), 25263#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= |thread3Thread1of1ForFork0_~temp~1#1| (* 2 ~W~0))) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (<= |thread3Thread1of1ForFork0_~temp~1#1| (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 25264#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= 0 ~front2~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front2~0)) (or (<= ~front2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~front2~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0)))), 25260#(and (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= ~d2~0 (* 2 ~W~0))) (or (<= ~d2~0 (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0)))), 25265#(and (or (= ~d2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (not (= (mod ~v_assert~0 256) 0)) (<= 0 ~front2~0)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (<= 0 ~front2~0)) (or (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (not (= ~queue2~0.base |ULTIMATE.start_main_~#t4~0#1.base|)) (not (= (mod ~v_assert~0 256) 0))) (or (<= ~front2~0 0) (not (= (mod ~v_assert~0 256) 0))) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= ~front2~0 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (< 0 |thread1Thread1of1ForFork1_~w~0#1|) (= ~d2~0 0)) (or (= ~queue2~0.offset 0) (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (or (<= (select (select |#memory_int| ~queue2~0.base) (+ ~queue2~0.offset (* ~front2~0 4))) (* 2 ~W~0)) (not (= (mod ~v_assert~0 256) 0))) (or (= ~queue2~0.offset 0) (not (= (mod ~v_assert~0 256) 0))))] [2022-03-15 19:43:13,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:43:13,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:43:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3330, Unknown=6, NotChecked=118, Total=3782 [2022-03-15 19:43:13,389 INFO L87 Difference]: Start difference. First operand 1019 states and 3404 transitions. Second operand has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:40,848 INFO L93 Difference]: Finished difference Result 4293 states and 14828 transitions. [2022-03-15 19:43:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-03-15 19:43:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 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 36 [2022-03-15 19:43:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:40,864 INFO L225 Difference]: With dead ends: 4293 [2022-03-15 19:43:40,864 INFO L226 Difference]: Without dead ends: 3783 [2022-03-15 19:43:40,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 83 SyntacticMatches, 24 SemanticMatches, 244 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21419 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=6733, Invalid=53045, Unknown=6, NotChecked=486, Total=60270 [2022-03-15 19:43:40,869 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 693 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 5025 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 5519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 5025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:40,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 15 Invalid, 5519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 5025 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 19:43:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-03-15 19:43:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 1019. [2022-03-15 19:43:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.343811394891945) internal successors, (3404), 1018 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 3404 transitions. [2022-03-15 19:43:40,913 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 3404 transitions. Word has length 36 [2022-03-15 19:43:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:40,913 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 3404 transitions. [2022-03-15 19:43:40,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 32 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 3404 transitions. [2022-03-15 19:43:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:43:40,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:40,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:40,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:41,134 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,SelfDestructingSolverStorable8 [2022-03-15 19:43:41,135 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:43:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2068724557, now seen corresponding path program 3 times [2022-03-15 19:43:41,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:41,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940453769] [2022-03-15 19:43:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:42,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:42,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940453769] [2022-03-15 19:43:42,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940453769] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:42,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782278739] [2022-03-15 19:43:42,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:42,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:42,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:43:42,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:43:42,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:42,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:43:42,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:42,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:42,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:42,193 INFO L353 Elim1Store]: treesize reduction 86, result has 32.8 percent of original size [2022-03-15 19:43:42,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 47 [2022-03-15 19:43:42,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:43:42,316 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:43:42,317 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 16 treesize of output 18 [2022-03-15 19:43:42,386 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-03-15 19:43:42,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:43:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:42,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:43,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:43,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:43:43,163 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:43:43,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-03-15 19:43:43,173 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 29 treesize of output 17 [2022-03-15 19:43:43,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:43,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:43,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array Int Int))) (<= (+ c_~d2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_450) c_~queue2~0.base) (+ c_~queue2~0.offset (* c_~front2~0 4)))) (* c_~W~0 2))) is different from false [2022-03-15 19:43:43,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_450 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_450) c_~queue2~0.base) (+ c_~queue2~0.offset (* c_~front2~0 4))) c_~d2~0) (* c_~W~0 2))) is different from false [2022-03-15 19:43:44,584 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 19:43:44,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 221 treesize of output 119 [2022-03-15 19:43:44,700 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:44,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6890 treesize of output 6796 [2022-03-15 19:43:44,774 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 5782 treesize of output 5398 [2022-03-15 19:43:44,844 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:44,847 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 3490 treesize of output 3154 [2022-03-15 19:43:44,887 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 5206 treesize of output 4438 [2022-03-15 19:43:45,000 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:45,000 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 5060 treesize of output 4958 Received shutdown request... [2022-03-15 19:55:02,172 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 19:55:02,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:02,176 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:02,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:02,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:02,377 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. [2022-03-15 19:55:02,378 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 19:55:02,378 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 19:55:02,378 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 19:55:02,378 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 19:55:02,379 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-03-15 19:55:02,381 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:55:02,381 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:55:02,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:55:02 BasicIcfg [2022-03-15 19:55:02,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:55:02,382 INFO L158 Benchmark]: Toolchain (without parser) took 842928.30ms. Allocated memory was 166.7MB in the beginning and 1.2GB in the end (delta: 990.9MB). Free memory was 110.6MB in the beginning and 903.7MB in the end (delta: -793.1MB). Peak memory consumption was 829.0MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,382 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:55:02,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.23ms. Allocated memory was 166.7MB in the beginning and 216.0MB in the end (delta: 49.3MB). Free memory was 110.3MB in the beginning and 185.6MB in the end (delta: -75.3MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,383 INFO L158 Benchmark]: Boogie Preprocessor took 39.10ms. Allocated memory is still 216.0MB. Free memory was 183.1MB in the beginning and 181.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,383 INFO L158 Benchmark]: RCFGBuilder took 448.13ms. Allocated memory is still 216.0MB. Free memory was 181.0MB in the beginning and 153.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,383 INFO L158 Benchmark]: TraceAbstraction took 842133.11ms. Allocated memory was 216.0MB in the beginning and 1.2GB in the end (delta: 941.6MB). Free memory was 153.3MB in the beginning and 903.7MB in the end (delta: -750.4MB). Peak memory consumption was 823.7MB. Max. memory is 8.0GB. [2022-03-15 19:55:02,384 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.23ms. Allocated memory was 166.7MB in the beginning and 216.0MB in the end (delta: 49.3MB). Free memory was 110.3MB in the beginning and 185.6MB in the end (delta: -75.3MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.10ms. Allocated memory is still 216.0MB. Free memory was 183.1MB in the beginning and 181.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.13ms. Allocated memory is still 216.0MB. Free memory was 181.0MB in the beginning and 153.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 842133.11ms. Allocated memory was 216.0MB in the beginning and 1.2GB in the end (delta: 941.6MB). Free memory was 153.3MB in the beginning and 903.7MB in the end (delta: -750.4MB). Peak memory consumption was 823.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 234 PlacesBefore, 49 PlacesAfterwards, 239 TransitionsBefore, 41 TransitionsAfterwards, 2284 CoEnabledTransitionPairs, 8 FixpointIterations, 152 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 237 TotalNumberOfCompositions, 4898 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3772, positive: 3621, positive conditional: 0, positive unconditional: 3621, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1268, positive: 1238, positive conditional: 0, positive unconditional: 1238, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3772, positive: 2383, positive conditional: 0, positive unconditional: 2383, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - 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: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 260 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 842.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 59.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2310 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2310 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2909 mSDsCounter, 1204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12207 IncrementalHoareTripleChecker+Invalid, 13411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1204 mSolverCounterUnsat, 25 mSDtfsCounter, 12207 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1587 GetRequests, 915 SyntacticMatches, 127 SemanticMatches, 545 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49829 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1019occurred in iteration=8, InterpolantAutomatonStates: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 5644 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 70.9s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 410 ConstructedInterpolants, 28 QuantifiedInterpolants, 8695 SizeOfPredicates, 69 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 16/40 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