/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-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:28:50,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:28:50,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:28:50,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:28:50,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:28:50,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:28:50,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:28:50,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:28:50,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:28:50,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:28:50,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:28:50,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:28:50,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:28:50,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:28:50,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:28:50,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:28:50,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:28:50,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:28:50,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:28:50,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:28:50,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:28:50,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:28:50,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:28:50,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:28:50,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:28:50,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:28:50,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:28:50,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:28:50,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:28:50,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:28:50,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:28:50,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:28:50,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:28:50,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:28:50,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:28:50,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:28:50,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:28:50,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:28:50,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:28:50,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:28:50,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:28:50,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-03 17:28:50,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:28:50,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:28:50,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:28:50,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:28:50,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:28:50,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:28:50,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:28:50,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:28:50,677 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:28:50,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:28:50,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:28:50,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:28:50,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:28:50,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:28:50,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:28:50,679 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-03 17:28:50,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:28:50,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:28:50,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:28:50,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:28:50,875 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:28:50,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-03-03 17:28:50,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f13b888f/6bfabca7df7c42ff93a8d6c4742939f9/FLAG5411a14f7 [2022-03-03 17:28:51,284 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:28:51,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-03-03 17:28:51,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f13b888f/6bfabca7df7c42ff93a8d6c4742939f9/FLAG5411a14f7 [2022-03-03 17:28:51,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f13b888f/6bfabca7df7c42ff93a8d6c4742939f9 [2022-03-03 17:28:51,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:28:51,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:28:51,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:28:51,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:28:51,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:28:51,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35957566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51, skipping insertion in model container [2022-03-03 17:28:51,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:28:51,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:28:51,493 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-hom.wvr.c[2586,2599] [2022-03-03 17:28:51,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:28:51,503 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:28:51,516 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-hom.wvr.c[2586,2599] [2022-03-03 17:28:51,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:28:51,529 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:28:51,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51 WrapperNode [2022-03-03 17:28:51,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:28:51,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:28:51,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:28:51,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:28:51,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,570 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-03-03 17:28:51,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:28:51,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:28:51,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:28:51,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:28:51,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:28:51,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:28:51,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:28:51,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:28:51,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (1/1) ... [2022-03-03 17:28:51,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:28:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:51,632 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-03 17:28:51,651 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-03 17:28:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:28:51,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:28:51,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:28:51,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:28:51,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:28:51,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:28:51,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:28:51,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:28:51,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:28:51,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:28:51,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:28:51,663 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:28:51,768 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:28:51,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:28:52,012 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:28:52,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:28:52,060 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-03 17:28:52,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:28:52 BoogieIcfgContainer [2022-03-03 17:28:52,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:28:52,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:28:52,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:28:52,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:28:52,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:28:51" (1/3) ... [2022-03-03 17:28:52,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8250f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:28:52, skipping insertion in model container [2022-03-03 17:28:52,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:28:51" (2/3) ... [2022-03-03 17:28:52,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8250f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:28:52, skipping insertion in model container [2022-03-03 17:28:52,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:28:52" (3/3) ... [2022-03-03 17:28:52,071 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-03-03 17:28:52,074 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:28:52,074 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:28:52,074 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:28:52,075 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:28:52,110 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,112 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,113 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,115 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,118 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,119 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,120 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,121 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,122 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,122 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,122 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,124 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,124 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,125 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:28:52,131 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-03 17:28:52,162 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:28:52,170 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-03 17:28:52,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-03 17:28:52,185 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-03-03 17:28:52,360 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 0 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-03 17:28:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 0 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-03 17:28:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:28:52,408 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:52,408 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] [2022-03-03 17:28:52,409 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-03 17:28:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2094363978, now seen corresponding path program 1 times [2022-03-03 17:28:52,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:52,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974538662] [2022-03-03 17:28:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:52,631 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-03 17:28:52,631 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:52,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974538662] [2022-03-03 17:28:52,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974538662] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:52,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:52,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:28:52,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096162705] [2022-03-03 17:28:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:52,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:28:52,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:28:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:28:52,679 INFO L87 Difference]: Start difference. First operand has 3813 states, 3812 states have (on average 3.809286463798531) internal successors, (14521), 3812 states have internal predecessors, (14521), 0 states have call successors, (0), 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 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:52,782 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-03-03 17:28:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:28:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-03-03 17:28:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:52,824 INFO L225 Difference]: With dead ends: 3813 [2022-03-03 17:28:52,824 INFO L226 Difference]: Without dead ends: 3809 [2022-03-03 17:28:52,826 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-03 17:28:52,829 INFO L933 BasicCegarLoop]: 128 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, 128 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-03 17:28:52,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-03-03 17:28:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-03-03 17:28:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3809 states, 3808 states have (on average 3.510766806722689) internal successors, (13369), 3808 states have internal predecessors, (13369), 0 states have call successors, (0), 0 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-03 17:28:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-03-03 17:28:53,023 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-03-03 17:28:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:53,023 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-03-03 17:28:53,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-03-03 17:28:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:28:53,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:53,038 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] [2022-03-03 17:28:53,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:28:53,038 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-03 17:28:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2012101173, now seen corresponding path program 1 times [2022-03-03 17:28:53,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:53,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487553922] [2022-03-03 17:28:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:53,245 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-03 17:28:53,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:53,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487553922] [2022-03-03 17:28:53,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487553922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:53,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:53,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-03 17:28:53,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675350355] [2022-03-03 17:28:53,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:53,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-03 17:28:53,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:53,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-03 17:28:53,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:28:53,248 INFO L87 Difference]: Start difference. First operand 3809 states and 13369 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:53,338 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-03-03 17:28:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-03 17:28:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-03-03 17:28:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:53,378 INFO L225 Difference]: With dead ends: 7071 [2022-03-03 17:28:53,378 INFO L226 Difference]: Without dead ends: 7071 [2022-03-03 17:28:53,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-03 17:28:53,380 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 181 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:53,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-03-03 17:28:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-03-03 17:28:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4977 states have (on average 3.5173799477596948) internal successors, (17506), 4977 states have internal predecessors, (17506), 0 states have call successors, (0), 0 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-03 17:28:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-03-03 17:28:53,578 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-03-03 17:28:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:53,581 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-03-03 17:28:53,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-03-03 17:28:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-03 17:28:53,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:53,600 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] [2022-03-03 17:28:53,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:28:53,600 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-03 17:28:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1404457087, now seen corresponding path program 1 times [2022-03-03 17:28:53,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:53,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215926364] [2022-03-03 17:28:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:53,804 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-03 17:28:53,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:53,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215926364] [2022-03-03 17:28:53,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215926364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:53,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:28:53,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-03 17:28:53,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214795326] [2022-03-03 17:28:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:53,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-03 17:28:53,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-03 17:28:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-03-03 17:28:53,812 INFO L87 Difference]: Start difference. First operand 4978 states and 17506 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:53,970 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-03-03 17:28:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:28:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-03-03 17:28:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:54,001 INFO L225 Difference]: With dead ends: 4994 [2022-03-03 17:28:54,002 INFO L226 Difference]: Without dead ends: 4984 [2022-03-03 17:28:54,004 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-03 17:28:54,005 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 249 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:54,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 379 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:28:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-03-03 17:28:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-03-03 17:28:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4979 states, 4978 states have (on average 3.5168742466854157) internal successors, (17507), 4978 states have internal predecessors, (17507), 0 states have call successors, (0), 0 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-03 17:28:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-03-03 17:28:54,153 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-03-03 17:28:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:54,153 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-03-03 17:28:54,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:28:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-03-03 17:28:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-03 17:28:54,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:54,166 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] [2022-03-03 17:28:54,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:28:54,167 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-03 17:28:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1972009608, now seen corresponding path program 1 times [2022-03-03 17:28:54,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:54,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122530185] [2022-03-03 17:28:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:54,303 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-03 17:28:54,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:54,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122530185] [2022-03-03 17:28:54,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122530185] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:54,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255332533] [2022-03-03 17:28:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:54,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:54,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:54,305 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-03 17:28:54,306 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-03 17:28:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:54,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:28:54,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:54,709 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-03 17:28:54,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:54,999 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-03 17:28:54,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255332533] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:54,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:28:54,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-03 17:28:55,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644338053] [2022-03-03 17:28:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:55,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:28:55,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:28:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-03 17:28:55,003 INFO L87 Difference]: Start difference. First operand 4979 states and 17507 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-03 17:28:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:55,121 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-03-03 17:28:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:28:55,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-03-03 17:28:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:55,142 INFO L225 Difference]: With dead ends: 5483 [2022-03-03 17:28:55,142 INFO L226 Difference]: Without dead ends: 5483 [2022-03-03 17:28:55,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 224 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-03 17:28:55,148 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:55,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 383 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:28:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-03-03 17:28:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-03-03 17:28:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 3.5257205399489235) internal successors, (19328), 5482 states have internal predecessors, (19328), 0 states have call successors, (0), 0 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-03 17:28:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-03-03 17:28:55,328 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-03-03 17:28:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:55,329 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-03-03 17:28:55,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-03 17:28:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-03-03 17:28:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 17:28:55,342 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:55,342 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] [2022-03-03 17:28:55,362 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-03 17:28:55,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:55,556 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-03 17:28:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1653076207, now seen corresponding path program 1 times [2022-03-03 17:28:55,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:55,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688629427] [2022-03-03 17:28:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:55,639 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-03 17:28:55,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:55,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688629427] [2022-03-03 17:28:55,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688629427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:55,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178320700] [2022-03-03 17:28:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:55,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:55,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:55,641 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-03 17:28:55,645 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-03 17:28:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:55,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:28:55,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:55,966 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-03 17:28:55,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:56,216 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-03 17:28:56,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178320700] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:56,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:28:56,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-03 17:28:56,217 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101699685] [2022-03-03 17:28:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:56,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:28:56,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:28:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:28:56,218 INFO L87 Difference]: Start difference. First operand 5483 states and 19328 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 17:28:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:56,449 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-03-03 17:28:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 17:28:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-03-03 17:28:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:56,518 INFO L225 Difference]: With dead ends: 8369 [2022-03-03 17:28:56,519 INFO L226 Difference]: Without dead ends: 8369 [2022-03-03 17:28:56,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 232 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-03 17:28:56,519 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 548 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 694 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-03 17:28:56,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 694 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:28:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-03-03 17:28:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-03-03 17:28:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 3.521197007481297) internal successors, (19768), 5614 states have internal predecessors, (19768), 0 states have call successors, (0), 0 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-03 17:28:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-03-03 17:28:56,658 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-03-03 17:28:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:56,658 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-03-03 17:28:56,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 17:28:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-03-03 17:28:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-03 17:28:56,676 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:56,676 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] [2022-03-03 17:28:56,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-03 17:28:56,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:56,893 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-03 17:28:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1659282011, now seen corresponding path program 2 times [2022-03-03 17:28:56,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:56,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729804539] [2022-03-03 17:28:56,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:56,997 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-03 17:28:56,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:56,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729804539] [2022-03-03 17:28:56,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729804539] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:56,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777639631] [2022-03-03 17:28:56,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:28:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:56,999 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-03 17:28:57,000 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-03 17:28:57,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-03 17:28:57,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:28:57,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-03 17:28:57,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:57,397 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-03 17:28:57,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-03 17:28:57,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777639631] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:28:57,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-03 17:28:57,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-03-03 17:28:57,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251794955] [2022-03-03 17:28:57,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:28:57,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:28:57,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:57,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:28:57,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-03-03 17:28:57,399 INFO L87 Difference]: Start difference. First operand 5615 states and 19768 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 17:28:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:57,559 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-03-03 17:28:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:28:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-03-03 17:28:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:57,577 INFO L225 Difference]: With dead ends: 5306 [2022-03-03 17:28:57,577 INFO L226 Difference]: Without dead ends: 5306 [2022-03-03 17:28:57,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 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-03 17:28:57,578 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 192 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 412 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-03 17:28:57,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:28:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-03-03 17:28:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-03-03 17:28:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 3.5339297403447523) internal successors, (16196), 4583 states have internal predecessors, (16196), 0 states have call successors, (0), 0 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-03 17:28:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-03-03 17:28:57,680 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-03-03 17:28:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:57,681 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-03-03 17:28:57,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-03 17:28:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-03-03 17:28:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:28:57,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:57,690 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, 1, 1, 1, 1] [2022-03-03 17:28:57,707 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-03 17:28:57,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:57,907 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-03 17:28:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 611662898, now seen corresponding path program 1 times [2022-03-03 17:28:57,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:57,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231475573] [2022-03-03 17:28:57,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:58,718 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-03 17:28:58,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:58,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231475573] [2022-03-03 17:28:58,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231475573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:58,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368440209] [2022-03-03 17:28:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:58,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:58,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:58,720 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-03 17:28:58,721 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-03 17:28:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:58,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-03 17:28:58,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:58,914 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-03 17:28:58,952 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:28:58,953 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-03 17:28:59,366 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:28:59,366 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-03 17:29:00,624 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 27 treesize of output 27 [2022-03-03 17:29:00,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:00,910 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 27 treesize of output 27 [2022-03-03 17:29:01,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:01,155 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 55 treesize of output 39 [2022-03-03 17:29:01,787 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-03 17:29:01,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:02,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (not (< c_~max3~0 .cse0))))) (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_174 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:02,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse0) (not (< c_~max3~0 .cse0)) (not (< c_~max2~0 .cse0))))) (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_174) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:03,252 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:03,252 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 335 treesize of output 295 [2022-03-03 17:29:03,264 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 256 treesize of output 244 [2022-03-03 17:29:03,270 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 244 treesize of output 238 [2022-03-03 17:29:03,277 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 238 treesize of output 202 [2022-03-03 17:29:03,288 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 202 treesize of output 184 [2022-03-03 17:29:06,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:29:06,460 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-03 17:29:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:29:06,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368440209] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:06,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:06,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 83 [2022-03-03 17:29:06,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624798862] [2022-03-03 17:29:06,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:06,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-03 17:29:06,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:06,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-03 17:29:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=836, Invalid=5650, Unknown=2, NotChecked=318, Total=6806 [2022-03-03 17:29:06,628 INFO L87 Difference]: Start difference. First operand 4584 states and 16196 transitions. Second operand has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-03 17:29:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:15,061 INFO L93 Difference]: Finished difference Result 27571 states and 97116 transitions. [2022-03-03 17:29:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-03 17:29:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 0 states have call successors, (0), 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 126 [2022-03-03 17:29:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:15,164 INFO L225 Difference]: With dead ends: 27571 [2022-03-03 17:29:15,164 INFO L226 Difference]: Without dead ends: 27559 [2022-03-03 17:29:15,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 164 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9827 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3621, Invalid=23110, Unknown=9, NotChecked=650, Total=27390 [2022-03-03 17:29:15,170 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 4187 mSDsluCounter, 9809 mSDsCounter, 0 mSdLazyCounter, 5077 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 9055 SdHoareTripleChecker+Invalid, 8161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 5077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2817 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:15,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4187 Valid, 9055 Invalid, 8161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 5077 Invalid, 0 Unknown, 2817 Unchecked, 2.5s Time] [2022-03-03 17:29:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27559 states. [2022-03-03 17:29:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27559 to 8607. [2022-03-03 17:29:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8607 states, 8606 states have (on average 3.5347432024169185) internal successors, (30420), 8606 states have internal predecessors, (30420), 0 states have call successors, (0), 0 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-03 17:29:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8607 states to 8607 states and 30420 transitions. [2022-03-03 17:29:15,551 INFO L78 Accepts]: Start accepts. Automaton has 8607 states and 30420 transitions. Word has length 126 [2022-03-03 17:29:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:15,551 INFO L470 AbstractCegarLoop]: Abstraction has 8607 states and 30420 transitions. [2022-03-03 17:29:15,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 4.156626506024097) internal successors, (345), 83 states have internal predecessors, (345), 0 states have call successors, (0), 0 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-03 17:29:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8607 states and 30420 transitions. [2022-03-03 17:29:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:29:15,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:15,570 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, 1, 1, 1, 1] [2022-03-03 17:29:15,589 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-03 17:29:15,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:15,787 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-03 17:29:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash 4018812, now seen corresponding path program 1 times [2022-03-03 17:29:15,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:15,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706474490] [2022-03-03 17:29:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:16,416 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-03 17:29:16,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:16,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706474490] [2022-03-03 17:29:16,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706474490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:16,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107398962] [2022-03-03 17:29:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:16,418 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-03 17:29:16,419 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-03 17:29:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:16,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:29:16,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:16,560 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-03 17:29:16,595 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:16,596 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-03 17:29:16,640 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:16,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-03 17:29:17,235 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:17,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-03-03 17:29:17,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:29:18,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:29:18,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:18,431 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-03 17:29:18,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:18,771 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-03 17:29:18,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:18,988 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-03 17:29:19,763 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-03 17:29:19,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:21,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0))))) (< 0 ~M~0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= c_~max2~0 .cse2)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:30,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< c_~max3~0 .cse0))))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (< c_~max2~0 c_~max3~0))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= .cse2 c_~max2~0)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:31,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (not .cse0) (= .cse1 c_~max2~0)) (or (= c_~max1~0 c_~max2~0) .cse0)))) (< 0 ~M~0) (and (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:31,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (= c_~max1~0 c_~max2~0) .cse0) (or (not .cse0) (= .cse1 c_~max2~0))))) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:36,281 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:36,281 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 177 treesize of output 117 [2022-03-03 17:29:36,300 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:36,301 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 1939 treesize of output 1863 [2022-03-03 17:29:36,319 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:36,320 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 1863 treesize of output 1797 [2022-03-03 17:29:36,343 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 1686 treesize of output 1590 [2022-03-03 17:29:36,361 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 1590 treesize of output 1542 [2022-03-03 17:29:36,375 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 1542 treesize of output 1446 [2022-03-03 17:29:36,389 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 1446 treesize of output 1254 [2022-03-03 17:29:50,541 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-03 17:29:50,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107398962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:50,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:50,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 35, 36] total 85 [2022-03-03 17:29:50,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150917643] [2022-03-03 17:29:50,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-03 17:29:50,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-03 17:29:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=938, Invalid=5546, Unknown=12, NotChecked=644, Total=7140 [2022-03-03 17:29:50,545 INFO L87 Difference]: Start difference. First operand 8607 states and 30420 transitions. Second operand has 85 states, 85 states have (on average 3.9411764705882355) internal successors, (335), 85 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-03 17:30:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:04,966 INFO L93 Difference]: Finished difference Result 26980 states and 94043 transitions. [2022-03-03 17:30:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-03 17:30:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.9411764705882355) internal successors, (335), 85 states have internal predecessors, (335), 0 states have call successors, (0), 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 126 [2022-03-03 17:30:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:05,052 INFO L225 Difference]: With dead ends: 26980 [2022-03-03 17:30:05,052 INFO L226 Difference]: Without dead ends: 26676 [2022-03-03 17:30:05,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 220 SyntacticMatches, 17 SemanticMatches, 196 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14426 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=5110, Invalid=32319, Unknown=29, NotChecked=1548, Total=39006 [2022-03-03 17:30:05,058 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 4050 mSDsluCounter, 14840 mSDsCounter, 0 mSdLazyCounter, 4973 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4050 SdHoareTripleChecker+Valid, 13514 SdHoareTripleChecker+Invalid, 14395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 4973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9257 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:05,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4050 Valid, 13514 Invalid, 14395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 4973 Invalid, 0 Unknown, 9257 Unchecked, 2.3s Time] [2022-03-03 17:30:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26676 states. [2022-03-03 17:30:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26676 to 12745. [2022-03-03 17:30:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12745 states, 12744 states have (on average 3.499372253609542) internal successors, (44596), 12744 states have internal predecessors, (44596), 0 states have call successors, (0), 0 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-03 17:30:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12745 states to 12745 states and 44596 transitions. [2022-03-03 17:30:05,509 INFO L78 Accepts]: Start accepts. Automaton has 12745 states and 44596 transitions. Word has length 126 [2022-03-03 17:30:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:05,509 INFO L470 AbstractCegarLoop]: Abstraction has 12745 states and 44596 transitions. [2022-03-03 17:30:05,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.9411764705882355) internal successors, (335), 85 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-03 17:30:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 12745 states and 44596 transitions. [2022-03-03 17:30:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:30:05,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:05,539 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, 1, 1, 1, 1] [2022-03-03 17:30:05,562 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-03 17:30:05,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:05,759 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-03 17:30:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1583376580, now seen corresponding path program 2 times [2022-03-03 17:30:05,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:05,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816210337] [2022-03-03 17:30:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:06,396 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-03 17:30:06,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:06,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816210337] [2022-03-03 17:30:06,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816210337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:06,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710465615] [2022-03-03 17:30:06,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:30:06,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:06,398 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-03 17:30:06,399 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-03 17:30:06,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:06,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:06,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-03 17:30:06,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:06,535 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-03 17:30:06,565 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:30:06,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 17:30:06,797 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:30:06,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:30:07,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-03 17:30:07,690 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-03 17:30:07,874 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:07,874 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-03 17:30:08,630 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-03 17:30:08,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:09,663 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:09,664 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 259 treesize of output 227 [2022-03-03 17:30:09,670 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 188 treesize of output 176 [2022-03-03 17:30:09,675 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 176 treesize of output 164 [2022-03-03 17:30:09,680 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 164 treesize of output 158 [2022-03-03 17:30:09,685 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 158 treesize of output 134 [2022-03-03 17:30:10,994 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 13 treesize of output 11 [2022-03-03 17:30:11,056 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-03 17:30:11,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710465615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:11,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:11,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 68 [2022-03-03 17:30:11,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041773136] [2022-03-03 17:30:11,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:11,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-03-03 17:30:11,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-03-03 17:30:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=3816, Unknown=6, NotChecked=0, Total=4556 [2022-03-03 17:30:11,059 INFO L87 Difference]: Start difference. First operand 12745 states and 44596 transitions. Second operand has 68 states, 68 states have (on average 4.911764705882353) internal successors, (334), 68 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:21,227 INFO L93 Difference]: Finished difference Result 37650 states and 130294 transitions. [2022-03-03 17:30:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-03-03 17:30:21,227 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.911764705882353) internal successors, (334), 68 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-03-03 17:30:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:21,340 INFO L225 Difference]: With dead ends: 37650 [2022-03-03 17:30:21,340 INFO L226 Difference]: Without dead ends: 37346 [2022-03-03 17:30:21,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 228 SyntacticMatches, 13 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10961 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3445, Invalid=24603, Unknown=8, NotChecked=0, Total=28056 [2022-03-03 17:30:21,343 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 2746 mSDsluCounter, 11629 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2746 SdHoareTripleChecker+Valid, 10816 SdHoareTripleChecker+Invalid, 9032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2620 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:21,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2746 Valid, 10816 Invalid, 9032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 6262 Invalid, 0 Unknown, 2620 Unchecked, 2.6s Time] [2022-03-03 17:30:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37346 states. [2022-03-03 17:30:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37346 to 11587. [2022-03-03 17:30:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11587 states, 11586 states have (on average 3.5573968582772313) internal successors, (41216), 11586 states have internal predecessors, (41216), 0 states have call successors, (0), 0 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-03 17:30:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11587 states to 11587 states and 41216 transitions. [2022-03-03 17:30:21,851 INFO L78 Accepts]: Start accepts. Automaton has 11587 states and 41216 transitions. Word has length 126 [2022-03-03 17:30:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:21,851 INFO L470 AbstractCegarLoop]: Abstraction has 11587 states and 41216 transitions. [2022-03-03 17:30:21,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.911764705882353) internal successors, (334), 68 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11587 states and 41216 transitions. [2022-03-03 17:30:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-03 17:30:21,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:21,876 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, 1, 1, 1, 1] [2022-03-03 17:30:21,895 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-03 17:30:22,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:22,084 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 532590170, now seen corresponding path program 3 times [2022-03-03 17:30:22,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:22,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678104068] [2022-03-03 17:30:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:22,868 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-03 17:30:22,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:22,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678104068] [2022-03-03 17:30:22,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678104068] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:22,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022254531] [2022-03-03 17:30:22,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:30:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:22,870 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-03 17:30:22,871 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-03 17:30:22,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:30:22,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:22,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 17:30:22,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:23,043 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-03 17:30:23,085 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:30:23,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-03-03 17:30:23,385 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:30:23,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:30:23,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:30:23,917 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-03 17:30:24,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-03 17:30:24,651 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-03 17:30:24,858 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:24,858 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-03 17:30:25,666 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-03 17:30:25,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:27,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_287 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (not .cse0) (= .cse1 c_~max2~0)) (or .cse0 (= c_~max1~0 c_~max2~0))))) (and (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2))))) (or (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (< c_~max2~0 c_~max3~0))) (<= 1 ~M~0))) is different from false [2022-03-03 17:30:34,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_287 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse0))) (and (or (= .cse0 c_~max2~0) (not .cse1)) (or .cse1 (= c_~max1~0 c_~max2~0))))) (and (or (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2))))) (<= 1 ~M~0))) is different from false [2022-03-03 17:30:36,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_287 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (and (or (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= .cse2 c_~max2~0)) (or .cse1 (= c_~max1~0 c_~max2~0))))) (<= 1 ~M~0))) is different from false [2022-03-03 17:30:36,643 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_287 (Array Int Int))) (or (and (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0)))) (or (forall ((v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< c_~max2~0 c_~max3~0))) (<= (+ ~M~0 1) 0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or .cse1 (= c_~max1~0 c_~max2~0)) (or (not .cse1) (= .cse2 c_~max2~0))))) (<= 1 ~M~0))) is different from false [2022-03-03 17:30:41,208 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:41,209 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 177 treesize of output 117 [2022-03-03 17:30:41,230 INFO L353 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-03-03 17:30:41,230 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 3819 treesize of output 3623 [2022-03-03 17:30:41,255 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 17:30:41,256 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 3623 treesize of output 3477 [2022-03-03 17:30:41,290 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 3398 treesize of output 3206 [2022-03-03 17:30:41,308 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 3206 treesize of output 2822 [2022-03-03 17:30:41,326 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 2822 treesize of output 2630 [2022-03-03 17:30:41,344 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 2630 treesize of output 2534 [2022-03-03 17:30:41,359 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-03 17:30:41,376 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-03 17:30:41,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:41,561 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.transform(TermContextTransformationEngine.java:65) 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-03 17:30:41,562 INFO L158 Benchmark]: Toolchain (without parser) took 110253.13ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 839.9MB). Free memory was 150.1MB in the beginning and 536.8MB in the end (delta: -386.7MB). Peak memory consumption was 453.9MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,562 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:30:41,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.84ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 175.1MB in the end (delta: -25.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.80ms. Allocated memory is still 201.3MB. Free memory was 175.1MB in the beginning and 173.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,563 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 201.3MB. Free memory was 173.1MB in the beginning and 172.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,563 INFO L158 Benchmark]: RCFGBuilder took 460.00ms. Allocated memory is still 201.3MB. Free memory was 171.5MB in the beginning and 152.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,563 INFO L158 Benchmark]: TraceAbstraction took 109496.63ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 839.9MB). Free memory was 152.1MB in the beginning and 536.8MB in the end (delta: -384.7MB). Peak memory consumption was 455.7MB. Max. memory is 8.0GB. [2022-03-03 17:30:41,564 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.12ms. Allocated memory is still 201.3MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.84ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 175.1MB in the end (delta: -25.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.80ms. Allocated memory is still 201.3MB. Free memory was 175.1MB in the beginning and 173.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 201.3MB. Free memory was 173.1MB in the beginning and 172.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.00ms. Allocated memory is still 201.3MB. Free memory was 171.5MB in the beginning and 152.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 109496.63ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 839.9MB). Free memory was 152.1MB in the beginning and 536.8MB in the end (delta: -384.7MB). Peak memory consumption was 455.7MB. 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-03 17:30:41,593 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...