/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 15:57:12,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 15:57:12,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 15:57:12,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 15:57:12,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 15:57:12,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 15:57:12,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 15:57:12,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 15:57:12,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 15:57:12,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 15:57:12,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 15:57:12,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 15:57:12,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 15:57:12,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 15:57:12,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 15:57:12,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 15:57:12,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 15:57:12,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 15:57:12,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 15:57:12,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 15:57:12,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 15:57:12,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 15:57:12,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 15:57:12,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 15:57:12,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 15:57:12,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 15:57:12,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 15:57:12,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 15:57:12,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 15:57:12,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 15:57:12,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 15:57:12,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 15:57:12,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 15:57:12,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 15:57:12,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 15:57:12,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 15:57:12,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 15:57:12,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 15:57:12,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 15:57:12,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 15:57:12,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 15:57:12,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 15:57:12,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 15:57:12,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 15:57:12,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 15:57:12,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 15:57:12,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 15:57:12,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 15:57:12,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 15:57:12,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 15:57:12,687 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 15:57:12,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 15:57:12,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 15:57:12,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 15:57:12,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:57:12,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 15:57:12,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 15:57:12,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 15:57:12,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 15:57:12,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 15:57:12,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 15:57:12,911 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 15:57:12,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-03-01 15:57:12,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150155b4b/044c1f2ae6c04e4692134c4b874661b6/FLAG22938a7a6 [2022-03-01 15:57:13,344 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 15:57:13,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-03-01 15:57:13,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150155b4b/044c1f2ae6c04e4692134c4b874661b6/FLAG22938a7a6 [2022-03-01 15:57:13,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150155b4b/044c1f2ae6c04e4692134c4b874661b6 [2022-03-01 15:57:13,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 15:57:13,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 15:57:13,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 15:57:13,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 15:57:13,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 15:57:13,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572c27f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13, skipping insertion in model container [2022-03-01 15:57:13,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 15:57:13,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 15:57:13,544 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-max-array.wvr.c[2553,2566] [2022-03-01 15:57:13,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:57:13,558 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 15:57:13,598 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-max-array.wvr.c[2553,2566] [2022-03-01 15:57:13,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:57:13,615 INFO L208 MainTranslator]: Completed translation [2022-03-01 15:57:13,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13 WrapperNode [2022-03-01 15:57:13,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 15:57:13,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 15:57:13,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 15:57:13,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 15:57:13,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,652 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-03-01 15:57:13,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 15:57:13,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 15:57:13,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 15:57:13,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 15:57:13,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 15:57:13,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 15:57:13,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 15:57:13,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 15:57:13,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (1/1) ... [2022-03-01 15:57:13,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:57:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:13,705 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-01 15:57:13,715 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-01 15:57:13,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 15:57:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 15:57:13,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 15:57:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 15:57:13,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 15:57:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 15:57:13,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 15:57:13,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 15:57:13,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 15:57:13,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 15:57:13,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 15:57:13,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 15:57:13,741 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 15:57:13,823 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 15:57:13,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 15:57:14,044 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 15:57:14,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 15:57:14,107 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 15:57:14,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:57:14 BoogieIcfgContainer [2022-03-01 15:57:14,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 15:57:14,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 15:57:14,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 15:57:14,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 15:57:14,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 03:57:13" (1/3) ... [2022-03-01 15:57:14,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f51eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:57:14, skipping insertion in model container [2022-03-01 15:57:14,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:13" (2/3) ... [2022-03-01 15:57:14,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f51eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:57:14, skipping insertion in model container [2022-03-01 15:57:14,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:57:14" (3/3) ... [2022-03-01 15:57:14,120 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-03-01 15:57:14,124 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 15:57:14,124 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 15:57:14,124 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 15:57:14,125 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 15:57:14,161 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,161 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,161 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,162 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,162 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,162 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,162 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,164 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,165 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,165 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,167 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,167 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,167 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,167 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,168 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,168 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,168 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,169 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,170 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,170 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,171 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,171 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,171 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,172 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,172 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,172 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,173 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,173 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,173 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,173 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,174 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,174 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,174 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,175 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,176 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,176 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,177 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,177 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,177 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,178 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,179 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,181 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,182 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,182 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,183 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,184 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,184 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,184 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,184 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,185 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:14,190 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-01 15:57:14,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 15:57:14,244 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 15:57:14,244 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-01 15:57:14,261 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 153 transitions, 330 flow [2022-03-01 15:57:14,460 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:57:14,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:14,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:14,517 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1167185864, now seen corresponding path program 1 times [2022-03-01 15:57:14,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:14,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137088344] [2022-03-01 15:57:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:14,787 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-01 15:57:14,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:14,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137088344] [2022-03-01 15:57:14,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137088344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:14,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:57:14,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 15:57:14,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440541032] [2022-03-01 15:57:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:14,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 15:57:14,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 15:57:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:57:14,836 INFO L87 Difference]: Start difference. First operand has 3808 states, 3807 states have (on average 3.8127134226425006) internal successors, (14515), 3807 states have internal predecessors, (14515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:14,943 INFO L93 Difference]: Finished difference Result 3808 states and 13367 transitions. [2022-03-01 15:57:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 15:57:14,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:57:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:15,001 INFO L225 Difference]: With dead ends: 3808 [2022-03-01 15:57:15,001 INFO L226 Difference]: Without dead ends: 3804 [2022-03-01 15:57:15,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:57:15,007 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:15,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:57:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2022-03-01 15:57:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3804. [2022-03-01 15:57:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 3803 states have (on average 3.5138048908756243) internal successors, (13363), 3803 states have internal predecessors, (13363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 13363 transitions. [2022-03-01 15:57:15,318 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 13363 transitions. Word has length 105 [2022-03-01 15:57:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:15,319 INFO L470 AbstractCegarLoop]: Abstraction has 3804 states and 13363 transitions. [2022-03-01 15:57:15,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 13363 transitions. [2022-03-01 15:57:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-01 15:57:15,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:15,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:15,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 15:57:15,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 80050112, now seen corresponding path program 1 times [2022-03-01 15:57:15,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:15,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411774301] [2022-03-01 15:57:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:15,646 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-01 15:57:15,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:15,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411774301] [2022-03-01 15:57:15,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411774301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:15,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:57:15,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 15:57:15,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965295120] [2022-03-01 15:57:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:15,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 15:57:15,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 15:57:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-03-01 15:57:15,653 INFO L87 Difference]: Start difference. First operand 3804 states and 13363 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:15,879 INFO L93 Difference]: Finished difference Result 3820 states and 13379 transitions. [2022-03-01 15:57:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:57:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-01 15:57:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:15,963 INFO L225 Difference]: With dead ends: 3820 [2022-03-01 15:57:15,967 INFO L226 Difference]: Without dead ends: 3810 [2022-03-01 15:57:15,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-03-01 15:57:15,968 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 227 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:15,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 320 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:57:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-03-01 15:57:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3805. [2022-03-01 15:57:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3805 states, 3804 states have (on average 3.5131440588853837) internal successors, (13364), 3804 states have internal predecessors, (13364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 13364 transitions. [2022-03-01 15:57:16,090 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 13364 transitions. Word has length 105 [2022-03-01 15:57:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:16,093 INFO L470 AbstractCegarLoop]: Abstraction has 3805 states and 13364 transitions. [2022-03-01 15:57:16,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 13364 transitions. [2022-03-01 15:57:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-03-01 15:57:16,109 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:16,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:16,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 15:57:16,110 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:16,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash 956153110, now seen corresponding path program 1 times [2022-03-01 15:57:16,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:16,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003468345] [2022-03-01 15:57:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:16,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:16,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003468345] [2022-03-01 15:57:16,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003468345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:16,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547234217] [2022-03-01 15:57:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:16,336 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-01 15:57:16,337 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-01 15:57:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:16,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:57:16,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:16,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:17,057 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-01 15:57:17,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547234217] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:17,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:57:17,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:57:17,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895744713] [2022-03-01 15:57:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:17,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:57:17,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:57:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:57:17,065 INFO L87 Difference]: Start difference. First operand 3805 states and 13364 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:17,176 INFO L93 Difference]: Finished difference Result 4189 states and 14753 transitions. [2022-03-01 15:57:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:57:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-03-01 15:57:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:17,205 INFO L225 Difference]: With dead ends: 4189 [2022-03-01 15:57:17,205 INFO L226 Difference]: Without dead ends: 4189 [2022-03-01 15:57:17,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-01 15:57:17,206 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 236 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:17,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 342 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:57:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2022-03-01 15:57:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4189. [2022-03-01 15:57:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 3.522683858643744) internal successors, (14753), 4188 states have internal predecessors, (14753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 14753 transitions. [2022-03-01 15:57:17,378 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 14753 transitions. Word has length 112 [2022-03-01 15:57:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:17,378 INFO L470 AbstractCegarLoop]: Abstraction has 4189 states and 14753 transitions. [2022-03-01 15:57:17,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 14753 transitions. [2022-03-01 15:57:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-03-01 15:57:17,391 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:17,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:17,417 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-01 15:57:17,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:17,611 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1389244231, now seen corresponding path program 1 times [2022-03-01 15:57:17,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:17,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160308537] [2022-03-01 15:57:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:17,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:17,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:17,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160308537] [2022-03-01 15:57:17,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160308537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:17,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413106281] [2022-03-01 15:57:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:17,735 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-01 15:57:17,745 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-01 15:57:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:17,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:57:17,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:18,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:18,394 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-01 15:57:18,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413106281] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:18,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:57:18,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-01 15:57:18,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580588131] [2022-03-01 15:57:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:18,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:57:18,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:57:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-01 15:57:18,401 INFO L87 Difference]: Start difference. First operand 4189 states and 14753 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:18,663 INFO L93 Difference]: Finished difference Result 7486 states and 26533 transitions. [2022-03-01 15:57:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 15:57:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-03-01 15:57:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:18,702 INFO L225 Difference]: With dead ends: 7486 [2022-03-01 15:57:18,702 INFO L226 Difference]: Without dead ends: 7486 [2022-03-01 15:57:18,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-03-01 15:57:18,703 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 498 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:18,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 667 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:57:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states. [2022-03-01 15:57:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 4736. [2022-03-01 15:57:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 4735 states have (on average 3.4963041182682155) internal successors, (16555), 4735 states have internal predecessors, (16555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 16555 transitions. [2022-03-01 15:57:18,869 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 16555 transitions. Word has length 117 [2022-03-01 15:57:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:18,870 INFO L470 AbstractCegarLoop]: Abstraction has 4736 states and 16555 transitions. [2022-03-01 15:57:18,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 16555 transitions. [2022-03-01 15:57:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-03-01 15:57:18,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:18,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:18,910 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-01 15:57:19,108 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,SelfDestructingSolverStorable3 [2022-03-01 15:57:19,108 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1124966041, now seen corresponding path program 2 times [2022-03-01 15:57:19,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:19,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046248786] [2022-03-01 15:57:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:19,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:19,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046248786] [2022-03-01 15:57:19,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046248786] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:19,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075935589] [2022-03-01 15:57:19,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:57:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:19,255 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-01 15:57:19,256 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-01 15:57:19,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 15:57:19,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:57:19,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-01 15:57:19,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:57:19,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 15:57:19,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075935589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:19,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 15:57:19,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-03-01 15:57:19,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191349118] [2022-03-01 15:57:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:19,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:57:19,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:57:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:57:19,758 INFO L87 Difference]: Start difference. First operand 4736 states and 16555 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:19,944 INFO L93 Difference]: Finished difference Result 5126 states and 17992 transitions. [2022-03-01 15:57:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:57:19,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-03-01 15:57:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:19,967 INFO L225 Difference]: With dead ends: 5126 [2022-03-01 15:57:19,967 INFO L226 Difference]: Without dead ends: 5126 [2022-03-01 15:57:19,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-03-01 15:57:19,968 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 179 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:19,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 395 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:57:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2022-03-01 15:57:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4579. [2022-03-01 15:57:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4579 states, 4578 states have (on average 3.5364788117081694) internal successors, (16190), 4578 states have internal predecessors, (16190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 16190 transitions. [2022-03-01 15:57:20,094 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 16190 transitions. Word has length 117 [2022-03-01 15:57:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:20,094 INFO L470 AbstractCegarLoop]: Abstraction has 4579 states and 16190 transitions. [2022-03-01 15:57:20,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 16190 transitions. [2022-03-01 15:57:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 15:57:20,107 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:20,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:20,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 15:57:20,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:20,330 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 209670700, now seen corresponding path program 1 times [2022-03-01 15:57:20,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:20,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869885808] [2022-03-01 15:57:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:21,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:21,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869885808] [2022-03-01 15:57:21,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869885808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:21,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333879445] [2022-03-01 15:57:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:21,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:21,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 15:57:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:21,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-01 15:57:21,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:21,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:57:21,698 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:57:21,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 15:57:22,143 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:57:22,144 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 15 treesize of output 15 [2022-03-01 15:57:23,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:57:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:57:23,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:57:24,286 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:24,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-03-01 15:57:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:24,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:25,259 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (and (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0))))) (or (forall ((v_ArrVal_160 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (= c_~max1~0 c_~max2~0)))) is different from false [2022-03-01 15:57:25,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_160 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_160 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_160) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (< 0 ~M~0))) is different from false [2022-03-01 15:57:26,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:26,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 419 treesize of output 371 [2022-03-01 15:57:26,153 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 332 treesize of output 284 [2022-03-01 15:57:26,160 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 284 treesize of output 260 [2022-03-01 15:57:26,167 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 260 treesize of output 248 [2022-03-01 15:57:26,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 242 [2022-03-01 15:57:29,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:57:29,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-01 15:57:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:29,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333879445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:57:29,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:57:29,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 30] total 75 [2022-03-01 15:57:29,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327786809] [2022-03-01 15:57:29,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:57:29,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-01 15:57:29,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-01 15:57:29,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=4785, Unknown=10, NotChecked=286, Total=5550 [2022-03-01 15:57:29,111 INFO L87 Difference]: Start difference. First operand 4579 states and 16190 transitions. Second operand has 75 states, 75 states have (on average 4.1466666666666665) internal successors, (311), 75 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:38,843 INFO L93 Difference]: Finished difference Result 16174 states and 56518 transitions. [2022-03-01 15:57:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-01 15:57:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.1466666666666665) internal successors, (311), 75 states have internal predecessors, (311), 0 states have call successors, (0), 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 122 [2022-03-01 15:57:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:38,912 INFO L225 Difference]: With dead ends: 16174 [2022-03-01 15:57:38,912 INFO L226 Difference]: Without dead ends: 15874 [2022-03-01 15:57:38,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 205 SyntacticMatches, 13 SemanticMatches, 149 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8285 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2185, Invalid=19865, Unknown=10, NotChecked=590, Total=22650 [2022-03-01 15:57:38,918 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 2964 mSDsluCounter, 9882 mSDsCounter, 0 mSdLazyCounter, 5427 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 9048 SdHoareTripleChecker+Invalid, 8009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 5427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2494 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:38,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2964 Valid, 9048 Invalid, 8009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 5427 Invalid, 0 Unknown, 2494 Unchecked, 3.0s Time] [2022-03-01 15:57:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2022-03-01 15:57:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 6697. [2022-03-01 15:57:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6697 states, 6696 states have (on average 3.5235961768219832) internal successors, (23594), 6696 states have internal predecessors, (23594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6697 states to 6697 states and 23594 transitions. [2022-03-01 15:57:39,213 INFO L78 Accepts]: Start accepts. Automaton has 6697 states and 23594 transitions. Word has length 122 [2022-03-01 15:57:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:39,213 INFO L470 AbstractCegarLoop]: Abstraction has 6697 states and 23594 transitions. [2022-03-01 15:57:39,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.1466666666666665) internal successors, (311), 75 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6697 states and 23594 transitions. [2022-03-01 15:57:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 15:57:39,243 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:39,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:39,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 15:57:39,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:39,472 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1041481172, now seen corresponding path program 2 times [2022-03-01 15:57:39,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:39,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691960871] [2022-03-01 15:57:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:40,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:40,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691960871] [2022-03-01 15:57:40,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691960871] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:40,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126904555] [2022-03-01 15:57:40,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:57:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:40,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:40,276 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:40,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 15:57:40,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:57:40,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:57:40,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-01 15:57:40,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:41,087 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:41,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:41,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-03-01 15:57:41,653 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-01 15:57:41,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:41,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:41,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2022-03-01 15:57:42,384 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-01 15:57:42,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126904555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:57:42,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:57:42,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 44 [2022-03-01 15:57:42,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451338005] [2022-03-01 15:57:42,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:57:42,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-01 15:57:42,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-01 15:57:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2022-03-01 15:57:42,387 INFO L87 Difference]: Start difference. First operand 6697 states and 23594 transitions. Second operand has 44 states, 44 states have (on average 6.840909090909091) internal successors, (301), 44 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:45,925 INFO L93 Difference]: Finished difference Result 13369 states and 46533 transitions. [2022-03-01 15:57:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-01 15:57:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.840909090909091) internal successors, (301), 44 states have internal predecessors, (301), 0 states have call successors, (0), 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 122 [2022-03-01 15:57:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:45,975 INFO L225 Difference]: With dead ends: 13369 [2022-03-01 15:57:45,975 INFO L226 Difference]: Without dead ends: 13219 [2022-03-01 15:57:45,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1061, Invalid=7681, Unknown=0, NotChecked=0, Total=8742 [2022-03-01 15:57:45,978 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1099 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:45,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1099 Valid, 4495 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2413 Invalid, 0 Unknown, 320 Unchecked, 1.1s Time] [2022-03-01 15:57:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13219 states. [2022-03-01 15:57:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13219 to 7049. [2022-03-01 15:57:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7049 states, 7048 states have (on average 3.5190124858115777) internal successors, (24802), 7048 states have internal predecessors, (24802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 24802 transitions. [2022-03-01 15:57:46,212 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 24802 transitions. Word has length 122 [2022-03-01 15:57:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:46,213 INFO L470 AbstractCegarLoop]: Abstraction has 7049 states and 24802 transitions. [2022-03-01 15:57:46,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.840909090909091) internal successors, (301), 44 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 24802 transitions. [2022-03-01 15:57:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 15:57:46,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:46,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:46,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 15:57:46,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:46,447 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -77831274, now seen corresponding path program 3 times [2022-03-01 15:57:46,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:46,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976438318] [2022-03-01 15:57:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:47,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:47,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976438318] [2022-03-01 15:57:47,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976438318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:47,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045594938] [2022-03-01 15:57:47,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:57:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:47,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:47,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 15:57:47,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-01 15:57:47,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:57:47,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-01 15:57:47,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:48,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-03-01 15:57:48,527 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-01 15:57:48,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:48,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:48,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2022-03-01 15:57:49,170 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-01 15:57:49,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045594938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:57:49,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:57:49,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 14] total 48 [2022-03-01 15:57:49,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927147132] [2022-03-01 15:57:49,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:57:49,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-01 15:57:49,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-01 15:57:49,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2022-03-01 15:57:49,176 INFO L87 Difference]: Start difference. First operand 7049 states and 24802 transitions. Second operand has 48 states, 48 states have (on average 6.291666666666667) internal successors, (302), 48 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:53,703 INFO L93 Difference]: Finished difference Result 11094 states and 39096 transitions. [2022-03-01 15:57:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-01 15:57:53,703 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 6.291666666666667) internal successors, (302), 48 states have internal predecessors, (302), 0 states have call successors, (0), 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 122 [2022-03-01 15:57:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:53,738 INFO L225 Difference]: With dead ends: 11094 [2022-03-01 15:57:53,739 INFO L226 Difference]: Without dead ends: 10944 [2022-03-01 15:57:53,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3290 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1866, Invalid=10344, Unknown=0, NotChecked=0, Total=12210 [2022-03-01 15:57:53,742 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 1140 mSDsluCounter, 4978 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 4894 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:53,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 4894 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 15:57:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2022-03-01 15:57:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 7369. [2022-03-01 15:57:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7369 states, 7368 states have (on average 3.5290445168295332) internal successors, (26002), 7368 states have internal predecessors, (26002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7369 states to 7369 states and 26002 transitions. [2022-03-01 15:57:53,936 INFO L78 Accepts]: Start accepts. Automaton has 7369 states and 26002 transitions. Word has length 122 [2022-03-01 15:57:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:53,936 INFO L470 AbstractCegarLoop]: Abstraction has 7369 states and 26002 transitions. [2022-03-01 15:57:53,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 6.291666666666667) internal successors, (302), 48 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7369 states and 26002 transitions. [2022-03-01 15:57:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-01 15:57:53,954 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:53,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:57:53,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-01 15:57:54,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:54,174 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash -973684876, now seen corresponding path program 4 times [2022-03-01 15:57:54,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:54,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913191543] [2022-03-01 15:57:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:54,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:54,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913191543] [2022-03-01 15:57:54,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913191543] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:54,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436267360] [2022-03-01 15:57:54,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 15:57:54,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:54,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:54,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:54,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 15:57:55,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 15:57:55,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:57:55,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-01 15:57:55,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:55,718 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-01 15:57:56,210 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-01 15:57:56,390 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-01 15:57:56,510 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-01 15:57:56,807 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:57,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:57,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-03-01 15:57:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:57,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:58,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (or (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (not .cse0) (= c_~max2~0 .cse1)) (or (= c_~max1~0 c_~max2~0) .cse0)))) (< c_~max2~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))))) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (let ((.cse3 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse5 (< c_~max1~0 .cse4))) (and (or (= .cse3 .cse4) (not .cse5)) (or (= c_~max1~0 .cse3) .cse5))))))))))) is different from false [2022-03-01 15:58:01,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= .cse2 .cse0)) (or .cse1 (= c_~max1~0 .cse0))))))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (or (< c_~max2~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (let ((.cse6 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse5 (< c_~max1~0 .cse6))) (and (or .cse5 (= c_~max1~0 c_~max2~0)) (or (not .cse5) (= .cse6 c_~max2~0))))))))))) is different from false [2022-03-01 15:58:02,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (or (let ((.cse1 (select .cse2 c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (= c_~max1~0 c_~max2~0) .cse0) (or (not .cse0) (= .cse1 c_~max2~0))))) (< c_~max2~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (let ((.cse3 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (let ((.cse5 (select .cse6 c_~A~0.offset))) (let ((.cse4 (< c_~max1~0 .cse5))) (and (or (= c_~max1~0 .cse3) .cse4) (or (= .cse5 .cse3) (not .cse4)))))))))))) is different from false [2022-03-01 15:58:03,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (let ((.cse1 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (let ((.cse2 (select .cse3 c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse2))) (and (or .cse0 (= c_~max1~0 .cse1)) (or (not .cse0) (= .cse2 .cse1))))) (not (< c_~max2~0 .cse1)))))) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) c_~A~0.base))) (or (let ((.cse5 (select .cse6 c_~A~0.offset))) (let ((.cse4 (< c_~max1~0 .cse5))) (and (or .cse4 (= c_~max1~0 c_~max2~0)) (or (not .cse4) (= .cse5 c_~max2~0))))) (< c_~max2~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-01 15:58:06,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< c_~max2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or .cse1 (= c_~max1~0 c_~max2~0)) (or (= .cse2 c_~max2~0) (not .cse1)))))))) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse5 (< c_~max1~0 .cse4))) (and (or (= .cse4 .cse3) (not .cse5)) (or .cse5 (= c_~max1~0 .cse3)))))))))))) is different from false [2022-03-01 15:58:07,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse0))) (and (or (= .cse0 c_~max2~0) (not .cse1)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (< c_~max2~0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse3 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse4 (< c_~max1~0 .cse5))) (and (or (= c_~max1~0 .cse3) .cse4) (or (= .cse5 .cse3) (not .cse4))))) (not (< c_~max2~0 .cse3))))))))) is different from false [2022-03-01 15:58:07,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse3 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (= c_~max1~0 .cse0) .cse1) (or (not .cse1) (= .cse0 .cse2))))) (not (< c_~max2~0 .cse0)))))) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max2~0 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse5 (< c_~max1~0 .cse6))) (and (or (not .cse5) (= c_~max2~0 .cse6)) (or (= c_~max1~0 c_~max2~0) .cse5)))))))))) is different from false [2022-03-01 15:58:09,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,285 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 308 treesize of output 201 [2022-03-01 15:58:09,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,313 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 6905 treesize of output 6609 [2022-03-01 15:58:09,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,381 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 6564 treesize of output 6481 [2022-03-01 15:58:09,447 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,448 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 6468 treesize of output 6457 [2022-03-01 15:58:09,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,509 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 6444 treesize of output 6409 [2022-03-01 15:58:09,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,572 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 6396 treesize of output 6025 [2022-03-01 15:58:09,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,637 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 6012 treesize of output 5833 [2022-03-01 15:58:09,701 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:09,702 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 5820 treesize of output 5065 [2022-03-01 15:58:09,753 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-01 15:58:09,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 15:58:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:58:09,968 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-01 15:58:09,971 INFO L158 Benchmark]: Toolchain (without parser) took 56595.69ms. Allocated memory was 199.2MB in the beginning and 811.6MB in the end (delta: 612.4MB). Free memory was 143.3MB in the beginning and 431.4MB in the end (delta: -288.1MB). Peak memory consumption was 546.7MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,971 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 15:58:09,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.73ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 143.1MB in the beginning and 217.4MB in the end (delta: -74.3MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.32ms. Allocated memory is still 247.5MB. Free memory was 217.4MB in the beginning and 215.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,972 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 247.5MB. Free memory was 215.4MB in the beginning and 214.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,972 INFO L158 Benchmark]: RCFGBuilder took 428.83ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 194.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,972 INFO L158 Benchmark]: TraceAbstraction took 55860.59ms. Allocated memory was 247.5MB in the beginning and 811.6MB in the end (delta: 564.1MB). Free memory was 194.4MB in the beginning and 431.4MB in the end (delta: -237.0MB). Peak memory consumption was 550.1MB. Max. memory is 8.0GB. [2022-03-01 15:58:09,974 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.73ms. Allocated memory was 199.2MB in the beginning and 247.5MB in the end (delta: 48.2MB). Free memory was 143.1MB in the beginning and 217.4MB in the end (delta: -74.3MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.32ms. Allocated memory is still 247.5MB. Free memory was 217.4MB in the beginning and 215.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 247.5MB. Free memory was 215.4MB in the beginning and 214.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 428.83ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 194.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 55860.59ms. Allocated memory was 247.5MB in the beginning and 811.6MB in the end (delta: 564.1MB). Free memory was 194.4MB in the beginning and 431.4MB in the end (delta: -237.0MB). Peak memory consumption was 550.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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-01 15:58:10,004 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...