./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-fpi/brs1.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 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:58:54,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:58:54,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:58:54,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:58:54,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:58:54,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:58:54,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:58:55,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:58:55,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:58:55,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:58:55,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:58:55,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:58:55,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:58:55,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:58:55,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:58:55,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:58:55,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:58:55,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:58:55,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:58:55,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:58:55,028 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:58:55,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:58:55,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:58:55,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:58:55,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:58:55,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:58:55,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:58:55,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:58:55,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:58:55,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:58:55,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:58:55,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:58:55,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:58:55,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:58:55,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:58:55,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:58:55,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:58:55,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:58:55,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:58:55,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:58:55,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:58:55,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:58:55,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:58:55,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:58:55,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:58:55,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:58:55,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:58:55,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:58:55,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:58:55,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:58:55,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:58:55,083 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:58:55,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:58:55,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:58:55,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:58:55,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:58:55,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:58:55,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:58:55,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:58:55,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:58:55,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:58:55,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:58:55,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:58:55,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:58:55,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:58:55,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:58:55,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:58:55,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:58:55,088 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:58:55,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:58:55,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:58:55,088 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 -> 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 [2022-07-20 21:58:55,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:58:55,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:58:55,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:58:55,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:58:55,385 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:58:55,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs1.c [2022-07-20 21:58:55,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5793b55b/8e4d2edc142b4e0a864a8690bc81f826/FLAG8d4942b4a [2022-07-20 21:58:55,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:58:55,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs1.c [2022-07-20 21:58:55,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5793b55b/8e4d2edc142b4e0a864a8690bc81f826/FLAG8d4942b4a [2022-07-20 21:58:55,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5793b55b/8e4d2edc142b4e0a864a8690bc81f826 [2022-07-20 21:58:55,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:58:55,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:58:55,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:58:55,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:58:55,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:58:55,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:58:55" (1/1) ... [2022-07-20 21:58:55,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1d930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:55, skipping insertion in model container [2022-07-20 21:58:55,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:58:55" (1/1) ... [2022-07-20 21:58:55,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:58:55,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:58:56,046 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-fpi/brs1.c[587,600] [2022-07-20 21:58:56,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:58:56,084 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:58:56,100 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-fpi/brs1.c[587,600] [2022-07-20 21:58:56,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:58:56,119 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:58:56,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56 WrapperNode [2022-07-20 21:58:56,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:58:56,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:58:56,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:58:56,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:58:56,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,169 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-20 21:58:56,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:58:56,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:58:56,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:58:56,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:58:56,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:58:56,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:58:56,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:58:56,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:58:56,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (1/1) ... [2022-07-20 21:58:56,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:58:56,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:58:56,243 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-20 21:58:56,245 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-20 21:58:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:58:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:58:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:58:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:58:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 21:58:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:58:56,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:58:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:58:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:58:56,342 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:58:56,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:58:56,544 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:58:56,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:58:56,549 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 21:58:56,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:58:56 BoogieIcfgContainer [2022-07-20 21:58:56,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:58:56,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:58:56,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:58:56,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:58:56,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:58:55" (1/3) ... [2022-07-20 21:58:56,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@947a6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:58:56, skipping insertion in model container [2022-07-20 21:58:56,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:58:56" (2/3) ... [2022-07-20 21:58:56,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@947a6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:58:56, skipping insertion in model container [2022-07-20 21:58:56,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:58:56" (3/3) ... [2022-07-20 21:58:56,575 INFO L111 eAbstractionObserver]: Analyzing ICFG brs1.c [2022-07-20 21:58:56,587 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:58:56,587 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:58:56,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:58:56,663 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@5c1f8abb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@710a0f8e [2022-07-20 21:58:56,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:58:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-20 21:58:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 21:58:56,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:58:56,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:58:56,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:58:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:58:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-20 21:58:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:58:56,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856621546] [2022-07-20 21:58:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:58:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:56,847 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-20 21:58:56,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:58:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856621546] [2022-07-20 21:58:56,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856621546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:58:56,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:58:56,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:58:56,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187571947] [2022-07-20 21:58:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:58:56,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:58:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:58:56,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:58:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:58:56,889 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-20 21:58:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:58:56,903 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-20 21:58:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:58:56,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-20 21:58:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:58:56,913 INFO L225 Difference]: With dead ends: 36 [2022-07-20 21:58:56,913 INFO L226 Difference]: Without dead ends: 16 [2022-07-20 21:58:56,916 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-20 21:58:56,921 INFO L413 NwaCegarLoop]: 23 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, 23 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-20 21:58:56,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:58:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-20 21:58:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-20 21:58:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-20 21:58:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-20 21:58:56,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-07-20 21:58:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:58:56,955 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-20 21:58:56,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-20 21:58:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-20 21:58:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 21:58:56,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:58:56,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:58:56,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:58:56,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:58:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:58:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-20 21:58:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:58:56,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869000234] [2022-07-20 21:58:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:58:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:57,093 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-20 21:58:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:58:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869000234] [2022-07-20 21:58:57,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869000234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:58:57,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:58:57,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:58:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802197248] [2022-07-20 21:58:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:58:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:58:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:58:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:58:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:58:57,100 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-20 21:58:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:58:57,158 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-20 21:58:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:58:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-20 21:58:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:58:57,160 INFO L225 Difference]: With dead ends: 30 [2022-07-20 21:58:57,160 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 21:58:57,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-20 21:58:57,166 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:58:57,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:58:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 21:58:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-07-20 21:58:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 21:58:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-20 21:58:57,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-07-20 21:58:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:58:57,178 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-20 21:58:57,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-20 21:58:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-20 21:58:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 21:58:57,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:58:57,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:58:57,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:58:57,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:58:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:58:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-20 21:58:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:58:57,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462044196] [2022-07-20 21:58:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:58:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:58:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:58:57,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462044196] [2022-07-20 21:58:57,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462044196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:58:57,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:58:57,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 21:58:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268164963] [2022-07-20 21:58:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:58:57,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:58:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:58:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:58:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:58:57,323 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-20 21:58:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:58:57,360 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-20 21:58:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:58:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-20 21:58:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:58:57,362 INFO L225 Difference]: With dead ends: 26 [2022-07-20 21:58:57,363 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 21:58:57,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:58:57,369 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:58:57,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:58:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 21:58:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-20 21:58:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-20 21:58:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-20 21:58:57,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-07-20 21:58:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:58:57,377 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-20 21:58:57,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-20 21:58:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-20 21:58:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 21:58:57,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:58:57,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:58:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 21:58:57,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:58:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:58:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-20 21:58:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:58:57,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111489981] [2022-07-20 21:58:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:58:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:58:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:58:57,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111489981] [2022-07-20 21:58:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111489981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:58:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631827269] [2022-07-20 21:58:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:57,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:58:57,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:58:57,514 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-20 21:58:57,515 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-20 21:58:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:57,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 21:58:57,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:58:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:58:57,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:58:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:58:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631827269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:58:57,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:58:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 21:58:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642481873] [2022-07-20 21:58:57,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:58:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 21:58:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:58:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 21:58:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 21:58:57,787 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-20 21:58:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:58:57,874 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-20 21:58:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 21:58:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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 20 [2022-07-20 21:58:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:58:57,875 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:58:57,875 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:58:57,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-20 21:58:57,877 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:58:57,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:58:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:58:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-20 21:58:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-20 21:58:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-20 21:58:57,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-07-20 21:58:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:58:57,883 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-20 21:58:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-20 21:58:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-20 21:58:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 21:58:57,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:58:57,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:58:57,902 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-20 21:58:58,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:58:58,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:58:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:58:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1179965024, now seen corresponding path program 2 times [2022-07-20 21:58:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:58:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626544037] [2022-07-20 21:58:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:58:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:58:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:58:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:58:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:58:58,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626544037] [2022-07-20 21:58:58,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626544037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:58:58,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030310035] [2022-07-20 21:58:58,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:58:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:58:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:58:58,460 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-20 21:58:58,488 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-20 21:58:58,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:58:58,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:58:58,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 21:58:58,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:58:58,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:58:58,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:58:58,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 21:58:58,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:58:58,952 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 21:58:58,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-20 21:59:01,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:01,326 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-20 21:59:01,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 13 [2022-07-20 21:59:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:01,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:01,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 222 [2022-07-20 21:59:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030310035] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:02,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:02,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2022-07-20 21:59:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521423984] [2022-07-20 21:59:02,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:02,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 21:59:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 21:59:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=881, Unknown=1, NotChecked=0, Total=1056 [2022-07-20 21:59:02,116 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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-20 21:59:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:02,550 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-20 21:59:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 21:59:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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 23 [2022-07-20 21:59:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:02,552 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:59:02,552 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 21:59:02,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=319, Invalid=1486, Unknown=1, NotChecked=0, Total=1806 [2022-07-20 21:59:02,554 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:02,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 63 Unchecked, 0.0s Time] [2022-07-20 21:59:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 21:59:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-07-20 21:59:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-20 21:59:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-20 21:59:02,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-07-20 21:59:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:02,559 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-20 21:59:02,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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-20 21:59:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-20 21:59:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 21:59:02,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:02,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:02,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:02,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:02,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -373004471, now seen corresponding path program 3 times [2022-07-20 21:59:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:02,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723718795] [2022-07-20 21:59:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723718795] [2022-07-20 21:59:02,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723718795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:02,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277407943] [2022-07-20 21:59:02,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:59:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:02,851 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-20 21:59:02,853 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-20 21:59:02,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 21:59:02,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:02,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 21:59:02,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:03,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:03,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277407943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:03,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:03,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 21:59:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065331927] [2022-07-20 21:59:03,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:03,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:59:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:03,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:59:03,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:59:03,041 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-20 21:59:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:03,164 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-07-20 21:59:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 21:59:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 26 [2022-07-20 21:59:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:03,166 INFO L225 Difference]: With dead ends: 58 [2022-07-20 21:59:03,166 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 21:59:03,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:59:03,168 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:03,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 21:59:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-07-20 21:59:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-20 21:59:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-20 21:59:03,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 26 [2022-07-20 21:59:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:03,188 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-20 21:59:03,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-20 21:59:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-20 21:59:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 21:59:03,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:03,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:03,216 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-20 21:59:03,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:03,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash -976107378, now seen corresponding path program 4 times [2022-07-20 21:59:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813416563] [2022-07-20 21:59:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813416563] [2022-07-20 21:59:03,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813416563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49032346] [2022-07-20 21:59:03,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:59:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:03,494 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-20 21:59:03,522 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-20 21:59:03,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:59:03,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:03,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 21:59:03,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:03,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:03,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49032346] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:03,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:03,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 21:59:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040283515] [2022-07-20 21:59:03,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:03,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:59:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:59:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:59:03,686 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-20 21:59:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:03,830 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-20 21:59:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 21:59:03,831 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 26 [2022-07-20 21:59:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:03,834 INFO L225 Difference]: With dead ends: 41 [2022-07-20 21:59:03,834 INFO L226 Difference]: Without dead ends: 32 [2022-07-20 21:59:03,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-20 21:59:03,835 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:03,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-20 21:59:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-20 21:59:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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-20 21:59:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-20 21:59:03,845 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-20 21:59:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:03,845 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-20 21:59:03,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-20 21:59:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-20 21:59:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:59:03,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:03,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:03,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:04,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:04,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -690020773, now seen corresponding path program 5 times [2022-07-20 21:59:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:04,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488420792] [2022-07-20 21:59:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:04,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488420792] [2022-07-20 21:59:04,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488420792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815258661] [2022-07-20 21:59:04,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 21:59:04,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:04,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:04,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 21:59:04,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 21:59:04,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:04,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 21:59:04,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:04,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:59:04,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:59:04,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:04,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-20 21:59:04,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-20 21:59:04,995 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:04,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:04,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2022-07-20 21:59:05,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:05,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:05,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-20 21:59:05,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:05,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2022-07-20 21:59:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:05,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:09,554 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 Int) (v_ArrVal_174 Int) (v_ArrVal_173 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_173)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_176 (+ v_ArrVal_174 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_174)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_174 0)) (not (<= v_ArrVal_173 1)) (<= (+ v_ArrVal_176 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))) is different from false [2022-07-20 21:59:13,423 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:13,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1332 treesize of output 1296 [2022-07-20 21:59:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-20 21:59:14,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815258661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:14,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:14,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 39 [2022-07-20 21:59:14,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414019539] [2022-07-20 21:59:14,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:14,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 21:59:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 21:59:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1238, Unknown=4, NotChecked=72, Total=1482 [2022-07-20 21:59:14,727 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-20 21:59:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:25,070 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-07-20 21:59:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 21:59:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 29 [2022-07-20 21:59:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:25,072 INFO L225 Difference]: With dead ends: 79 [2022-07-20 21:59:25,072 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 21:59:25,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=481, Invalid=3551, Unknown=4, NotChecked=124, Total=4160 [2022-07-20 21:59:25,074 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:25,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 201 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-07-20 21:59:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 21:59:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2022-07-20 21:59:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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-20 21:59:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-07-20 21:59:25,082 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2022-07-20 21:59:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:25,082 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-07-20 21:59:25,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-20 21:59:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-07-20 21:59:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 21:59:25,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:25,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:25,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:25,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 900913518, now seen corresponding path program 6 times [2022-07-20 21:59:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654379618] [2022-07-20 21:59:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654379618] [2022-07-20 21:59:25,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654379618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:25,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233182644] [2022-07-20 21:59:25,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 21:59:25,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:25,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:25,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:25,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 21:59:25,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 21:59:25,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:25,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 21:59:25,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:25,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233182644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:25,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:25,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 21:59:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310150757] [2022-07-20 21:59:25,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:59:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:25,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:59:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:59:25,656 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-20 21:59:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:25,835 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-07-20 21:59:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 21:59:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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 32 [2022-07-20 21:59:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:25,836 INFO L225 Difference]: With dead ends: 77 [2022-07-20 21:59:25,836 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 21:59:25,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-20 21:59:25,837 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:25,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 56 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 21:59:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2022-07-20 21:59:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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-20 21:59:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-07-20 21:59:25,844 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 32 [2022-07-20 21:59:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:25,844 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-07-20 21:59:25,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-20 21:59:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-07-20 21:59:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 21:59:25,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:25,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:25,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:26,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:26,072 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1277658368, now seen corresponding path program 7 times [2022-07-20 21:59:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:26,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387930246] [2022-07-20 21:59:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:27,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:27,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387930246] [2022-07-20 21:59:27,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387930246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:27,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170789642] [2022-07-20 21:59:27,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 21:59:27,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:27,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:27,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 21:59:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:27,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 21:59:27,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:27,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:59:27,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:59:27,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-20 21:59:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-07-20 21:59:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-20 21:59:27,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:27,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-07-20 21:59:27,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:27,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:27,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2022-07-20 21:59:28,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:28,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2022-07-20 21:59:28,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:28,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 19 [2022-07-20 21:59:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:28,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:00,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_266)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_266 1)) (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_268 0)))))) is different from false [2022-07-20 22:00:27,897 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-20 22:00:27,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5580 treesize of output 5508 [2022-07-20 22:00:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 22:00:30,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170789642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:30,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:30,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2022-07-20 22:00:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395022285] [2022-07-20 22:00:30,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:30,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 22:00:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 22:00:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2328, Unknown=26, NotChecked=100, Total=2756 [2022-07-20 22:00:30,139 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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-20 22:00:56,244 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_268 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_272 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) c_~N~0) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_268 0))))) (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_266)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_266 1)) (<= (+ v_ArrVal_272 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_268 0))))))) is different from false [2022-07-20 22:01:22,977 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:01:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:01:23,461 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-07-20 22:01:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 22:01:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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 35 [2022-07-20 22:01:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:01:23,464 INFO L225 Difference]: With dead ends: 86 [2022-07-20 22:01:23,465 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 22:01:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 113.4s TimeCoverageRelationStatistics Valid=573, Invalid=4085, Unknown=42, NotChecked=270, Total=4970 [2022-07-20 22:01:23,467 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:01:23,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 208 Unchecked, 0.1s Time] [2022-07-20 22:01:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 22:01:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2022-07-20 22:01:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 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-20 22:01:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-20 22:01:23,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 35 [2022-07-20 22:01:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:01:23,486 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-20 22:01:23,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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-20 22:01:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-20 22:01:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:01:23,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:01:23,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:01:23,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:01:23,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:01:23,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:01:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:01:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 876019369, now seen corresponding path program 8 times [2022-07-20 22:01:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:01:23,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401514407] [2022-07-20 22:01:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:01:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:01:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:01:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:01:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:01:23,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401514407] [2022-07-20 22:01:23,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401514407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:01:23,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691562521] [2022-07-20 22:01:23,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:01:23,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:01:23,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:01:23,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:01:23,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 22:01:23,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:01:23,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:01:23,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:01:23,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:01:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:01:24,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:01:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:01:24,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691562521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:01:24,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:01:24,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-20 22:01:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431412381] [2022-07-20 22:01:24,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:01:24,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:01:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:01:24,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:01:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:01:24,119 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-20 22:01:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:01:24,319 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-07-20 22:01:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:01:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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 38 [2022-07-20 22:01:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:01:24,321 INFO L225 Difference]: With dead ends: 104 [2022-07-20 22:01:24,321 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 22:01:24,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2022-07-20 22:01:24,322 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:01:24,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 32 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:01:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 22:01:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 62. [2022-07-20 22:01:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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-20 22:01:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-07-20 22:01:24,333 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 38 [2022-07-20 22:01:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:01:24,333 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-07-20 22:01:24,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 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-20 22:01:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-07-20 22:01:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:01:24,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:01:24,334 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:01:24,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:01:24,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 22:01:24,540 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:01:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:01:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1242559689, now seen corresponding path program 9 times [2022-07-20 22:01:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:01:24,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409137074] [2022-07-20 22:01:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:01:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:01:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:01:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:01:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:01:24,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409137074] [2022-07-20 22:01:24,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409137074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:01:24,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316545860] [2022-07-20 22:01:24,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:01:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:01:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:01:24,664 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:01:24,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:01:24,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:01:24,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:01:24,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 22:01:24,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:01:24,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:01:24,855 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-20 22:01:24,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-20 22:01:25,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:25,027 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-20 22:01:25,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-07-20 22:01:25,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:25,147 INFO L356 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-07-20 22:01:25,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 56 [2022-07-20 22:01:25,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:25,325 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-07-20 22:01:25,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2022-07-20 22:01:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:01:25,641 INFO L356 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-07-20 22:01:25,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2022-07-20 22:01:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-20 22:01:25,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:01:53,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) is different from false [2022-07-20 22:01:53,373 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-20 22:01:53,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1057 treesize of output 1 [2022-07-20 22:01:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2022-07-20 22:01:53,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316545860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:01:53,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:01:53,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 45 [2022-07-20 22:01:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113525682] [2022-07-20 22:01:53,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:01:53,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 22:01:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:01:53,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 22:01:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1625, Unknown=9, NotChecked=84, Total=1980 [2022-07-20 22:01:53,378 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 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-20 22:01:55,607 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-20 22:01:57,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-20 22:01:59,032 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|))) is different from false [2022-07-20 22:02:01,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-20 22:02:02,797 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (<= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_374 Int) (v_ArrVal_372 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_370 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_370)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_127| 4))) (or (< (+ v_ArrVal_372 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_372)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_374) (< 1 v_ArrVal_370) (< 0 v_ArrVal_372) (< |v_ULTIMATE.start_main_~i~0#1_127| 1) (<= (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_127|) (<= (+ v_ArrVal_374 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_374)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (+ 2 |v_ULTIMATE.start_main_~i~0#1_127|)))))) (<= 6 c_~N~0) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-20 22:02:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:16,118 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-07-20 22:02:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-20 22:02:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 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 38 [2022-07-20 22:02:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:16,120 INFO L225 Difference]: With dead ends: 85 [2022-07-20 22:02:16,120 INFO L226 Difference]: Without dead ends: 79 [2022-07-20 22:02:16,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=741, Invalid=4376, Unknown=19, NotChecked=870, Total=6006 [2022-07-20 22:02:16,122 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:16,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-07-20 22:02:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-20 22:02:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2022-07-20 22:02:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 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-20 22:02:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-07-20 22:02:16,133 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-07-20 22:02:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:16,133 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-07-20 22:02:16,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 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-20 22:02:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-07-20 22:02:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:02:16,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:16,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:16,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:16,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:16,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1188189509, now seen corresponding path program 10 times [2022-07-20 22:02:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:02:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043811474] [2022-07-20 22:02:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:02:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:02:17,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043811474] [2022-07-20 22:02:17,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043811474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:02:17,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635540622] [2022-07-20 22:02:17,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:02:17,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:02:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:17,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:02:17,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 22:02:17,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:02:17,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:02:17,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 22:02:17,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:17,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:02:17,936 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-20 22:02:17,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-20 22:02:18,047 INFO L356 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2022-07-20 22:02:18,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-07-20 22:02:18,266 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-07-20 22:02:18,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-07-20 22:02:18,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,464 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:02:18,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-07-20 22:02:18,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,647 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-20 22:02:18,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 75 [2022-07-20 22:02:18,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:18,839 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-20 22:02:18,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 75 [2022-07-20 22:02:19,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:19,024 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-20 22:02:19,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 77 [2022-07-20 22:02:19,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:19,277 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:02:19,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 67 [2022-07-20 22:02:24,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:02:24,953 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:02:24,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 23 [2022-07-20 22:02:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:25,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:03:00,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 Int) (v_ArrVal_440 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_435 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_435)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_435 1)) (not (<= v_ArrVal_437 0)) (not (<= v_ArrVal_440 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (<= v_ArrVal_443 (+ v_ArrVal_440 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_440)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_438 (+ v_ArrVal_437 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) is different from false