/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 15:57:18,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 15:57:18,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 15:57:18,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 15:57:18,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 15:57:18,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 15:57:18,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 15:57:18,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 15:57:18,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 15:57:18,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 15:57:18,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 15:57:18,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 15:57:18,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 15:57:18,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 15:57:18,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 15:57:18,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 15:57:18,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 15:57:18,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 15:57:18,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 15:57:18,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 15:57:18,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 15:57:18,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 15:57:18,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 15:57:18,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 15:57:18,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 15:57:18,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 15:57:18,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 15:57:18,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 15:57:18,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 15:57:18,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 15:57:18,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 15:57:18,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 15:57:18,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 15:57:18,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 15:57:18,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 15:57:18,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 15:57:18,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 15:57:18,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 15:57:18,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 15:57:18,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 15:57:18,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 15:57:18,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 15:57:19,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 15:57:19,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 15:57:19,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 15:57:19,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 15:57:19,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 15:57:19,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 15:57:19,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 15:57:19,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 15:57:19,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 15:57:19,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 15:57:19,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:57:19,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 15:57:19,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-01 15:57:19,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 15:57:19,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 15:57:19,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 15:57:19,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 15:57:19,183 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 15:57:19,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-01 15:57:19,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a18b530/ed585a893d1b426aa2320a0eb65c6202/FLAGd7e625b5b [2022-03-01 15:57:19,580 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 15:57:19,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-03-01 15:57:19,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a18b530/ed585a893d1b426aa2320a0eb65c6202/FLAGd7e625b5b [2022-03-01 15:57:19,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a18b530/ed585a893d1b426aa2320a0eb65c6202 [2022-03-01 15:57:19,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 15:57:19,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 15:57:19,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 15:57:19,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 15:57:19,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 15:57:19,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356372eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19, skipping insertion in model container [2022-03-01 15:57:19,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 15:57:19,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 15:57:19,749 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-min-array-hom.wvr.c[2586,2599] [2022-03-01 15:57:19,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:57:19,758 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 15:57:19,772 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-min-array-hom.wvr.c[2586,2599] [2022-03-01 15:57:19,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 15:57:19,783 INFO L208 MainTranslator]: Completed translation [2022-03-01 15:57:19,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19 WrapperNode [2022-03-01 15:57:19,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 15:57:19,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 15:57:19,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 15:57:19,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 15:57:19,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,806 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-03-01 15:57:19,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 15:57:19,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 15:57:19,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 15:57:19,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 15:57:19,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 15:57:19,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 15:57:19,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 15:57:19,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 15:57:19,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (1/1) ... [2022-03-01 15:57:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 15:57:19,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:19,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 15:57:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 15:57:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 15:57:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-01 15:57:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-01 15:57:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-01 15:57:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 15:57:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 15:57:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 15:57:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 15:57:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 15:57:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 15:57:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 15:57:19,882 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 15:57:19,936 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 15:57:19,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 15:57:20,166 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 15:57:20,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 15:57:20,209 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-01 15:57:20,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:57:20 BoogieIcfgContainer [2022-03-01 15:57:20,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 15:57:20,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 15:57:20,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 15:57:20,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 15:57:20,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 03:57:19" (1/3) ... [2022-03-01 15:57:20,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c16c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:57:20, skipping insertion in model container [2022-03-01 15:57:20,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 03:57:19" (2/3) ... [2022-03-01 15:57:20,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c16c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 03:57:20, skipping insertion in model container [2022-03-01 15:57:20,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 03:57:20" (3/3) ... [2022-03-01 15:57:20,226 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-03-01 15:57:20,229 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 15:57:20,229 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 15:57:20,230 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 15:57:20,230 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 15:57:20,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,274 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,274 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,274 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,274 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,276 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,282 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,283 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,284 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,285 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,289 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,290 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,290 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,292 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:57:20,295 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-01 15:57:20,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 15:57:20,330 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 15:57:20,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-01 15:57:20,338 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-03-01 15:57:20,496 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-01 15:57:20,508 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-01 15:57:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-01 15:57:20,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:20,548 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-01 15:57:20,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 109226554, now seen corresponding path program 1 times [2022-03-01 15:57:20,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:20,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436567055] [2022-03-01 15:57:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:20,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:20,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436567055] [2022-03-01 15:57:20,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436567055] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:20,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:57:20,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 15:57:20,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108199608] [2022-03-01 15:57:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:20,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 15:57:20,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 15:57:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:57:20,790 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-01 15:57:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:20,867 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-03-01 15:57:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 15:57:20,869 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-01 15:57:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:20,920 INFO L225 Difference]: With dead ends: 3813 [2022-03-01 15:57:20,921 INFO L226 Difference]: Without dead ends: 3809 [2022-03-01 15:57:20,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 15:57:20,926 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-01 15:57:20,926 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-01 15:57:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-03-01 15:57:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-03-01 15:57:21,125 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-01 15:57:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-03-01 15:57:21,141 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-03-01 15:57:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:21,141 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-03-01 15:57:21,142 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-01 15:57:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-03-01 15:57:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-01 15:57:21,153 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:21,153 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-01 15:57:21,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 15:57:21,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 669998521, now seen corresponding path program 1 times [2022-03-01 15:57:21,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:21,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795816508] [2022-03-01 15:57:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:21,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:21,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795816508] [2022-03-01 15:57:21,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795816508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:21,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:57:21,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 15:57:21,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310539939] [2022-03-01 15:57:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:21,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 15:57:21,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 15:57:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-01 15:57:21,356 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-01 15:57:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:21,495 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-03-01 15:57:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 15:57:21,495 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-01 15:57:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:21,537 INFO L225 Difference]: With dead ends: 7071 [2022-03-01 15:57:21,537 INFO L226 Difference]: Without dead ends: 7071 [2022-03-01 15:57:21,539 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-01 15:57:21,541 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-01 15:57:21,542 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-01 15:57:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-03-01 15:57:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-03-01 15:57:21,686 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-01 15:57:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-03-01 15:57:21,742 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-03-01 15:57:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:21,743 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-03-01 15:57:21,745 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-01 15:57:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-03-01 15:57:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-03-01 15:57:21,762 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:21,763 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-01 15:57:21,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 15:57:21,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 62354435, now seen corresponding path program 1 times [2022-03-01 15:57:21,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:21,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662975490] [2022-03-01 15:57:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:22,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:22,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662975490] [2022-03-01 15:57:22,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662975490] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:22,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 15:57:22,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 15:57:22,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88895936] [2022-03-01 15:57:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:22,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 15:57:22,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 15:57:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-03-01 15:57:22,065 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-01 15:57:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:22,227 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-03-01 15:57:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:57:22,227 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-01 15:57:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:22,263 INFO L225 Difference]: With dead ends: 4994 [2022-03-01 15:57:22,263 INFO L226 Difference]: Without dead ends: 4984 [2022-03-01 15:57:22,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2022-03-01 15:57:22,269 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-01 15:57:22,270 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-01 15:57:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-03-01 15:57:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-03-01 15:57:22,391 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-01 15:57:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-03-01 15:57:22,409 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-03-01 15:57:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:22,409 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-03-01 15:57:22,409 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-01 15:57:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-03-01 15:57:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-01 15:57:22,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:22,422 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-01 15:57:22,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 15:57:22,423 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 629906956, now seen corresponding path program 1 times [2022-03-01 15:57:22,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:22,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456345415] [2022-03-01 15:57:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:22,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:22,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456345415] [2022-03-01 15:57:22,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456345415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:22,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135912211] [2022-03-01 15:57:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:22,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:22,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:22,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 15:57:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:22,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-01 15:57:22,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:22,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:23,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135912211] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:23,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:57:23,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-01 15:57:23,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272565379] [2022-03-01 15:57:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:23,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 15:57:23,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 15:57:23,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:57:23,147 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-01 15:57:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:23,284 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-03-01 15:57:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 15:57:23,285 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-01 15:57:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:23,301 INFO L225 Difference]: With dead ends: 5483 [2022-03-01 15:57:23,301 INFO L226 Difference]: Without dead ends: 5483 [2022-03-01 15:57:23,302 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-01 15:57:23,302 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-01 15:57:23,302 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-01 15:57:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-03-01 15:57:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-03-01 15:57:23,409 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-01 15:57:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-03-01 15:57:23,426 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-03-01 15:57:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:23,426 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-03-01 15:57:23,426 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-01 15:57:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-03-01 15:57:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:57:23,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:23,438 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-01 15:57:23,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-01 15:57:23,649 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-01 15:57:23,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash 310973555, now seen corresponding path program 1 times [2022-03-01 15:57:23,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:23,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653107562] [2022-03-01 15:57:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:23,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:23,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653107562] [2022-03-01 15:57:23,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653107562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:23,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547409239] [2022-03-01 15:57:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:23,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:23,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:23,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:23,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 15:57:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:23,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 15:57:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:24,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:24,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547409239] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:24,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-01 15:57:24,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-01 15:57:24,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117302277] [2022-03-01 15:57:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:24,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 15:57:24,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 15:57:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-01 15:57:24,475 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-01 15:57:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:24,697 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-03-01 15:57:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 15:57:24,698 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-01 15:57:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:24,759 INFO L225 Difference]: With dead ends: 8369 [2022-03-01 15:57:24,759 INFO L226 Difference]: Without dead ends: 8369 [2022-03-01 15:57:24,760 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-01 15:57:24,760 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 538 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 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-01 15:57:24,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 694 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 15:57:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-03-01 15:57:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-03-01 15:57:24,899 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-01 15:57:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-03-01 15:57:24,917 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-03-01 15:57:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:24,918 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-03-01 15:57:24,918 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-01 15:57:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-03-01 15:57:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-01 15:57:24,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:24,931 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-01 15:57:24,954 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-01 15:57:25,151 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-01 15:57:25,152 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1142457735, now seen corresponding path program 2 times [2022-03-01 15:57:25,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:25,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641291853] [2022-03-01 15:57:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:57:25,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641291853] [2022-03-01 15:57:25,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641291853] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626886353] [2022-03-01 15:57:25,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:57:25,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:25,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:25,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 15:57:25,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 15:57:25,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:57:25,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-01 15:57:25,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-01 15:57:25,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 15:57:25,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626886353] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 15:57:25,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 15:57:25,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-03-01 15:57:25,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705488294] [2022-03-01 15:57:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 15:57:25,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 15:57:25,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 15:57:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-03-01 15:57:25,686 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-01 15:57:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:25,844 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-03-01 15:57:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-01 15:57:25,844 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-01 15:57:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:25,887 INFO L225 Difference]: With dead ends: 5306 [2022-03-01 15:57:25,887 INFO L226 Difference]: Without dead ends: 5306 [2022-03-01 15:57:25,887 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-01 15:57:25,888 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 185 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 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.0s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:25,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 15:57:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-03-01 15:57:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-03-01 15:57:25,963 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-01 15:57:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-03-01 15:57:25,976 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-03-01 15:57:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:25,976 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-03-01 15:57:25,976 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-01 15:57:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-03-01 15:57:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:57:25,986 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:25,986 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-01 15:57:26,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-01 15:57:26,201 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-01 15:57:26,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1101298630, now seen corresponding path program 1 times [2022-03-01 15:57:26,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:26,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378402004] [2022-03-01 15:57:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:27,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:27,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378402004] [2022-03-01 15:57:27,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378402004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:27,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029891383] [2022-03-01 15:57:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:27,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:27,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:27,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:27,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 15:57:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:27,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-01 15:57:27,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:27,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:57:27,383 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:57:27,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 15:57:27,892 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:57:27,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-01 15:57:29,243 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-01 15:57:29,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:57:29,531 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-01 15:57:29,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:57:29,750 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:29,751 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 32 [2022-03-01 15:57:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:29,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:30,277 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_174 (Array Int Int))) (< (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 (* 4 c_~M~0))) c_~min3~0))) (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 (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)))))) is different from false [2022-03-01 15:57:30,516 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~min1~0 c_~min3~0) (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< (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 (* 4 c_~M~0))) c_~min3~0))) (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 (* 4 c_~M~0))))) (or (not (< .cse0 c_~min3~0)) (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0)))))) is different from false [2022-03-01 15:57:30,684 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:30,685 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-01 15:57:30,692 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 220 [2022-03-01 15:57:30,698 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 220 treesize of output 208 [2022-03-01 15:57:30,703 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 208 treesize of output 202 [2022-03-01 15:57:30,707 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-01 15:57:34,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 15:57:34,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-01 15:57:34,449 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-01 15:57:34,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029891383] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:57:34,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:57:34,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 85 [2022-03-01 15:57:34,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313061279] [2022-03-01 15:57:34,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:57:34,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-01 15:57:34,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:57:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-01 15:57:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5999, Unknown=2, NotChecked=326, Total=7140 [2022-03-01 15:57:34,452 INFO L87 Difference]: Start difference. First operand 4584 states and 16196 transitions. Second operand has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 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-01 15:57:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:57:41,552 INFO L93 Difference]: Finished difference Result 23682 states and 83992 transitions. [2022-03-01 15:57:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-01 15:57:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 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-01 15:57:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:57:41,625 INFO L225 Difference]: With dead ends: 23682 [2022-03-01 15:57:41,625 INFO L226 Difference]: Without dead ends: 23652 [2022-03-01 15:57:41,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7755 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2840, Invalid=19515, Unknown=3, NotChecked=594, Total=22952 [2022-03-01 15:57:41,631 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3378 mSDsluCounter, 6765 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3378 SdHoareTripleChecker+Valid, 6307 SdHoareTripleChecker+Invalid, 5648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1775 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-01 15:57:41,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3378 Valid, 6307 Invalid, 5648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3711 Invalid, 0 Unknown, 1775 Unchecked, 1.9s Time] [2022-03-01 15:57:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2022-03-01 15:57:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 8846. [2022-03-01 15:57:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8846 states, 8845 states have (on average 3.572074618428491) internal successors, (31595), 8845 states have internal predecessors, (31595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:57:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 31595 transitions. [2022-03-01 15:57:41,954 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 31595 transitions. Word has length 126 [2022-03-01 15:57:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:57:41,955 INFO L470 AbstractCegarLoop]: Abstraction has 8846 states and 31595 transitions. [2022-03-01 15:57:41,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 4.0588235294117645) internal successors, (345), 85 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-01 15:57:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 31595 transitions. [2022-03-01 15:57:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:57:41,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:57:41,974 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-01 15:57:41,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-01 15:57:42,193 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-01 15:57:42,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:57:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:57:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash 493654544, now seen corresponding path program 1 times [2022-03-01 15:57:42,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:57:42,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217073633] [2022-03-01 15:57:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:57:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:43,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:57:43,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217073633] [2022-03-01 15:57:43,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217073633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:57:43,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935327937] [2022-03-01 15:57:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:57:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:57:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:57:43,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:57:43,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 15:57:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:57:43,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-01 15:57:43,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:57:43,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:57:43,270 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:57:43,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 15:57:43,317 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:57:43,317 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-01 15:57:43,874 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:57:43,874 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-01 15:57:44,123 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-01 15:57:44,705 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-01 15:57:45,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:57:45,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:57:45,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:57:45,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:57:45,816 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:57:45,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-03-01 15:57:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:57:46,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:57:48,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (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_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (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))) c_~min3~0)) (< c_~min3~0 c_~min2~0))) (< 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 (< .cse2 c_~min1~0))) (and (or (= c_~min2~0 c_~min1~0) .cse1) (or (not .cse1) (= c_~min2~0 .cse2))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-01 15:57:56,278 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 (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0)))) (or (< c_~min3~0 c_~min2~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (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_~min3~0)))) (let ((.cse1 (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 ((.cse2 (< .cse1 c_~min1~0))) (and (or (= c_~min2~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-01 15:57:57,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (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|)) c_~min3~0)) (< c_~min3~0 c_~min2~0)) (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_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)))))) (< 0 ~M~0) (let ((.cse2 (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 ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-01 15:57:58,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (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_~min3~0)) (< c_~min3~0 c_~min2~0)) (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_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min3~0)) (< .cse0 c_~min2~0))))) (let ((.cse2 (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 ((.cse1 (< .cse2 c_~min1~0))) (and (or (not .cse1) (= c_~min2~0 .cse2)) (or (= c_~min2~0 c_~min1~0) .cse1)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-01 15:58:02,152 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:02,152 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-01 15:58:02,176 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:02,176 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-01 15:58:02,202 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:02,203 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-01 15:58:02,254 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-01 15:58:02,274 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 1398 [2022-03-01 15:58:02,297 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 1398 treesize of output 1350 [2022-03-01 15:58:02,318 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 1350 treesize of output 1254 [2022-03-01 15:58:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:58:07,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935327937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:58:07,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:58:07,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 36] total 90 [2022-03-01 15:58:07,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353609537] [2022-03-01 15:58:07,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:58:07,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-03-01 15:58:07,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:58:07,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-03-01 15:58:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=6200, Unknown=13, NotChecked=684, Total=8010 [2022-03-01 15:58:07,362 INFO L87 Difference]: Start difference. First operand 8846 states and 31595 transitions. Second operand has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 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-01 15:58:10,521 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (< 0 ~M~0) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< (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_~min3~0)) (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse1 (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 (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0))))) (let ((.cse3 (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 ((.cse2 (< .cse3 c_~min1~0))) (and (or (not .cse2) (= c_~min2~0 .cse3)) (or (= c_~min2~0 c_~min1~0) .cse2)))) (< (+ ~M~0 1) c_~N~0))))) (and (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) .cse0)) is different from false [2022-03-01 15:58:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:58:31,756 INFO L93 Difference]: Finished difference Result 25499 states and 90238 transitions. [2022-03-01 15:58:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-01 15:58:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 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-01 15:58:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:58:31,832 INFO L225 Difference]: With dead ends: 25499 [2022-03-01 15:58:31,832 INFO L226 Difference]: Without dead ends: 25195 [2022-03-01 15:58:31,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 211 SyntacticMatches, 30 SemanticMatches, 189 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 15223 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=5102, Invalid=29236, Unknown=92, NotChecked=1860, Total=36290 [2022-03-01 15:58:31,837 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 3131 mSDsluCounter, 14766 mSDsCounter, 0 mSdLazyCounter, 4916 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 13460 SdHoareTripleChecker+Invalid, 13378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 4916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8314 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-01 15:58:31,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3131 Valid, 13460 Invalid, 13378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 4916 Invalid, 0 Unknown, 8314 Unchecked, 2.1s Time] [2022-03-01 15:58:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25195 states. [2022-03-01 15:58:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25195 to 12550. [2022-03-01 15:58:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 12549 states have (on average 3.540361781815284) internal successors, (44428), 12549 states have internal predecessors, (44428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:58:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 44428 transitions. [2022-03-01 15:58:32,206 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 44428 transitions. Word has length 126 [2022-03-01 15:58:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:58:32,206 INFO L470 AbstractCegarLoop]: Abstraction has 12550 states and 44428 transitions. [2022-03-01 15:58:32,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7222222222222223) internal successors, (335), 90 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-01 15:58:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 44428 transitions. [2022-03-01 15:58:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:58:32,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:58:32,233 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-01 15:58:32,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-01 15:58:32,450 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-01 15:58:32,450 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:58:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:58:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 610984820, now seen corresponding path program 2 times [2022-03-01 15:58:32,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:58:32,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174324287] [2022-03-01 15:58:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:58:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:58:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:58:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:58:33,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:58:33,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174324287] [2022-03-01 15:58:33,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174324287] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:58:33,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124582190] [2022-03-01 15:58:33,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:58:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:58:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:58:33,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:58:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 15:58:33,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:58:33,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:58:33,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-01 15:58:33,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:58:33,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:58:33,600 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-01 15:58:33,600 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-01 15:58:33,826 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-01 15:58:33,826 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-01 15:58:34,454 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-01 15:58:34,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:58:34,920 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:34,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-03-01 15:58:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:58:35,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:58:36,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:36,699 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 337 treesize of output 297 [2022-03-01 15:58:36,705 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 258 treesize of output 234 [2022-03-01 15:58:36,709 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 234 treesize of output 210 [2022-03-01 15:58:36,713 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 210 treesize of output 198 [2022-03-01 15:58:36,717 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 198 treesize of output 186 [2022-03-01 15:58:38,072 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-01 15:58:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:58:38,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124582190] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:58:38,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:58:38,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 73 [2022-03-01 15:58:38,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225485630] [2022-03-01 15:58:38,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:58:38,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-03-01 15:58:38,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:58:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-03-01 15:58:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=4382, Unknown=8, NotChecked=0, Total=5256 [2022-03-01 15:58:38,154 INFO L87 Difference]: Start difference. First operand 12550 states and 44428 transitions. Second operand has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 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-01 15:58:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:58:52,690 INFO L93 Difference]: Finished difference Result 32910 states and 113910 transitions. [2022-03-01 15:58:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-01 15:58:52,690 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 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-01 15:58:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:58:52,782 INFO L225 Difference]: With dead ends: 32910 [2022-03-01 15:58:52,782 INFO L226 Difference]: Without dead ends: 32864 [2022-03-01 15:58:52,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 219 SyntacticMatches, 11 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20619 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=5648, Invalid=46096, Unknown=12, NotChecked=0, Total=51756 [2022-03-01 15:58:52,786 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 3398 mSDsluCounter, 10882 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 9992 SdHoareTripleChecker+Invalid, 8007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2771 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-01 15:58:52,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3398 Valid, 9992 Invalid, 8007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5101 Invalid, 0 Unknown, 2771 Unchecked, 2.3s Time] [2022-03-01 15:58:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32864 states. [2022-03-01 15:58:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32864 to 13007. [2022-03-01 15:58:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13007 states, 13006 states have (on average 3.5706596955251424) internal successors, (46440), 13006 states have internal predecessors, (46440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:58:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 46440 transitions. [2022-03-01 15:58:53,220 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 46440 transitions. Word has length 126 [2022-03-01 15:58:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:58:53,220 INFO L470 AbstractCegarLoop]: Abstraction has 13007 states and 46440 transitions. [2022-03-01 15:58:53,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 4.589041095890411) internal successors, (335), 73 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-01 15:58:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 46440 transitions. [2022-03-01 15:58:53,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:58:53,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:58:53,252 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-01 15:58:53,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-01 15:58:53,467 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-01 15:58:53,467 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-01 15:58:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:58:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1276119372, now seen corresponding path program 3 times [2022-03-01 15:58:53,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:58:53,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987798271] [2022-03-01 15:58:53,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:58:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:58:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:58:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:58:54,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:58:54,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987798271] [2022-03-01 15:58:54,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987798271] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:58:54,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418123724] [2022-03-01 15:58:54,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 15:58:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:58:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:58:54,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:58:54,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 15:58:54,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-01 15:58:54,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:58:54,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-01 15:58:54,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:58:54,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:58:54,536 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:58:54,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-01 15:58:55,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 15:58:55,411 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-01 15:58:55,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-03-01 15:58:55,892 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:55,892 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 72 treesize of output 48 [2022-03-01 15:58:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:58:56,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:58:58,035 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:58:58,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 419 treesize of output 371 [2022-03-01 15:58:58,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 284 [2022-03-01 15:58:58,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 260 [2022-03-01 15:58:58,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 248 [2022-03-01 15:58:58,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 242 [2022-03-01 15:59:00,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-03-01 15:59:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-01 15:59:00,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418123724] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 15:59:00,340 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 15:59:00,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 30] total 75 [2022-03-01 15:59:00,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423616151] [2022-03-01 15:59:00,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 15:59:00,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-01 15:59:00,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 15:59:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-01 15:59:00,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=4675, Unknown=7, NotChecked=0, Total=5550 [2022-03-01 15:59:00,342 INFO L87 Difference]: Start difference. First operand 13007 states and 46440 transitions. Second operand has 75 states, 75 states have (on average 4.56) internal successors, (342), 75 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:59:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 15:59:34,319 INFO L93 Difference]: Finished difference Result 68194 states and 235145 transitions. [2022-03-01 15:59:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 301 states. [2022-03-01 15:59:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.56) internal successors, (342), 75 states have internal predecessors, (342), 0 states have call successors, (0), 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-01 15:59:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 15:59:34,543 INFO L225 Difference]: With dead ends: 68194 [2022-03-01 15:59:34,544 INFO L226 Difference]: Without dead ends: 67366 [2022-03-01 15:59:34,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 249 SyntacticMatches, 54 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59458 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=14347, Invalid=114875, Unknown=18, NotChecked=0, Total=129240 [2022-03-01 15:59:34,549 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 5991 mSDsluCounter, 20491 mSDsCounter, 0 mSdLazyCounter, 14999 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5991 SdHoareTripleChecker+Valid, 18438 SdHoareTripleChecker+Invalid, 19334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 14999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3887 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-03-01 15:59:34,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5991 Valid, 18438 Invalid, 19334 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [448 Valid, 14999 Invalid, 0 Unknown, 3887 Unchecked, 6.5s Time] [2022-03-01 15:59:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67366 states. [2022-03-01 15:59:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67366 to 18679. [2022-03-01 15:59:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18679 states, 18678 states have (on average 3.662276474997323) internal successors, (68404), 18678 states have internal predecessors, (68404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:59:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18679 states to 18679 states and 68404 transitions. [2022-03-01 15:59:35,560 INFO L78 Accepts]: Start accepts. Automaton has 18679 states and 68404 transitions. Word has length 126 [2022-03-01 15:59:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 15:59:35,560 INFO L470 AbstractCegarLoop]: Abstraction has 18679 states and 68404 transitions. [2022-03-01 15:59:35,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.56) internal successors, (342), 75 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 15:59:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18679 states and 68404 transitions. [2022-03-01 15:59:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-03-01 15:59:35,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 15:59:35,596 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-01 15:59:35,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 15:59:35,811 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-01 15:59:35,812 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-01 15:59:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 15:59:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash 894416540, now seen corresponding path program 2 times [2022-03-01 15:59:35,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 15:59:35,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044672701] [2022-03-01 15:59:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 15:59:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 15:59:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 15:59:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:59:36,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 15:59:36,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044672701] [2022-03-01 15:59:36,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044672701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 15:59:36,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294782851] [2022-03-01 15:59:36,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 15:59:36,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 15:59:36,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 15:59:36,632 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 15:59:36,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 15:59:36,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 15:59:36,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 15:59:36,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-01 15:59:36,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 15:59:36,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:59:36,865 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 15:59:36,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 15:59:37,233 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-01 15:59:37,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-03-01 15:59:37,387 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 11 treesize of output 7 [2022-03-01 15:59:37,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:59:37,857 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-01 15:59:38,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-01 15:59:38,338 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 15:59:38,471 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:59:38,472 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 72 treesize of output 48 [2022-03-01 15:59:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 15:59:38,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 15:59:42,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (and (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or .cse1 (= c_~min1~0 .cse0)) (or (= .cse0 .cse2) (not .cse1))))) (not (< .cse0 c_~min3~0)))))) (or (not (< c_~min3~0 c_~min2~0)) (forall ((v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_324) c_~A~0.base))) (or (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse6 (< .cse5 c_~min1~0))) (and (or (= .cse5 c_~min3~0) (not .cse6)) (or .cse6 (= c_~min1~0 c_~min3~0)))))))))))) is different from false [2022-03-01 15:59:47,826 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 15:59:47,827 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 256 treesize of output 173 [2022-03-01 15:59:47,856 INFO L353 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-03-01 15:59:47,857 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 5365 treesize of output 5155 [2022-03-01 15:59:47,920 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:47,920 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 5136 treesize of output 5061 [2022-03-01 15:59:47,981 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:47,982 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 5056 treesize of output 4677 [2022-03-01 15:59:48,042 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:48,042 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 4672 treesize of output 4485 [2022-03-01 15:59:48,103 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:48,104 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 4480 treesize of output 4389 [2022-03-01 15:59:48,164 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:48,165 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 4384 treesize of output 4349 [2022-03-01 15:59:48,231 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-01 15:59:48,232 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 4344 treesize of output 4189 [2022-03-01 15:59:48,297 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-01 15:59:48,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-01 15:59:48,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-01 15:59:48,498 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-01 15:59:48,500 INFO L158 Benchmark]: Toolchain (without parser) took 148903.25ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 899.7MB). Free memory was 131.8MB in the beginning and 625.4MB in the end (delta: -493.6MB). Peak memory consumption was 742.1MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,500 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 15:59:48,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.33ms. Allocated memory was 188.7MB in the beginning and 233.8MB in the end (delta: 45.1MB). Free memory was 131.6MB in the beginning and 203.4MB in the end (delta: -71.7MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 233.8MB. Free memory was 203.4MB in the beginning and 201.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,501 INFO L158 Benchmark]: Boogie Preprocessor took 21.77ms. Allocated memory is still 233.8MB. Free memory was 201.8MB in the beginning and 200.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,501 INFO L158 Benchmark]: RCFGBuilder took 381.75ms. Allocated memory is still 233.8MB. Free memory was 200.2MB in the beginning and 181.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,501 INFO L158 Benchmark]: TraceAbstraction took 148287.90ms. Allocated memory was 233.8MB in the beginning and 1.1GB in the end (delta: 854.6MB). Free memory was 180.8MB in the beginning and 625.4MB in the end (delta: -444.6MB). Peak memory consumption was 746.6MB. Max. memory is 8.0GB. [2022-03-01 15:59:48,502 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.33ms. Allocated memory was 188.7MB in the beginning and 233.8MB in the end (delta: 45.1MB). Free memory was 131.6MB in the beginning and 203.4MB in the end (delta: -71.7MB). Peak memory consumption was 8.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 233.8MB. Free memory was 203.4MB in the beginning and 201.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.77ms. Allocated memory is still 233.8MB. Free memory was 201.8MB in the beginning and 200.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 381.75ms. Allocated memory is still 233.8MB. Free memory was 200.2MB in the beginning and 181.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 148287.90ms. Allocated memory was 233.8MB in the beginning and 1.1GB in the end (delta: 854.6MB). Free memory was 180.8MB in the beginning and 625.4MB in the end (delta: -444.6MB). Peak memory consumption was 746.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-01 15:59:48,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...