/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.abstract-por-f0ea240 [2022-02-10 22:52:21,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 22:52:21,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 22:52:21,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 22:52:21,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 22:52:21,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 22:52:21,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 22:52:21,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 22:52:21,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 22:52:21,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 22:52:21,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 22:52:21,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 22:52:21,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 22:52:21,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 22:52:21,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 22:52:21,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 22:52:21,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 22:52:21,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 22:52:21,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 22:52:21,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 22:52:21,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 22:52:21,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 22:52:21,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 22:52:21,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 22:52:21,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 22:52:21,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 22:52:21,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 22:52:21,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 22:52:21,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 22:52:21,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 22:52:21,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 22:52:21,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 22:52:21,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 22:52:21,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 22:52:21,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 22:52:21,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 22:52:21,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 22:52:21,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 22:52:21,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 22:52:21,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 22:52:21,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 22:52:21,198 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-02-10 22:52:21,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 22:52:21,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 22:52:21,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 22:52:21,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 22:52:21,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 22:52:21,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 22:52:21,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 22:52:21,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 22:52:21,225 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 22:52:21,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 22:52:21,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 22:52:21,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 22:52:21,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 22:52:21,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 22:52:21,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 22:52:21,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 22:52:21,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 22:52:21,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 22:52:21,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 22:52:21,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 22:52:21,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 22:52:21,229 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 22:52:21,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 22:52:21,229 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-02-10 22:52:21,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 22:52:21,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 22:52:21,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 22:52:21,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 22:52:21,417 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 22:52:21,418 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-02-10 22:52:21,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2204be23/5a45a787f20a4655aef40aaa6c3d76b9/FLAG0f12ada74 [2022-02-10 22:52:21,829 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 22:52:21,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-02-10 22:52:21,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2204be23/5a45a787f20a4655aef40aaa6c3d76b9/FLAG0f12ada74 [2022-02-10 22:52:21,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2204be23/5a45a787f20a4655aef40aaa6c3d76b9 [2022-02-10 22:52:21,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 22:52:21,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 22:52:21,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 22:52:21,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 22:52:21,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 22:52:21,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:52:21" (1/1) ... [2022-02-10 22:52:21,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bb1d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:21, skipping insertion in model container [2022-02-10 22:52:21,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:52:21" (1/1) ... [2022-02-10 22:52:21,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 22:52:21,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 22:52:22,071 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-02-10 22:52:22,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 22:52:22,083 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 22:52:22,114 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-02-10 22:52:22,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 22:52:22,125 INFO L208 MainTranslator]: Completed translation [2022-02-10 22:52:22,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22 WrapperNode [2022-02-10 22:52:22,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 22:52:22,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 22:52:22,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 22:52:22,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 22:52:22,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,164 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-02-10 22:52:22,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 22:52:22,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 22:52:22,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 22:52:22,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 22:52:22,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 22:52:22,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 22:52:22,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 22:52:22,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 22:52:22,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (1/1) ... [2022-02-10 22:52:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 22:52:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:22,220 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-02-10 22:52:22,226 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-02-10 22:52:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 22:52:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-10 22:52:22,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-10 22:52:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-10 22:52:22,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-10 22:52:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-10 22:52:22,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 22:52:22,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 22:52:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 22:52:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 22:52:22,249 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 22:52:22,374 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 22:52:22,375 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 22:52:22,592 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 22:52:22,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 22:52:22,634 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-10 22:52:22,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:52:22 BoogieIcfgContainer [2022-02-10 22:52:22,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 22:52:22,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 22:52:22,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 22:52:22,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 22:52:22,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 10:52:21" (1/3) ... [2022-02-10 22:52:22,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604c20ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:52:22, skipping insertion in model container [2022-02-10 22:52:22,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:52:22" (2/3) ... [2022-02-10 22:52:22,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604c20ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:52:22, skipping insertion in model container [2022-02-10 22:52:22,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:52:22" (3/3) ... [2022-02-10 22:52:22,646 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-02-10 22:52:22,649 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 22:52:22,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 22:52:22,650 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 22:52:22,650 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 22:52:22,699 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,700 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,700 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,700 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,701 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,701 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,702 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,703 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,703 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,703 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,703 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,703 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,704 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,704 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,704 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,704 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,705 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,706 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,707 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,708 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,708 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,708 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,708 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,709 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,709 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,709 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,709 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,710 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,711 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,711 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,711 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,711 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,711 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,712 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,712 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,712 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,712 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,712 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,717 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,718 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,719 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,720 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,720 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,720 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,720 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,720 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,721 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,721 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,721 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,725 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,726 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,726 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,728 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,732 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,732 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,733 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,734 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,734 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,734 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,734 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,735 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:52:22,739 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-10 22:52:22,784 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 22:52:22,789 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, 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 [2022-02-10 22:52:22,789 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-10 22:52:22,801 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 159 transitions, 342 flow [2022-02-10 22:52:22,985 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-02-10 22:52:23,000 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-02-10 22:52:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-10 22:52:23,033 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:23,034 INFO L515 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-02-10 22:52:23,035 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1987118534, now seen corresponding path program 1 times [2022-02-10 22:52:23,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:23,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735404398] [2022-02-10 22:52:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:23,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:23,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735404398] [2022-02-10 22:52:23,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735404398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:52:23,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:52:23,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 22:52:23,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013280794] [2022-02-10 22:52:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:23,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 22:52:23,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:23,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 22:52:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 22:52:23,271 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-02-10 22:52:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:23,355 INFO L93 Difference]: Finished difference Result 3813 states and 13373 transitions. [2022-02-10 22:52:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 22:52:23,357 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-02-10 22:52:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:23,396 INFO L225 Difference]: With dead ends: 3813 [2022-02-10 22:52:23,396 INFO L226 Difference]: Without dead ends: 3809 [2022-02-10 22:52:23,397 INFO L933 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-02-10 22:52:23,400 INFO L934 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-02-10 22:52:23,400 INFO L935 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-02-10 22:52:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-02-10 22:52:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3809. [2022-02-10 22:52:23,595 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-02-10 22:52:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 13369 transitions. [2022-02-10 22:52:23,611 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 13369 transitions. Word has length 109 [2022-02-10 22:52:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:23,612 INFO L470 AbstractCegarLoop]: Abstraction has 3809 states and 13369 transitions. [2022-02-10 22:52:23,612 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-02-10 22:52:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 13369 transitions. [2022-02-10 22:52:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-10 22:52:23,623 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:23,623 INFO L515 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-02-10 22:52:23,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 22:52:23,624 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 669998521, now seen corresponding path program 1 times [2022-02-10 22:52:23,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:23,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315803421] [2022-02-10 22:52:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:23,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:23,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315803421] [2022-02-10 22:52:23,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315803421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:52:23,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:52:23,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-10 22:52:23,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470988472] [2022-02-10 22:52:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:23,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-10 22:52:23,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-10 22:52:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-10 22:52:23,866 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-02-10 22:52:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:23,968 INFO L93 Difference]: Finished difference Result 7071 states and 25089 transitions. [2022-02-10 22:52:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-10 22:52:23,969 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-02-10 22:52:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:24,004 INFO L225 Difference]: With dead ends: 7071 [2022-02-10 22:52:24,004 INFO L226 Difference]: Without dead ends: 7071 [2022-02-10 22:52:24,007 INFO L933 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-02-10 22:52:24,008 INFO L934 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-02-10 22:52:24,008 INFO L935 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-02-10 22:52:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2022-02-10 22:52:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 4978. [2022-02-10 22:52:24,192 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-02-10 22:52:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 17506 transitions. [2022-02-10 22:52:24,209 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 17506 transitions. Word has length 109 [2022-02-10 22:52:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:24,211 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 17506 transitions. [2022-02-10 22:52:24,211 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-02-10 22:52:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 17506 transitions. [2022-02-10 22:52:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-10 22:52:24,225 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:24,225 INFO L515 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-02-10 22:52:24,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 22:52:24,225 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 62354435, now seen corresponding path program 1 times [2022-02-10 22:52:24,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:24,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590552531] [2022-02-10 22:52:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:24,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:24,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590552531] [2022-02-10 22:52:24,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590552531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:52:24,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:52:24,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 22:52:24,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645058107] [2022-02-10 22:52:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:24,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 22:52:24,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 22:52:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-10 22:52:24,529 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-02-10 22:52:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:24,679 INFO L93 Difference]: Finished difference Result 4994 states and 17522 transitions. [2022-02-10 22:52:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-10 22:52:24,680 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-02-10 22:52:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:24,703 INFO L225 Difference]: With dead ends: 4994 [2022-02-10 22:52:24,703 INFO L226 Difference]: Without dead ends: 4984 [2022-02-10 22:52:24,703 INFO L933 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-02-10 22:52:24,704 INFO L934 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-02-10 22:52:24,705 INFO L935 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-02-10 22:52:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2022-02-10 22:52:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4979. [2022-02-10 22:52:24,808 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-02-10 22:52:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 17507 transitions. [2022-02-10 22:52:24,882 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 17507 transitions. Word has length 109 [2022-02-10 22:52:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:24,882 INFO L470 AbstractCegarLoop]: Abstraction has 4979 states and 17507 transitions. [2022-02-10 22:52:24,882 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-02-10 22:52:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 17507 transitions. [2022-02-10 22:52:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-10 22:52:24,894 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:24,894 INFO L515 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-02-10 22:52:24,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 22:52:24,894 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 629906956, now seen corresponding path program 1 times [2022-02-10 22:52:24,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:24,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183099179] [2022-02-10 22:52:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:25,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:25,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183099179] [2022-02-10 22:52:25,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183099179] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:25,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054030100] [2022-02-10 22:52:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:25,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:52:25,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:25,036 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-02-10 22:52:25,037 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-02-10 22:52:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:25,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-10 22:52:25,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:52:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:25,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:52:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:25,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054030100] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:25,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-10 22:52:25,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-10 22:52:25,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906040695] [2022-02-10 22:52:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:25,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 22:52:25,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 22:52:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-10 22:52:25,609 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-02-10 22:52:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:25,701 INFO L93 Difference]: Finished difference Result 5483 states and 19328 transitions. [2022-02-10 22:52:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 22:52:25,702 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-02-10 22:52:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:25,717 INFO L225 Difference]: With dead ends: 5483 [2022-02-10 22:52:25,717 INFO L226 Difference]: Without dead ends: 5483 [2022-02-10 22:52:25,717 INFO L933 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-02-10 22:52:25,718 INFO L934 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-02-10 22:52:25,718 INFO L935 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-02-10 22:52:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2022-02-10 22:52:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2022-02-10 22:52:25,825 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-02-10 22:52:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 19328 transitions. [2022-02-10 22:52:25,839 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 19328 transitions. Word has length 116 [2022-02-10 22:52:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:25,840 INFO L470 AbstractCegarLoop]: Abstraction has 5483 states and 19328 transitions. [2022-02-10 22:52:25,840 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-02-10 22:52:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 19328 transitions. [2022-02-10 22:52:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-10 22:52:25,852 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:25,853 INFO L515 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-02-10 22:52:25,872 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-02-10 22:52:26,067 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-02-10 22:52:26,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 310973555, now seen corresponding path program 1 times [2022-02-10 22:52:26,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:26,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765275027] [2022-02-10 22:52:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:52:26,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:26,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765275027] [2022-02-10 22:52:26,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765275027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:26,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101852402] [2022-02-10 22:52:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:26,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:52:26,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:26,161 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-02-10 22:52:26,162 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-02-10 22:52:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:26,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 22:52:26,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:52:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:52:26,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:52:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:52:26,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101852402] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:26,812 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-10 22:52:26,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-02-10 22:52:26,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629419850] [2022-02-10 22:52:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:26,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 22:52:26,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:26,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 22:52:26,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-10 22:52:26,813 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-02-10 22:52:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:27,034 INFO L93 Difference]: Finished difference Result 8369 states and 29751 transitions. [2022-02-10 22:52:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 22:52:27,035 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-02-10 22:52:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:27,065 INFO L225 Difference]: With dead ends: 8369 [2022-02-10 22:52:27,065 INFO L226 Difference]: Without dead ends: 8369 [2022-02-10 22:52:27,066 INFO L933 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-02-10 22:52:27,066 INFO L934 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-02-10 22:52:27,067 INFO L935 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-02-10 22:52:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8369 states. [2022-02-10 22:52:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8369 to 5615. [2022-02-10 22:52:27,213 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-02-10 22:52:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 19768 transitions. [2022-02-10 22:52:27,232 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 19768 transitions. Word has length 121 [2022-02-10 22:52:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:27,233 INFO L470 AbstractCegarLoop]: Abstraction has 5615 states and 19768 transitions. [2022-02-10 22:52:27,233 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-02-10 22:52:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 19768 transitions. [2022-02-10 22:52:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-10 22:52:27,247 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:27,247 INFO L515 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-02-10 22:52:27,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 22:52:27,463 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-02-10 22:52:27,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1142457735, now seen corresponding path program 2 times [2022-02-10 22:52:27,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:27,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116724523] [2022-02-10 22:52:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:52:27,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:27,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116724523] [2022-02-10 22:52:27,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116724523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:27,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310171446] [2022-02-10 22:52:27,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:52:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:52:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:27,612 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-02-10 22:52:27,613 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-02-10 22:52:27,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 22:52:27,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:52:27,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-10 22:52:27,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:52:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:52:28,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 22:52:28,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310171446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:52:28,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 22:52:28,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-02-10 22:52:28,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627060995] [2022-02-10 22:52:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:52:28,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 22:52:28,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 22:52:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-10 22:52:28,037 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-02-10 22:52:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:28,195 INFO L93 Difference]: Finished difference Result 5306 states and 18640 transitions. [2022-02-10 22:52:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-10 22:52:28,196 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-02-10 22:52:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:28,211 INFO L225 Difference]: With dead ends: 5306 [2022-02-10 22:52:28,211 INFO L226 Difference]: Without dead ends: 5306 [2022-02-10 22:52:28,211 INFO L933 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-02-10 22:52:28,213 INFO L934 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.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:52:28,214 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 412 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:52:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2022-02-10 22:52:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 4584. [2022-02-10 22:52:28,299 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-02-10 22:52:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 16196 transitions. [2022-02-10 22:52:28,316 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 16196 transitions. Word has length 121 [2022-02-10 22:52:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:28,317 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 16196 transitions. [2022-02-10 22:52:28,317 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-02-10 22:52:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 16196 transitions. [2022-02-10 22:52:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-10 22:52:28,326 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:28,326 INFO L515 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-02-10 22:52:28,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-10 22:52:28,539 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-02-10 22:52:28,539 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1101298630, now seen corresponding path program 1 times [2022-02-10 22:52:28,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:28,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701333435] [2022-02-10 22:52:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:29,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:29,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701333435] [2022-02-10 22:52:29,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701333435] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:29,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236685044] [2022-02-10 22:52:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:29,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:52:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:29,502 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-02-10 22:52:29,511 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-02-10 22:52:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:29,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-10 22:52:29,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:52:29,702 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-02-10 22:52:29,742 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 22:52:29,742 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-02-10 22:52:30,213 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:52:30,214 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-02-10 22:52:31,644 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-02-10 22:52:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:52:31,914 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-02-10 22:52:32,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:52:32,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:52:32,142 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-02-10 22:52:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:32,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:52:32,662 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-02-10 22:52:32,820 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-02-10 22:52:32,947 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:52:32,947 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-02-10 22:52:32,952 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-02-10 22:52:32,956 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-02-10 22:52:32,960 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-02-10 22:52:32,964 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-02-10 22:52:36,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:52:36,399 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-02-10 22:52:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-10 22:52:36,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236685044] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:52:36,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:52:36,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 85 [2022-02-10 22:52:36,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781817433] [2022-02-10 22:52:36,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:52:36,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-02-10 22:52:36,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:52:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-02-10 22:52:36,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5999, Unknown=2, NotChecked=326, Total=7140 [2022-02-10 22:52:36,570 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-02-10 22:52:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:52:42,764 INFO L93 Difference]: Finished difference Result 23682 states and 83992 transitions. [2022-02-10 22:52:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-10 22:52:42,765 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-02-10 22:52:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:52:42,833 INFO L225 Difference]: With dead ends: 23682 [2022-02-10 22:52:42,833 INFO L226 Difference]: Without dead ends: 23652 [2022-02-10 22:52:42,837 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7755 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2840, Invalid=19515, Unknown=3, NotChecked=594, Total=22952 [2022-02-10 22:52:42,838 INFO L934 BasicCegarLoop]: 161 mSDtfsCounter, 3378 mSDsluCounter, 6761 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3378 SdHoareTripleChecker+Valid, 6303 SdHoareTripleChecker+Invalid, 5632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1759 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:52:42,838 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3378 Valid, 6303 Invalid, 5632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3711 Invalid, 0 Unknown, 1759 Unchecked, 1.6s Time] [2022-02-10 22:52:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2022-02-10 22:52:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 8846. [2022-02-10 22:52:43,088 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-02-10 22:52:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8846 states to 8846 states and 31595 transitions. [2022-02-10 22:52:43,110 INFO L78 Accepts]: Start accepts. Automaton has 8846 states and 31595 transitions. Word has length 126 [2022-02-10 22:52:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:52:43,111 INFO L470 AbstractCegarLoop]: Abstraction has 8846 states and 31595 transitions. [2022-02-10 22:52:43,111 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-02-10 22:52:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 8846 states and 31595 transitions. [2022-02-10 22:52:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-10 22:52:43,128 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:52:43,128 INFO L515 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-02-10 22:52:43,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-10 22:52:43,345 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-02-10 22:52:43,345 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:52:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:52:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 493654544, now seen corresponding path program 1 times [2022-02-10 22:52:43,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:52:43,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189794973] [2022-02-10 22:52:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:52:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:44,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:52:44,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189794973] [2022-02-10 22:52:44,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189794973] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:52:44,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637208479] [2022-02-10 22:52:44,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:52:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:52:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:52:44,252 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-02-10 22:52:44,253 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-02-10 22:52:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:52:44,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-10 22:52:44,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:52:44,386 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-02-10 22:52:44,434 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 22:52:44,434 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-02-10 22:52:44,490 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 22:52:44,490 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-02-10 22:52:45,069 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:52:45,070 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-02-10 22:52:45,329 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-02-10 22:52:45,936 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-02-10 22:52:46,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:52:46,341 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-02-10 22:52:46,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:52:46,682 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-02-10 22:52:46,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:52:46,909 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-02-10 22:52:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:52:47,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:52:49,939 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-02-10 22:52:58,512 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-02-10 22:52:59,442 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-02-10 22:52:59,934 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-02-10 22:53:04,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:04,954 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-02-10 22:53:04,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:04,974 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-02-10 22:53:04,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:04,993 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-02-10 22:53:05,015 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-02-10 22:53:05,028 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-02-10 22:53:05,041 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-02-10 22:53:05,055 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-02-10 22:53:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:53:09,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637208479] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:53:09,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:53:09,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 36] total 90 [2022-02-10 22:53:09,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713632703] [2022-02-10 22:53:09,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:53:09,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-02-10 22:53:09,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:53:09,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-02-10 22:53:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=6196, Unknown=17, NotChecked=684, Total=8010 [2022-02-10 22:53:09,975 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-02-10 22:53:13,297 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-02-10 22:53:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:53:37,661 INFO L93 Difference]: Finished difference Result 25483 states and 90196 transitions. [2022-02-10 22:53:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-02-10 22:53:37,661 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-02-10 22:53:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:53:37,830 INFO L225 Difference]: With dead ends: 25483 [2022-02-10 22:53:37,831 INFO L226 Difference]: Without dead ends: 25179 [2022-02-10 22:53:37,851 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 211 SyntacticMatches, 33 SemanticMatches, 185 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 14990 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=4948, Invalid=27939, Unknown=75, NotChecked=1820, Total=34782 [2022-02-10 22:53:37,852 INFO L934 BasicCegarLoop]: 391 mSDtfsCounter, 3130 mSDsluCounter, 14875 mSDsCounter, 0 mSdLazyCounter, 4926 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3130 SdHoareTripleChecker+Valid, 13481 SdHoareTripleChecker+Invalid, 13504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 4926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8431 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:53:37,852 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3130 Valid, 13481 Invalid, 13504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 4926 Invalid, 0 Unknown, 8431 Unchecked, 2.2s Time] [2022-02-10 22:53:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25179 states. [2022-02-10 22:53:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25179 to 12550. [2022-02-10 22:53:38,247 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-02-10 22:53:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 44428 transitions. [2022-02-10 22:53:38,281 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 44428 transitions. Word has length 126 [2022-02-10 22:53:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:53:38,281 INFO L470 AbstractCegarLoop]: Abstraction has 12550 states and 44428 transitions. [2022-02-10 22:53:38,281 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-02-10 22:53:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 44428 transitions. [2022-02-10 22:53:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-10 22:53:38,308 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:53:38,308 INFO L515 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-02-10 22:53:38,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-10 22:53:38,525 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-02-10 22:53:38,525 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:53:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:53:38,525 INFO L85 PathProgramCache]: Analyzing trace with hash 610984820, now seen corresponding path program 2 times [2022-02-10 22:53:38,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:53:38,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435760732] [2022-02-10 22:53:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:53:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:53:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:53:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:53:39,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:53:39,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435760732] [2022-02-10 22:53:39,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435760732] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:53:39,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269709807] [2022-02-10 22:53:39,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:53:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:53:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:53:39,411 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-02-10 22:53:39,412 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-02-10 22:53:39,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:53:39,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:53:39,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-10 22:53:39,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:53:39,556 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-02-10 22:53:39,594 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 22:53:39,594 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-02-10 22:53:39,846 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-10 22:53:39,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-02-10 22:53:40,552 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-02-10 22:53:40,859 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-02-10 22:53:41,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:41,095 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-02-10 22:53:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:53:41,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:53:42,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:42,935 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-02-10 22:53:42,940 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-02-10 22:53:42,945 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-02-10 22:53:42,949 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-02-10 22:53:42,954 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-02-10 22:53:44,416 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-02-10 22:53:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:53:44,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269709807] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:53:44,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:53:44,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 73 [2022-02-10 22:53:44,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693887410] [2022-02-10 22:53:44,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:53:44,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-02-10 22:53:44,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:53:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-02-10 22:53:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=4382, Unknown=8, NotChecked=0, Total=5256 [2022-02-10 22:53:44,493 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-02-10 22:53:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:53:51,825 INFO L93 Difference]: Finished difference Result 28368 states and 99557 transitions. [2022-02-10 22:53:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-02-10 22:53:51,826 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-02-10 22:53:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:53:51,931 INFO L225 Difference]: With dead ends: 28368 [2022-02-10 22:53:51,931 INFO L226 Difference]: Without dead ends: 28345 [2022-02-10 22:53:51,932 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8514 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3485, Invalid=21628, Unknown=9, NotChecked=0, Total=25122 [2022-02-10 22:53:51,934 INFO L934 BasicCegarLoop]: 306 mSDtfsCounter, 3076 mSDsluCounter, 9102 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3076 SdHoareTripleChecker+Valid, 8640 SdHoareTripleChecker+Invalid, 6429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1978 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-10 22:53:51,934 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3076 Valid, 8640 Invalid, 6429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 4293 Invalid, 0 Unknown, 1978 Unchecked, 1.9s Time] [2022-02-10 22:53:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28345 states. [2022-02-10 22:53:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28345 to 13994. [2022-02-10 22:53:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13994 states, 13993 states have (on average 3.5457014221396412) internal successors, (49615), 13993 states have internal predecessors, (49615), 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-02-10 22:53:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 49615 transitions. [2022-02-10 22:53:52,329 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 49615 transitions. Word has length 126 [2022-02-10 22:53:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:53:52,329 INFO L470 AbstractCegarLoop]: Abstraction has 13994 states and 49615 transitions. [2022-02-10 22:53:52,329 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-02-10 22:53:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 49615 transitions. [2022-02-10 22:53:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-10 22:53:52,357 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:53:52,357 INFO L515 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-02-10 22:53:52,373 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-02-10 22:53:52,570 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-02-10 22:53:52,571 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:53:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:53:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1799420520, now seen corresponding path program 3 times [2022-02-10 22:53:52,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:53:52,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032562887] [2022-02-10 22:53:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:53:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:53:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:53:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:53:53,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:53:53,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032562887] [2022-02-10 22:53:53,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032562887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:53:53,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353115729] [2022-02-10 22:53:53,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:53:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:53:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:53:53,486 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-02-10 22:53:53,487 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-02-10 22:53:53,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:53:53,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:53:53,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-10 22:53:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:53:53,648 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-02-10 22:53:53,891 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:53:53,891 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-02-10 22:53:54,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:53:54,620 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-02-10 22:53:54,839 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-02-10 22:53:55,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:55,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-02-10 22:53:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:53:55,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:53:56,452 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:53:56,452 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-02-10 22:53:56,458 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 320 [2022-02-10 22:53:56,463 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 320 treesize of output 314 [2022-02-10 22:53:56,467 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 314 treesize of output 290 [2022-02-10 22:53:56,472 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 290 treesize of output 242 [2022-02-10 22:53:57,972 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-02-10 22:53:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:53:58,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353115729] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:53:58,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:53:58,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 72 [2022-02-10 22:53:58,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671638103] [2022-02-10 22:53:58,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:53:58,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-02-10 22:53:58,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:53:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-02-10 22:53:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=4133, Unknown=6, NotChecked=0, Total=5112 [2022-02-10 22:53:58,085 INFO L87 Difference]: Start difference. First operand 13994 states and 49615 transitions. Second operand has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 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-02-10 22:54:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:54:08,877 INFO L93 Difference]: Finished difference Result 30614 states and 107459 transitions. [2022-02-10 22:54:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-02-10 22:54:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 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-02-10 22:54:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:54:08,970 INFO L225 Difference]: With dead ends: 30614 [2022-02-10 22:54:08,970 INFO L226 Difference]: Without dead ends: 30563 [2022-02-10 22:54:08,973 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13125 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=4996, Invalid=30905, Unknown=9, NotChecked=0, Total=35910 [2022-02-10 22:54:08,974 INFO L934 BasicCegarLoop]: 328 mSDtfsCounter, 3122 mSDsluCounter, 10272 mSDsCounter, 0 mSdLazyCounter, 5538 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3122 SdHoareTripleChecker+Valid, 9579 SdHoareTripleChecker+Invalid, 7731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 5538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2047 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:54:08,975 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3122 Valid, 9579 Invalid, 7731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 5538 Invalid, 0 Unknown, 2047 Unchecked, 2.5s Time] [2022-02-10 22:54:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30563 states. [2022-02-10 22:54:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30563 to 11764. [2022-02-10 22:54:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11764 states, 11763 states have (on average 3.573153107200544) internal successors, (42031), 11763 states have internal predecessors, (42031), 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-02-10 22:54:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 42031 transitions. [2022-02-10 22:54:09,368 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 42031 transitions. Word has length 126 [2022-02-10 22:54:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:54:09,368 INFO L470 AbstractCegarLoop]: Abstraction has 11764 states and 42031 transitions. [2022-02-10 22:54:09,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.625) internal successors, (333), 72 states have internal predecessors, (333), 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-02-10 22:54:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 42031 transitions. [2022-02-10 22:54:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-10 22:54:09,389 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:54:09,389 INFO L515 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-02-10 22:54:09,405 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-02-10 22:54:09,603 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-02-10 22:54:09,603 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-10 22:54:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:54:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash 894416540, now seen corresponding path program 2 times [2022-02-10 22:54:09,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:54:09,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884063346] [2022-02-10 22:54:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:54:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:54:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:54:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:54:10,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:54:10,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884063346] [2022-02-10 22:54:10,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884063346] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:54:10,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067755767] [2022-02-10 22:54:10,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:54:10,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:54:10,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:54:10,184 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-02-10 22:54:10,185 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-02-10 22:54:10,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:54:10,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:54:10,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-10 22:54:10,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:54:10,374 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-02-10 22:54:10,412 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 22:54:10,412 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-02-10 22:54:10,738 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:54:10,738 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-02-10 22:54:10,877 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-02-10 22:54:11,153 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-02-10 22:54:11,327 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-02-10 22:54:11,537 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-02-10 22:54:11,785 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:54:11,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:54:11,903 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-02-10 22:54:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:54:12,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:54:14,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |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_~min3~0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (< .cse2 c_~min1~0))) (and (or (= c_~min1~0 .cse0) .cse1) (or (not .cse1) (= .cse0 .cse2))))) (not (< .cse0 c_~min2~0)))))) (or (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |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 ((.cse6 (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse5 (< .cse6 c_~min1~0))) (and (or (not .cse5) (= c_~min3~0 .cse6)) (or .cse5 (= c_~min1~0 c_~min3~0)))))))) (not (< c_~min3~0 c_~min2~0)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-02-10 22:54:21,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:54:21,645 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-02-10 22:54:21,676 INFO L353 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-02-10 22:54:21,676 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-02-10 22:54:21,776 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:21,777 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-02-10 22:54:21,837 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:21,837 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-02-10 22:54:21,896 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:21,897 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-02-10 22:54:21,955 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:21,956 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-02-10 22:54:22,014 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:22,014 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-02-10 22:54:22,072 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-02-10 22:54:22,073 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-02-10 22:54:22,136 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-10 22:54:22,154 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-02-10 22:54:22,351 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-02-10 22:54:22,352 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:611) 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:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:308) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-02-10 22:54:22,355 INFO L158 Benchmark]: Toolchain (without parser) took 120503.19ms. Allocated memory was 196.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 139.9MB in the beginning and 554.1MB in the end (delta: -414.2MB). Peak memory consumption was 902.2MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,355 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 22:54:22,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.08ms. Allocated memory was 196.1MB in the beginning and 297.8MB in the end (delta: 101.7MB). Free memory was 139.7MB in the beginning and 267.1MB in the end (delta: -127.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 265.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,356 INFO L158 Benchmark]: Boogie Preprocessor took 30.34ms. Allocated memory is still 297.8MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,356 INFO L158 Benchmark]: RCFGBuilder took 443.44ms. Allocated memory is still 297.8MB. Free memory was 263.4MB in the beginning and 243.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,356 INFO L158 Benchmark]: TraceAbstraction took 119714.25ms. Allocated memory was 297.8MB in the beginning and 1.3GB in the end (delta: 981.5MB). Free memory was 243.0MB in the beginning and 554.1MB in the end (delta: -311.1MB). Peak memory consumption was 903.3MB. Max. memory is 8.0GB. [2022-02-10 22:54:22,357 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 196.1MB. Free memory is still 156.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.08ms. Allocated memory was 196.1MB in the beginning and 297.8MB in the end (delta: 101.7MB). Free memory was 139.7MB in the beginning and 267.1MB in the end (delta: -127.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 297.8MB. Free memory was 267.1MB in the beginning and 265.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.34ms. Allocated memory is still 297.8MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 443.44ms. Allocated memory is still 297.8MB. Free memory was 263.4MB in the beginning and 243.5MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 119714.25ms. Allocated memory was 297.8MB in the beginning and 1.3GB in the end (delta: 981.5MB). Free memory was 243.0MB in the beginning and 554.1MB in the end (delta: -311.1MB). Peak memory consumption was 903.3MB. 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-02-10 22:54:22,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...