/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-more-buffer-mult.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:21:47,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:21:47,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:21:47,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:21:47,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:21:47,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:21:47,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:21:47,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:21:47,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:21:47,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:21:47,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:21:47,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:21:47,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:21:47,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:21:47,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:21:47,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:21:47,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:21:47,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:21:47,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:21:47,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:21:47,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:21:47,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:21:47,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:21:47,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:21:47,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:21:47,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:21:47,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:21:47,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:21:47,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:21:47,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:21:47,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:21:47,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:21:47,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:21:47,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:21:47,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:21:47,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:21:47,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:21:47,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:21:47,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:21:47,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:21:47,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:21:47,732 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:21:47,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:21:47,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:21:47,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:21:47,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:21:47,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:21:47,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:21:47,756 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:21:47,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:21:47,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:21:47,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:21:47,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:21:47,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:21:47,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:21:47,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:21:47,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:21:47,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:21:47,759 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:21:47,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:21:47,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:21:47,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:21:47,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:21:47,967 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:21:47,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2022-03-15 19:21:48,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76b2026e/fe9657ad6dd740c5994daa473b0c3d28/FLAGde5eda6f3 [2022-03-15 19:21:48,390 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:21:48,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2022-03-15 19:21:48,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76b2026e/fe9657ad6dd740c5994daa473b0c3d28/FLAGde5eda6f3 [2022-03-15 19:21:48,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76b2026e/fe9657ad6dd740c5994daa473b0c3d28 [2022-03-15 19:21:48,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:21:48,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:21:48,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:21:48,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:21:48,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:21:48,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de18e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48, skipping insertion in model container [2022-03-15 19:21:48,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:21:48,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:21:48,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-03-15 19:21:48,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:21:48,664 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:21:48,681 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-more-buffer-mult.wvr.c[4218,4231] [2022-03-15 19:21:48,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:21:48,693 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:21:48,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48 WrapperNode [2022-03-15 19:21:48,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:21:48,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:21:48,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:21:48,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:21:48,698 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:21:48" (1/1) ... [2022-03-15 19:21:48,704 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:21:48" (1/1) ... [2022-03-15 19:21:48,733 INFO L137 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 307 [2022-03-15 19:21:48,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:21:48,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:21:48,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:21:48,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:21:48,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:21:48,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:21:48,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:21:48,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:21:48,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (1/1) ... [2022-03-15 19:21:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:21:48,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:48,806 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:21:48,810 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:21:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:21:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:21:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:21:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:21:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:21:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:21:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:21:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:21:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:21:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:21:48,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:21:48,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:21:48,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:21:48,847 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:21:48,919 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:21:48,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:21:49,284 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:21:49,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:21:49,385 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 19:21:49,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:21:49 BoogieIcfgContainer [2022-03-15 19:21:49,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:21:49,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:21:49,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:21:49,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:21:49,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:21:48" (1/3) ... [2022-03-15 19:21:49,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6808a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:21:49, skipping insertion in model container [2022-03-15 19:21:49,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:21:48" (2/3) ... [2022-03-15 19:21:49,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6808a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:21:49, skipping insertion in model container [2022-03-15 19:21:49,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:21:49" (3/3) ... [2022-03-15 19:21:49,395 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2022-03-15 19:21:49,399 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:21:49,399 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:21:49,399 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:21:49,399 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:21:49,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,434 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,435 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,436 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,437 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,438 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,439 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,440 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,441 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,441 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,446 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,446 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,446 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,446 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,446 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,447 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,448 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,449 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,450 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,450 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,450 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,453 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,454 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,455 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,455 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,455 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,455 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,455 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,456 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,457 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:21:49,462 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:21:49,488 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:21:49,497 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:21:49,497 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:21:49,511 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:21:49,516 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 231 transitions, 494 flow [2022-03-15 19:21:49,520 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 231 transitions, 494 flow [2022-03-15 19:21:49,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 226 places, 231 transitions, 494 flow [2022-03-15 19:21:49,610 INFO L129 PetriNetUnfolder]: 18/227 cut-off events. [2022-03-15 19:21:49,610 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:21:49,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2022-03-15 19:21:49,620 INFO L116 LiptonReduction]: Number of co-enabled transitions 2000 [2022-03-15 19:21:56,609 INFO L131 LiptonReduction]: Checked pairs total: 4038 [2022-03-15 19:21:56,610 INFO L133 LiptonReduction]: Total number of compositions: 222 [2022-03-15 19:21:56,621 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 42 transitions, 116 flow [2022-03-15 19:21:56,683 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:21:56,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:56,699 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] [2022-03-15 19:21:56,700 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:21:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash 899189337, now seen corresponding path program 1 times [2022-03-15 19:21:56,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:56,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511393763] [2022-03-15 19:21:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:57,015 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:21:57,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:57,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511393763] [2022-03-15 19:21:57,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511393763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:21:57,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:21:57,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:21:57,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058889310] [2022-03-15 19:21:57,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:57,024 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:57,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 324 states and 947 transitions. [2022-03-15 19:21:57,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:59,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:21:59,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:21:59,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:21:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:21:59,423 INFO L87 Difference]: Start difference. First operand has 854 states, 853 states have (on average 4.173505275498242) internal successors, (3560), 853 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:59,490 INFO L93 Difference]: Finished difference Result 1261 states and 5285 transitions. [2022-03-15 19:21:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:21:59,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:21:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:59,506 INFO L225 Difference]: With dead ends: 1261 [2022-03-15 19:21:59,506 INFO L226 Difference]: Without dead ends: 1216 [2022-03-15 19:21:59,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:21:59,509 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:59,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:21:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-03-15 19:21:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2022-03-15 19:21:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 4.195884773662551) internal successors, (5098), 1215 states have internal predecessors, (5098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 5098 transitions. [2022-03-15 19:21:59,576 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 5098 transitions. Word has length 27 [2022-03-15 19:21:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:59,577 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 5098 transitions. [2022-03-15 19:21:59,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 5098 transitions. [2022-03-15 19:21:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:21:59,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:59,580 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:21:59,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:21:59,581 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:21:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1719496711, now seen corresponding path program 1 times [2022-03-15 19:21:59,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:59,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553461317] [2022-03-15 19:21:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:59,622 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:21:59,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:59,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553461317] [2022-03-15 19:21:59,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553461317] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:21:59,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:21:59,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:21:59,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568445599] [2022-03-15 19:21:59,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:59,627 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:59,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 342 states and 989 transitions. [2022-03-15 19:21:59,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:01,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5636#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0))] [2022-03-15 19:22:01,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:01,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:01,551 INFO L87 Difference]: Start difference. First operand 1216 states and 5098 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:22:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:01,642 INFO L93 Difference]: Finished difference Result 1666 states and 6698 transitions. [2022-03-15 19:22:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:22:01,642 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:22:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:01,651 INFO L225 Difference]: With dead ends: 1666 [2022-03-15 19:22:01,651 INFO L226 Difference]: Without dead ends: 1630 [2022-03-15 19:22:01,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:01,652 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:01,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2022-03-15 19:22:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1472. [2022-03-15 19:22:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1471 states have (on average 4.131883072739633) internal successors, (6078), 1471 states have internal predecessors, (6078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 6078 transitions. [2022-03-15 19:22:01,692 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 6078 transitions. Word has length 29 [2022-03-15 19:22:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:01,692 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 6078 transitions. [2022-03-15 19:22:01,692 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:22:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 6078 transitions. [2022-03-15 19:22:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:22:01,696 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:01,696 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:22:01,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:22:01,696 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:22:01,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash -81903034, now seen corresponding path program 1 times [2022-03-15 19:22:01,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:01,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179352] [2022-03-15 19:22:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:01,755 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:22:01,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:01,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179352] [2022-03-15 19:22:01,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:01,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:01,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:22:01,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1295639811] [2022-03-15 19:22:01,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:01,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:01,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 484 states and 1485 transitions. [2022-03-15 19:22:01,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:05,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10250#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:22:05,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:05,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:05,973 INFO L87 Difference]: Start difference. First operand 1472 states and 6078 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:06,058 INFO L93 Difference]: Finished difference Result 1908 states and 7597 transitions. [2022-03-15 19:22:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:22:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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:22:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:06,068 INFO L225 Difference]: With dead ends: 1908 [2022-03-15 19:22:06,068 INFO L226 Difference]: Without dead ends: 1842 [2022-03-15 19:22:06,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:06,071 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:06,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2022-03-15 19:22:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1732. [2022-03-15 19:22:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 4.056036972848065) internal successors, (7021), 1731 states have internal predecessors, (7021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 7021 transitions. [2022-03-15 19:22:06,132 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 7021 transitions. Word has length 29 [2022-03-15 19:22:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:06,132 INFO L470 AbstractCegarLoop]: Abstraction has 1732 states and 7021 transitions. [2022-03-15 19:22:06,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 7021 transitions. [2022-03-15 19:22:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:22:06,139 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:06,139 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] [2022-03-15 19:22:06,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:22:06,139 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:22:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1963264201, now seen corresponding path program 1 times [2022-03-15 19:22:06,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:06,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196413964] [2022-03-15 19:22:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:06,200 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:22:06,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:06,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196413964] [2022-03-15 19:22:06,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196413964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:06,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:06,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:22:06,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232211091] [2022-03-15 19:22:06,203 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:06,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:06,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 274 states and 741 transitions. [2022-03-15 19:22:06,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:07,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:22:07,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:07,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:07,720 INFO L87 Difference]: Start difference. First operand 1732 states and 7021 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:22:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:07,828 INFO L93 Difference]: Finished difference Result 3105 states and 11795 transitions. [2022-03-15 19:22:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:22:07,828 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 31 [2022-03-15 19:22:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:07,844 INFO L225 Difference]: With dead ends: 3105 [2022-03-15 19:22:07,844 INFO L226 Difference]: Without dead ends: 2985 [2022-03-15 19:22:07,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 243 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:22:07,845 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:07,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 23 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2022-03-15 19:22:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2047. [2022-03-15 19:22:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2046 states have (on average 4.027370478983382) internal successors, (8240), 2046 states have internal predecessors, (8240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 8240 transitions. [2022-03-15 19:22:07,906 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 8240 transitions. Word has length 31 [2022-03-15 19:22:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:07,906 INFO L470 AbstractCegarLoop]: Abstraction has 2047 states and 8240 transitions. [2022-03-15 19:22:07,906 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:22:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 8240 transitions. [2022-03-15 19:22:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:22:07,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:07,915 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] [2022-03-15 19:22:07,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:22:07,915 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:22:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -824778415, now seen corresponding path program 1 times [2022-03-15 19:22:07,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:07,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710335118] [2022-03-15 19:22:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:07,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:07,971 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:22:07,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:07,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710335118] [2022-03-15 19:22:07,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710335118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:07,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:07,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:22:07,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [396277306] [2022-03-15 19:22:07,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:07,980 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:08,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 394 states and 1131 transitions. [2022-03-15 19:22:08,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:10,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:22:10,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:22:10,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:22:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:22:10,560 INFO L87 Difference]: Start difference. First operand 2047 states and 8240 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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:22:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:10,646 INFO L93 Difference]: Finished difference Result 2861 states and 11025 transitions. [2022-03-15 19:22:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:22:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 31 [2022-03-15 19:22:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:10,660 INFO L225 Difference]: With dead ends: 2861 [2022-03-15 19:22:10,660 INFO L226 Difference]: Without dead ends: 2674 [2022-03-15 19:22:10,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 364 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:22:10,661 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:10,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 18 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-03-15 19:22:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2444. [2022-03-15 19:22:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2443 states have (on average 3.9975440032746623) internal successors, (9766), 2443 states have internal predecessors, (9766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 9766 transitions. [2022-03-15 19:22:10,718 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 9766 transitions. Word has length 31 [2022-03-15 19:22:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:10,718 INFO L470 AbstractCegarLoop]: Abstraction has 2444 states and 9766 transitions. [2022-03-15 19:22:10,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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:22:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 9766 transitions. [2022-03-15 19:22:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:10,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:10,723 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:22:10,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:22:10,723 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:22:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1938046319, now seen corresponding path program 1 times [2022-03-15 19:22:10,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:10,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92667665] [2022-03-15 19:22:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:22:10,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:10,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92667665] [2022-03-15 19:22:10,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92667665] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:10,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007100217] [2022-03-15 19:22:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:10,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:10,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:10,954 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:22:11,000 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:22:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:11,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:22:11,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:11,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:11,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007100217] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:11,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:22:11,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 15 [2022-03-15 19:22:11,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1000119708] [2022-03-15 19:22:11,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:11,391 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:11,510 INFO L252 McrAutomatonBuilder]: Finished intersection with 275 states and 742 transitions. [2022-03-15 19:22:11,510 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:16,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [30806#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (< ~q1_back~0 0)), 30786#(or (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30796#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30792#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0)), 30797#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30787#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 30808#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0) (< ~q1_back~0 0)), 30810#(or (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0)) (< ~q1_back~0 0)), 30800#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30804#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30793#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 30785#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 30809#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0)) (< ~q1_back~0 0)), 30794#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 30807#(or (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0)), 30789#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~j~0 ~N~0)), 30788#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 30798#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30799#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30802#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30803#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30801#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30795#(or (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 30805#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~i~0 1) ~N~0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~j~0 ~N~0)), 30791#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 30790#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))] [2022-03-15 19:22:16,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:22:16,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:22:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1486, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:22:16,496 INFO L87 Difference]: Start difference. First operand 2444 states and 9766 transitions. Second operand has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 32 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:18,582 INFO L93 Difference]: Finished difference Result 4660 states and 17642 transitions. [2022-03-15 19:22:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:22:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 32 states have internal predecessors, (212), 0 states have call successors, (0), 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:22:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:18,652 INFO L225 Difference]: With dead ends: 4660 [2022-03-15 19:22:18,652 INFO L226 Difference]: Without dead ends: 4282 [2022-03-15 19:22:18,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 254 SyntacticMatches, 16 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=923, Invalid=3907, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:22:18,654 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 642 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:18,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 0 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:22:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2022-03-15 19:22:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 2622. [2022-03-15 19:22:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 2621 states have (on average 4.045784051888592) internal successors, (10604), 2621 states have internal predecessors, (10604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 10604 transitions. [2022-03-15 19:22:18,797 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 10604 transitions. Word has length 32 [2022-03-15 19:22:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:18,799 INFO L470 AbstractCegarLoop]: Abstraction has 2622 states and 10604 transitions. [2022-03-15 19:22:18,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 32 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 10604 transitions. [2022-03-15 19:22:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:18,805 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:18,805 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:22:18,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:19,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:22:19,022 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:22:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 122129199, now seen corresponding path program 2 times [2022-03-15 19:22:19,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:19,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171593] [2022-03-15 19:22:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:19,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:19,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:19,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171593] [2022-03-15 19:22:19,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:19,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:19,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 19:22:19,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594112609] [2022-03-15 19:22:19,286 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:19,293 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:19,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 431 states and 1271 transitions. [2022-03-15 19:22:19,428 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:31,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [40778#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 40782#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 40789#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~q1_back~0 0)), 40790#(and (or (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|) (< ~q1_back~0 0)) (or (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (< ~q1_back~0 0))), 40781#(not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 40788#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< (+ ~q1_front~0 1) ~q1_back~0)), 40802#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (<= ~N~0 ~i~0) (< ~q1_back~0 0)), 40805#(and (or (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (< ~j~0 ~N~0)) (or (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|) (< ~j~0 ~N~0))), 40804#(and (or (= ~j~0 0) (not (< ~i~0 ~N~0))) (or (= ~i~0 0) (not (< ~i~0 ~N~0))) (or (not (< ~q1_front~0 ~q1_back~0)) (<= (+ ~i~0 1) ~N~0))), 40784#(or (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 40787#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0)), 40799#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~j~0 ~N~0)), 40786#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~j~0 ~N~0)), 40803#(and (or (not (< ~i~0 ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (not (< ~q1_front~0 ~q1_back~0))) (or (not (< ~q1_front~0 ~q1_back~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (not (< ~i~0 ~N~0)))), 40792#(and (or (not (< ~q1_front~0 ~q1_back~0)) (< ~q1_back~0 0)) (or (not (< ~i~0 ~N~0)) (< ~q1_back~0 0))), 40785#(< ~j~0 ~N~0), 40794#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< (+ ~q1_front~0 1) ~q1_back~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 40779#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 40798#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (< ~j~0 ~N~0)), 40780#(or (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0)), 40801#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (<= ~N~0 ~i~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (< ~q1_back~0 0)), 40797#(or (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0)), 40793#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 40800#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0) (< ~q1_back~0 0)), 40796#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~j~0 ~N~0)), 40791#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (<= ~N~0 ~i~0) (< ~q1_back~0 0)), 40795#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< (+ ~i~0 1) ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (< ~q1_back~0 0)), 40783#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))] [2022-03-15 19:22:31,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:22:31,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:22:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:22:31,149 INFO L87 Difference]: Start difference. First operand 2622 states and 10604 transitions. Second operand has 35 states, 35 states have (on average 8.82857142857143) internal successors, (309), 34 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:37,113 INFO L93 Difference]: Finished difference Result 8894 states and 33971 transitions. [2022-03-15 19:22:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-15 19:22:37,114 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.82857142857143) internal successors, (309), 34 states have internal predecessors, (309), 0 states have call successors, (0), 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:22:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:37,159 INFO L225 Difference]: With dead ends: 8894 [2022-03-15 19:22:37,159 INFO L226 Difference]: Without dead ends: 8370 [2022-03-15 19:22:37,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5705 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3346, Invalid=14476, Unknown=0, NotChecked=0, Total=17822 [2022-03-15 19:22:37,164 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 932 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 5627 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 5871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 5627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:37,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [932 Valid, 6 Invalid, 5871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 5627 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 19:22:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8370 states. [2022-03-15 19:22:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8370 to 3246. [2022-03-15 19:22:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3245 states have (on average 4.227426810477658) internal successors, (13718), 3245 states have internal predecessors, (13718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 13718 transitions. [2022-03-15 19:22:37,339 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 13718 transitions. Word has length 32 [2022-03-15 19:22:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:37,340 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 13718 transitions. [2022-03-15 19:22:37,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.82857142857143) internal successors, (309), 34 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 13718 transitions. [2022-03-15 19:22:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:37,346 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:37,347 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:22:37,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:22:37,347 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:22:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1232632059, now seen corresponding path program 3 times [2022-03-15 19:22:37,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:37,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651584070] [2022-03-15 19:22:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:37,513 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:22:37,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:37,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651584070] [2022-03-15 19:22:37,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651584070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:37,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:37,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:22:37,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538986918] [2022-03-15 19:22:37,513 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:37,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:37,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 428 states and 1248 transitions. [2022-03-15 19:22:37,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:41,872 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [56407#(or (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0))), 56398#(not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 56401#(< ~j~0 ~N~0), 56410#(= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)), 56409#(or (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))), 56406#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0)), 56412#(and (or (not (< ~i~0 ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (not (< ~i~0 ~N~0)))), 56396#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56404#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 56405#(or (< (+ ~i~0 1) ~N~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 56408#(or (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 56402#(or (< ~j~0 ~N~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 56397#(< (+ ~i~0 1) ~N~0), 56413#(and (or (= ~j~0 0) (not (< ~i~0 ~N~0))) (or (= ~i~0 0) (not (< ~i~0 ~N~0)))), 56400#(or (< (+ ~i~0 1) ~N~0) (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), 56399#(or (not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))), 56403#(or (< (+ ~i~0 1) ~N~0) (< ~j~0 ~N~0)), 56411#(<= ~N~0 ~i~0)] [2022-03-15 19:22:41,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:22:41,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:22:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:22:41,873 INFO L87 Difference]: Start difference. First operand 3246 states and 13718 transitions. Second operand has 24 states, 24 states have (on average 8.0) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:43,132 INFO L93 Difference]: Finished difference Result 5014 states and 20572 transitions. [2022-03-15 19:22:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:22:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.0) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 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:22:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:43,147 INFO L225 Difference]: With dead ends: 5014 [2022-03-15 19:22:43,147 INFO L226 Difference]: Without dead ends: 4763 [2022-03-15 19:22:43,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 365 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:22:43,148 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 661 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:43,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 3 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:22:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2022-03-15 19:22:43,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 2729. [2022-03-15 19:22:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 4.2408357771261) internal successors, (11569), 2728 states have internal predecessors, (11569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 11569 transitions. [2022-03-15 19:22:43,216 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 11569 transitions. Word has length 32 [2022-03-15 19:22:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:43,217 INFO L470 AbstractCegarLoop]: Abstraction has 2729 states and 11569 transitions. [2022-03-15 19:22:43,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.0) internal successors, (192), 23 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 11569 transitions. [2022-03-15 19:22:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:43,222 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:43,222 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:22:43,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 19:22:43,222 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:22:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -240735878, now seen corresponding path program 1 times [2022-03-15 19:22:43,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:43,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3936923] [2022-03-15 19:22:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:43,352 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:22:43,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:43,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3936923] [2022-03-15 19:22:43,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3936923] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:43,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:43,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:22:43,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530814073] [2022-03-15 19:22:43,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:43,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:43,480 INFO L252 McrAutomatonBuilder]: Finished intersection with 395 states and 1132 transitions. [2022-03-15 19:22:43,480 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:45,292 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [66954#(and (or (= ~j~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (<= ~N~0 ~i~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (= ~i~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))))), 66952#(and (or (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (= ~j~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (<= ~N~0 ~i~0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)))) (or (= ~i~0 0) (not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))))), 66951#(< ~i~0 ~N~0), 66950#(not (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), 66953#(and (or (= ~j~0 0) (< ~i~0 ~N~0)) (or (= ~i~0 0) (< ~i~0 ~N~0)) (or (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)))] [2022-03-15 19:22:45,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:22:45,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:22:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:22:45,293 INFO L87 Difference]: Start difference. First operand 2729 states and 11569 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:45,520 INFO L93 Difference]: Finished difference Result 3113 states and 13088 transitions. [2022-03-15 19:22:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:22:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 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:22:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:45,528 INFO L225 Difference]: With dead ends: 3113 [2022-03-15 19:22:45,528 INFO L226 Difference]: Without dead ends: 2732 [2022-03-15 19:22:45,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:22:45,530 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:45,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:22:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-03-15 19:22:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2178. [2022-03-15 19:22:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 2177 states have (on average 4.267799724391364) internal successors, (9291), 2177 states have internal predecessors, (9291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 9291 transitions. [2022-03-15 19:22:45,577 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 9291 transitions. Word has length 32 [2022-03-15 19:22:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:45,577 INFO L470 AbstractCegarLoop]: Abstraction has 2178 states and 9291 transitions. [2022-03-15 19:22:45,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 9291 transitions. [2022-03-15 19:22:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:22:45,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:45,581 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:22:45,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:22:45,582 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:22:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1589729547, now seen corresponding path program 1 times [2022-03-15 19:22:45,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:45,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182230029] [2022-03-15 19:22:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:22:45,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:45,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182230029] [2022-03-15 19:22:45,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182230029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:45,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:45,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:22:45,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [759356090] [2022-03-15 19:22:45,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:45,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:45,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 250 states and 629 transitions. [2022-03-15 19:22:45,748 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:48,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [74438#(not (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 74439#(or (< (+ ~j~0 1) ~N~0) (< ~q2_front~0 ~q2_back~0))] [2022-03-15 19:22:48,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:22:48,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:22:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:22:48,219 INFO L87 Difference]: Start difference. First operand 2178 states and 9291 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:48,341 INFO L93 Difference]: Finished difference Result 3990 states and 17328 transitions. [2022-03-15 19:22:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:22:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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:22:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:48,352 INFO L225 Difference]: With dead ends: 3990 [2022-03-15 19:22:48,352 INFO L226 Difference]: Without dead ends: 3990 [2022-03-15 19:22:48,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:22:48,353 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 122 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:48,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 23 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2022-03-15 19:22:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 2148. [2022-03-15 19:22:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2147 states have (on average 4.273870517000466) internal successors, (9176), 2147 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 9176 transitions. [2022-03-15 19:22:48,427 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 9176 transitions. Word has length 35 [2022-03-15 19:22:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:48,427 INFO L470 AbstractCegarLoop]: Abstraction has 2148 states and 9176 transitions. [2022-03-15 19:22:48,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 9176 transitions. [2022-03-15 19:22:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:22:48,431 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:48,431 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:22:48,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 19:22:48,431 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:22:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 47864130, now seen corresponding path program 1 times [2022-03-15 19:22:48,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:48,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592976111] [2022-03-15 19:22:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:22:48,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:48,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592976111] [2022-03-15 19:22:48,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592976111] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:48,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017436757] [2022-03-15 19:22:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:48,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:48,483 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:22:48,526 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:22:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:48,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:22:48,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:22:48,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:22:48,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017436757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:48,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:22:48,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-03-15 19:22:48,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154288710] [2022-03-15 19:22:48,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:48,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:48,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 351 states and 943 transitions. [2022-03-15 19:22:48,758 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:51,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [82843#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 82844#(or (<= ~q1_front~0 ~q1_back~0) (< ~q1_back~0 0))] [2022-03-15 19:22:51,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:22:51,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:22:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:22:51,422 INFO L87 Difference]: Start difference. First operand 2148 states and 9176 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:51,579 INFO L93 Difference]: Finished difference Result 4452 states and 19196 transitions. [2022-03-15 19:22:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:22:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:22:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:51,590 INFO L225 Difference]: With dead ends: 4452 [2022-03-15 19:22:51,591 INFO L226 Difference]: Without dead ends: 4452 [2022-03-15 19:22:51,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 325 SyntacticMatches, 22 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:22:51,591 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 100 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:51,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 30 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:22:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-03-15 19:22:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 2594. [2022-03-15 19:22:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 4.30158118010027) internal successors, (11154), 2593 states have internal predecessors, (11154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 11154 transitions. [2022-03-15 19:22:51,646 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 11154 transitions. Word has length 35 [2022-03-15 19:22:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:51,647 INFO L470 AbstractCegarLoop]: Abstraction has 2594 states and 11154 transitions. [2022-03-15 19:22:51,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 11154 transitions. [2022-03-15 19:22:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:22:51,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:51,652 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:22:51,668 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:22:51,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:22:51,869 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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:22:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 835252618, now seen corresponding path program 2 times [2022-03-15 19:22:51,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:51,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774646643] [2022-03-15 19:22:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:22:52,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:52,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774646643] [2022-03-15 19:22:52,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774646643] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:52,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:52,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:22:52,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852072829] [2022-03-15 19:22:52,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:52,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:52,090 INFO L252 McrAutomatonBuilder]: Finished intersection with 288 states and 761 transitions. [2022-03-15 19:22:52,090 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:53,757 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [92499#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 92501#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~q1_back~0 0)), 92502#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~q1_back~0 0)), 92500#(< ~q1_back~0 0)] [2022-03-15 19:22:53,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:22:53,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:22:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:22:53,759 INFO L87 Difference]: Start difference. First operand 2594 states and 11154 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:54,087 INFO L93 Difference]: Finished difference Result 4212 states and 18114 transitions. [2022-03-15 19:22:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:22:54,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 19:22:54,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:54,119 INFO L225 Difference]: With dead ends: 4212 [2022-03-15 19:22:54,119 INFO L226 Difference]: Without dead ends: 4212 [2022-03-15 19:22:54,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:22:54,135 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 90 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:54,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 6 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:22:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4212 states. [2022-03-15 19:22:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 2746. [2022-03-15 19:22:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 4.258652094717669) internal successors, (11690), 2745 states have internal predecessors, (11690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 11690 transitions. [2022-03-15 19:22:54,197 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 11690 transitions. Word has length 35 [2022-03-15 19:22:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:54,197 INFO L470 AbstractCegarLoop]: Abstraction has 2746 states and 11690 transitions. [2022-03-15 19:22:54,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 11690 transitions. [2022-03-15 19:22:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:22:54,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:54,203 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:22:54,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 19:22:54,203 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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:22:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 595479690, now seen corresponding path program 3 times [2022-03-15 19:22:54,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:54,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896038177] [2022-03-15 19:22:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:22:54,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:54,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896038177] [2022-03-15 19:22:54,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896038177] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:22:54,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:22:54,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:22:54,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176673469] [2022-03-15 19:22:54,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:54,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:54,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 310 states and 816 transitions. [2022-03-15 19:22:54,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:56,856 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [102228#(and (or (< ~q1_back~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (or (<= ~N~0 ~j~0) (< ~q1_back~0 0))), 102223#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~N~0 ~j~0)), 102229#(or (not (< ~j~0 ~N~0)) (< ~q1_back~0 0)), 102219#(= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0), 102222#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 102221#(not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 102225#(< ~q1_back~0 0), 102226#(or (not (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (< ~q1_back~0 0)), 102220#(not (< ~j~0 ~N~0)), 102227#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~q1_back~0 0)), 102224#(and (or (not (< ~j~0 ~N~0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 102230#(or (not (< ~j~0 ~N~0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))] [2022-03-15 19:22:56,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:22:56,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:22:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:22:56,857 INFO L87 Difference]: Start difference. First operand 2746 states and 11690 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:58,413 INFO L93 Difference]: Finished difference Result 5122 states and 21411 transitions. [2022-03-15 19:22:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:22:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 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:22:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:58,427 INFO L225 Difference]: With dead ends: 5122 [2022-03-15 19:22:58,428 INFO L226 Difference]: Without dead ends: 5042 [2022-03-15 19:22:58,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 252 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:22:58,429 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 459 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:58,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 0 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:22:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2022-03-15 19:22:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 2470. [2022-03-15 19:22:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 4.275415147833131) internal successors, (10556), 2469 states have internal predecessors, (10556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 10556 transitions. [2022-03-15 19:22:58,496 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 10556 transitions. Word has length 35 [2022-03-15 19:22:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:58,496 INFO L470 AbstractCegarLoop]: Abstraction has 2470 states and 10556 transitions. [2022-03-15 19:22:58,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:22:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 10556 transitions. [2022-03-15 19:22:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:22:58,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:58,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:58,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 19:22:58,501 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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:22:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 363833314, now seen corresponding path program 1 times [2022-03-15 19:22:58,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:58,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800418306] [2022-03-15 19:22:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:59,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:59,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800418306] [2022-03-15 19:22:59,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800418306] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:59,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223468129] [2022-03-15 19:22:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:59,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:59,234 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:22:59,235 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:22:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:59,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 92 conjunts are in the unsatisfiable core [2022-03-15 19:22:59,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:59,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:22:59,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:22:59,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:22:59,420 INFO L353 Elim1Store]: treesize reduction 90, result has 29.7 percent of original size [2022-03-15 19:22:59,420 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 43 [2022-03-15 19:22:59,533 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:22:59,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:22:59,588 INFO L353 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2022-03-15 19:22:59,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2022-03-15 19:22:59,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:22:59,727 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:22:59,784 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:23:00,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:23:00,040 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 28 treesize of output 33 [2022-03-15 19:23:00,258 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:23:00,258 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:23:00,265 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:23:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:23:00,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:23:00,393 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 0)) (forall ((v_ArrVal_560 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)))) is different from false [2022-03-15 19:23:00,412 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int))) (< 0 (+ c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (forall ((v_ArrVal_560 (Array Int Int))) (<= (+ c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) 0))) is different from false [2022-03-15 19:23:00,451 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0 1)))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_560 (Array Int Int))) (<= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_559))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_560) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0)) 0))) is different from false [2022-03-15 19:23:01,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:01,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 147 [2022-03-15 19:23:01,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:01,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139520 treesize of output 136936 [2022-03-15 19:23:01,641 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:01,642 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 136936 treesize of output 126460 [2022-03-15 19:23:01,993 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:01,994 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 126460 treesize of output 121264 [2022-03-15 19:23:02,334 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:02,335 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 121264 treesize of output 118036 [2022-03-15 19:23:03,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:03,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116717 treesize of output 112636 [2022-03-15 19:23:03,330 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:23:03,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112621 treesize of output 96252 [2022-03-15 19:23:03,674 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 96237 treesize of output 94189 [2022-03-15 19:23:04,010 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 94189 treesize of output 85997 [2022-03-15 19:23:04,331 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:23:04,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:23:04,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:23:04,542 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 19:23:04,546 INFO L158 Benchmark]: Toolchain (without parser) took 76129.17ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 150.4MB in the beginning and 792.7MB in the end (delta: -642.3MB). Peak memory consumption was 848.4MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,546 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:23:04,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.53ms. Allocated memory is still 203.4MB. Free memory was 150.3MB in the beginning and 176.0MB in the end (delta: -25.7MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 203.4MB. Free memory was 175.9MB in the beginning and 173.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,547 INFO L158 Benchmark]: Boogie Preprocessor took 39.20ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 171.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,547 INFO L158 Benchmark]: RCFGBuilder took 611.91ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 133.9MB in the end (delta: 37.3MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,547 INFO L158 Benchmark]: TraceAbstraction took 75158.09ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 133.5MB in the beginning and 792.7MB in the end (delta: -659.3MB). Peak memory consumption was 830.9MB. Max. memory is 8.0GB. [2022-03-15 19:23:04,548 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.10ms. Allocated memory is still 203.4MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.53ms. Allocated memory is still 203.4MB. Free memory was 150.3MB in the beginning and 176.0MB in the end (delta: -25.7MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 203.4MB. Free memory was 175.9MB in the beginning and 173.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.20ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 171.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 611.91ms. Allocated memory is still 203.4MB. Free memory was 171.2MB in the beginning and 133.9MB in the end (delta: 37.3MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 75158.09ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 932.2MB). Free memory was 133.5MB in the beginning and 792.7MB in the end (delta: -659.3MB). Peak memory consumption was 830.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 226 PlacesBefore, 49 PlacesAfterwards, 231 TransitionsBefore, 42 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 8 FixpointIterations, 151 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 24 TrivialYvCompositions, 8 ConcurrentYvCompositions, 12 ChoiceCompositions, 222 TotalNumberOfCompositions, 4038 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2763, positive: 2651, positive conditional: 0, positive unconditional: 2651, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1035, positive: 1015, positive conditional: 0, positive unconditional: 1015, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2763, positive: 1636, positive conditional: 0, positive unconditional: 1636, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 1035, unknown conditional: 0, unknown unconditional: 1035] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:23:04,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...