./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:52:57,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:52:57,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:52:57,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:52:57,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:52:57,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:52:57,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:52:57,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:52:57,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:52:57,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:52:57,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:52:57,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:52:57,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:52:57,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:52:57,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:52:57,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:52:57,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:52:57,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:52:57,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:52:57,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:52:57,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:52:57,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:52:57,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:52:57,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:52:57,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:52:57,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:52:57,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:52:57,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:52:57,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:52:57,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:52:57,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:52:57,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:52:57,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:52:57,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:52:57,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:52:57,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:52:57,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:52:57,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:52:57,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:52:57,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:52:57,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:52:57,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:52:57,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:52:57,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:52:57,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:52:57,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:52:57,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:52:57,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:52:57,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:52:57,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:52:57,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:52:57,078 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:52:57,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:52:57,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:52:57,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:52:57,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:52:57,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:52:57,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:52:57,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:52:57,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:52:57,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:52:57,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:52:57,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:52:57,083 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 [2022-07-13 10:52:57,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:52:57,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:52:57,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:52:57,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:52:57,304 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:52:57,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-13 10:52:57,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8d98f1c/13ab974a3ad7473299df11697ac331b8/FLAGc8e13f337 [2022-07-13 10:52:57,666 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:52:57,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-13 10:52:57,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8d98f1c/13ab974a3ad7473299df11697ac331b8/FLAGc8e13f337 [2022-07-13 10:52:58,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8d98f1c/13ab974a3ad7473299df11697ac331b8 [2022-07-13 10:52:58,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:52:58,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:52:58,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:52:58,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:52:58,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:52:58,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152e880d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58, skipping insertion in model container [2022-07-13 10:52:58,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:52:58,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:52:58,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-13 10:52:58,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:52:58,258 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:52:58,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-13 10:52:58,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:52:58,285 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:52:58,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58 WrapperNode [2022-07-13 10:52:58,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:52:58,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:52:58,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:52:58,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:52:58,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,308 INFO L137 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-13 10:52:58,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:52:58,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:52:58,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:52:58,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:52:58,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:52:58,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:52:58,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:52:58,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:52:58,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (1/1) ... [2022-07-13 10:52:58,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:52:58,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:52:58,355 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-07-13 10:52:58,357 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-07-13 10:52:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:52:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 10:52:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 10:52:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:52:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:52:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:52:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:52:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:52:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:52:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:52:58,426 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:52:58,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:52:58,592 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:52:58,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:52:58,602 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:52:58,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:52:58 BoogieIcfgContainer [2022-07-13 10:52:58,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:52:58,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:52:58,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:52:58,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:52:58,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:52:58" (1/3) ... [2022-07-13 10:52:58,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ba5afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:52:58, skipping insertion in model container [2022-07-13 10:52:58,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:58" (2/3) ... [2022-07-13 10:52:58,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ba5afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:52:58, skipping insertion in model container [2022-07-13 10:52:58,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:52:58" (3/3) ... [2022-07-13 10:52:58,612 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2022-07-13 10:52:58,622 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:52:58,622 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:52:58,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:52:58,662 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15fc986b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f48884a [2022-07-13 10:52:58,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:52:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:52:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 10:52:58,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:52:58,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:52:58,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:52:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:52:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1607472667, now seen corresponding path program 1 times [2022-07-13 10:52:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:52:58,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563359422] [2022-07-13 10:52:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:52:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:52:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:52:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:52:58,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563359422] [2022-07-13 10:52:58,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563359422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:52:58,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:52:58,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:52:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144123316] [2022-07-13 10:52:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:52:58,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:52:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:52:58,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:52:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:52:58,862 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-13 10:52:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:52:58,880 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-07-13 10:52:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:52:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-13 10:52:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:52:58,887 INFO L225 Difference]: With dead ends: 50 [2022-07-13 10:52:58,887 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 10:52:58,892 INFO L412 NwaCegarLoop]: 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-07-13 10:52:58,894 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:52:58,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:52:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 10:52:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-13 10:52:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:52:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 10:52:58,921 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2022-07-13 10:52:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:52:58,921 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 10:52:58,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-13 10:52:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 10:52:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 10:52:58,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:52:58,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:52:58,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:52:58,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:52:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:52:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1898116011, now seen corresponding path program 1 times [2022-07-13 10:52:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:52:58,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616901392] [2022-07-13 10:52:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:52:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:52:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 10:52:59,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:52:59,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616901392] [2022-07-13 10:52:59,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616901392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:52:59,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:52:59,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:52:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987821072] [2022-07-13 10:52:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:52:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:52:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:52:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:52:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:52:59,019 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-13 10:52:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:52:59,090 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-13 10:52:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:52:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-13 10:52:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:52:59,092 INFO L225 Difference]: With dead ends: 40 [2022-07-13 10:52:59,092 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 10:52:59,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07-13 10:52:59,093 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:52:59,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:52:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 10:52:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-13 10:52:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:52:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 10:52:59,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-07-13 10:52:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:52:59,100 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 10:52:59,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-13 10:52:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 10:52:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:52:59,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:52:59,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:52:59,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:52:59,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:52:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:52:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash 544146986, now seen corresponding path program 1 times [2022-07-13 10:52:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:52:59,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789673850] [2022-07-13 10:52:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:52:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:52:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 10:52:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 10:52:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 10:52:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 10:52:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:52:59,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789673850] [2022-07-13 10:52:59,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789673850] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:52:59,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975949492] [2022-07-13 10:52:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:52:59,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:52:59,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:52:59,210 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-07-13 10:52:59,211 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-07-13 10:52:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:52:59,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:52:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 10:52:59,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:52:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 10:52:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975949492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:52:59,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:52:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-07-13 10:52:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674418850] [2022-07-13 10:52:59,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:52:59,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 10:52:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:52:59,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 10:52:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-13 10:52:59,416 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 10:52:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:52:59,564 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-07-13 10:52:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 10:52:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 29 [2022-07-13 10:52:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:52:59,567 INFO L225 Difference]: With dead ends: 72 [2022-07-13 10:52:59,567 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 10:52:59,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-13 10:52:59,573 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:52:59,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:52:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 10:52:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-13 10:52:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-13 10:52:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-07-13 10:52:59,591 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2022-07-13 10:52:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:52:59,591 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-07-13 10:52:59,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 10:52:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-07-13 10:52:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 10:52:59,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:52:59,598 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:52:59,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 10:52:59,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:52:59,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:52:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:52:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1645511465, now seen corresponding path program 2 times [2022-07-13 10:52:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:52:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529760249] [2022-07-13 10:52:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:52:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:52:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 10:52:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 10:52:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 10:52:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 10:52:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 10:52:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 10:52:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 10:52:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 10:52:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 10:52:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 10:52:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:52:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 10:53:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:00,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 10:53:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-13 10:53:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:53:00,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529760249] [2022-07-13 10:53:00,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529760249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:53:00,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949079141] [2022-07-13 10:53:00,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:53:00,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:53:00,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:53:00,009 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-07-13 10:53:00,013 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-07-13 10:53:00,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:53:00,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:53:00,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 10:53:00,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:53:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-13 10:53:00,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:53:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-13 10:53:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949079141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:53:00,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:53:00,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-07-13 10:53:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919692989] [2022-07-13 10:53:00,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:53:00,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 10:53:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:53:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 10:53:00,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-07-13 10:53:00,418 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-13 10:53:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:53:00,714 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2022-07-13 10:53:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 10:53:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 89 [2022-07-13 10:53:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:53:00,718 INFO L225 Difference]: With dead ends: 162 [2022-07-13 10:53:00,719 INFO L226 Difference]: Without dead ends: 145 [2022-07-13 10:53:00,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-07-13 10:53:00,724 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 315 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:53:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 63 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:53:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-13 10:53:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2022-07-13 10:53:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 10:53:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-13 10:53:00,744 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 89 [2022-07-13 10:53:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:53:00,745 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-13 10:53:00,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-13 10:53:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-13 10:53:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-13 10:53:00,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:53:00,751 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:53:00,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 10:53:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 10:53:00,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:53:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:53:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 548463335, now seen corresponding path program 3 times [2022-07-13 10:53:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:53:00,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668995858] [2022-07-13 10:53:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:53:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:53:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 10:53:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 10:53:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 10:53:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 10:53:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 10:53:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 10:53:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 10:53:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 10:53:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 10:53:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 10:53:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 10:53:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 10:53:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 10:53:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 10:53:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 10:53:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 10:53:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 10:53:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 10:53:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 10:53:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 10:53:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 10:53:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 10:53:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 10:53:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 10:53:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 10:53:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 10:53:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 10:53:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 10:53:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 10:53:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 10:53:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2022-07-13 10:53:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:53:01,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668995858] [2022-07-13 10:53:01,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668995858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:53:01,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042821448] [2022-07-13 10:53:01,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:53:01,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:53:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:53:01,284 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-07-13 10:53:01,285 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-07-13 10:53:01,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 10:53:01,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:53:01,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 10:53:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:53:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-13 10:53:02,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:53:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-13 10:53:02,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042821448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:53:02,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:53:02,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2022-07-13 10:53:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336223515] [2022-07-13 10:53:02,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:53:02,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 10:53:02,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:53:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 10:53:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 10:53:02,374 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-13 10:53:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:53:03,087 INFO L93 Difference]: Finished difference Result 342 states and 434 transitions. [2022-07-13 10:53:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 10:53:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 209 [2022-07-13 10:53:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:53:03,089 INFO L225 Difference]: With dead ends: 342 [2022-07-13 10:53:03,089 INFO L226 Difference]: Without dead ends: 313 [2022-07-13 10:53:03,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 10:53:03,091 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 677 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 10:53:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 131 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 10:53:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-13 10:53:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-07-13 10:53:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-13 10:53:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2022-07-13 10:53:03,110 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 209 [2022-07-13 10:53:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:53:03,110 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2022-07-13 10:53:03,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-13 10:53:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2022-07-13 10:53:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-13 10:53:03,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:53:03,115 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 66, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:53:03,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:53:03,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:53:03,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:53:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:53:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094685, now seen corresponding path program 4 times [2022-07-13 10:53:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:53:03,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741215564] [2022-07-13 10:53:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:53:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:53:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 10:53:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 10:53:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 10:53:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 10:53:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 10:53:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 10:53:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 10:53:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 10:53:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 10:53:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 10:53:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 10:53:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 10:53:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 10:53:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 10:53:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 10:53:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 10:53:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 10:53:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 10:53:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 10:53:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 10:53:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 10:53:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 10:53:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 10:53:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 10:53:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 10:53:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 10:53:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 10:53:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 10:53:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 10:53:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 10:53:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 10:53:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 10:53:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 10:53:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 10:53:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 10:53:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-13 10:53:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-13 10:53:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-13 10:53:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 10:53:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-13 10:53:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-13 10:53:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-13 10:53:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-13 10:53:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-13 10:53:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-13 10:53:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-13 10:53:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-13 10:53:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-13 10:53:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-13 10:53:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-13 10:53:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-13 10:53:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-13 10:53:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-13 10:53:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-13 10:53:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-13 10:53:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-13 10:53:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-13 10:53:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-13 10:53:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-13 10:53:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-13 10:53:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-13 10:53:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-07-13 10:53:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-13 10:53:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-13 10:53:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-13 10:53:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-13 10:53:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:53:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 9064 trivial. 0 not checked. [2022-07-13 10:53:03,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:53:03,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741215564] [2022-07-13 10:53:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741215564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:53:03,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139596225] [2022-07-13 10:53:03,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:53:03,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:53:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:53:03,874 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-07-13 10:53:03,876 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-07-13 10:53:04,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:53:04,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:53:04,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 280 conjunts are in the unsatisfiable core [2022-07-13 10:53:04,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:53:04,148 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 10:53:04,149 INFO L390 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 32 treesize of output 28 [2022-07-13 10:53:04,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:53:04,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-13 10:53:04,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-13 10:53:04,309 INFO L390 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 12 treesize of output 11 [2022-07-13 10:53:04,311 INFO L390 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 12 treesize of output 11 [2022-07-13 10:53:04,672 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:04,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:05,001 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:05,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:05,370 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:05,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:05,726 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:05,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:06,076 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:06,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:06,390 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:06,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:06,679 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:06,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:06,959 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:06,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:07,277 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:07,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:07,572 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:07,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:07,878 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:07,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:08,171 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:08,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:08,491 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:08,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:08,791 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:08,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:09,170 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:09,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:09,481 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:09,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:09,808 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:09,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:10,132 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:10,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:10,458 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:10,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:10,796 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 10:53:10,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-13 10:53:10,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-13 10:53:10,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-07-13 10:53:11,062 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,139 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,215 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,293 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,373 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,468 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,547 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,629 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,712 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,794 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,878 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:11,963 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:11,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,051 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,138 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,237 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,344 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,470 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,577 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,696 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,793 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 10:53:12,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-13 10:53:12,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2022-07-13 10:53:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 2757 proven. 590 refuted. 0 times theorem prover too weak. 7125 trivial. 0 not checked. [2022-07-13 10:53:12,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:53:15,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (forall ((v_ArrVal_854 Int)) (< 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4)))))) is different from false [2022-07-13 10:53:25,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_118| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_118|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (< 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))))))) is different from false [2022-07-13 10:54:07,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (forall ((v_ArrVal_851 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (< 0 (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_119| 4) |c_ULTIMATE.start_main_~#c~0#1.offset|) v_ArrVal_851) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_119| 1) |v_ULTIMATE.start_main_~i~0#1_118|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) is different from false [2022-07-13 10:55:01,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_851 Int) (v_ArrVal_848 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_120| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (< 0 (select (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_120| 4)) v_ArrVal_848) (+ (* |v_ULTIMATE.start_main_~i~0#1_119| 4) |c_ULTIMATE.start_main_~#c~0#1.offset|) v_ArrVal_851) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_119| 1) |v_ULTIMATE.start_main_~i~0#1_118|)))))) is different from false [2022-07-13 10:56:04,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_121| Int)) (or (forall ((v_ArrVal_851 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int) (v_ArrVal_848 Int) (v_ArrVal_846 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (< 0 (select (store (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_121| 4)) v_ArrVal_846) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_120| 4)) v_ArrVal_848) (+ (* |v_ULTIMATE.start_main_~i~0#1_119| 4) |c_ULTIMATE.start_main_~#c~0#1.offset|) v_ArrVal_851) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_121| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_120| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_119| 1) |v_ULTIMATE.start_main_~i~0#1_118|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_121|)))) is different from false