./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/brs5.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 908db381a067cd65920e47aeaa3ff4913a67de2048af6864f01f76e8ca691571 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:38:29,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:38:29,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:38:29,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:38:29,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:38:29,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:38:29,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:38:29,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:38:29,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:38:29,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:38:29,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:38:29,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:38:29,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:38:29,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:38:29,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:38:29,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:38:29,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:38:29,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:38:29,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:38:29,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:38:29,541 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:38:29,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:38:29,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:38:29,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:38:29,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:38:29,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:38:29,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:38:29,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:38:29,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:38:29,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:38:29,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:38:29,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:38:29,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:38:29,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:38:29,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:38:29,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:38:29,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:38:29,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:38:29,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:38:29,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:38:29,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:38:29,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:38:29,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:38:29,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:38:29,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:38:29,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:38:29,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:38:29,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:38:29,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:38:29,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:38:29,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:38:29,584 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:38:29,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:38:29,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:38:29,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:38:29,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:38:29,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:38:29,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:38:29,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:38:29,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:38:29,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:38:29,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:38:29,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:38:29,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:38:29,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:38:29,589 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 -> 908db381a067cd65920e47aeaa3ff4913a67de2048af6864f01f76e8ca691571 [2022-07-22 10:38:29,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:38:29,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:38:29,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:38:29,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:38:29,814 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:38:29,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs5.c [2022-07-22 10:38:29,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5511441/52aa4257c6f7403cb0fddd65430d47d3/FLAG35ffeadb4 [2022-07-22 10:38:30,259 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:38:30,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5.c [2022-07-22 10:38:30,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5511441/52aa4257c6f7403cb0fddd65430d47d3/FLAG35ffeadb4 [2022-07-22 10:38:30,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5511441/52aa4257c6f7403cb0fddd65430d47d3 [2022-07-22 10:38:30,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:38:30,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:38:30,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:38:30,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:38:30,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:38:30,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468a1ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30, skipping insertion in model container [2022-07-22 10:38:30,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:38:30,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:38:30,825 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/brs5.c[587,600] [2022-07-22 10:38:30,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:38:30,852 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:38:30,865 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/brs5.c[587,600] [2022-07-22 10:38:30,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:38:30,892 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:38:30,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30 WrapperNode [2022-07-22 10:38:30,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:38:30,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:38:30,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:38:30,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:38:30,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,928 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-22 10:38:30,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:38:30,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:38:30,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:38:30,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:38:30,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:38:30,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:38:30,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:38:30,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:38:30,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (1/1) ... [2022-07-22 10:38:30,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:38:30,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:30,989 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-22 10:38:31,008 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-22 10:38:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:38:31,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:38:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:38:31,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:38:31,077 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:38:31,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:38:31,181 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:38:31,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:38:31,185 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 10:38:31,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:31 BoogieIcfgContainer [2022-07-22 10:38:31,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:38:31,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:38:31,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:38:31,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:38:31,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:38:30" (1/3) ... [2022-07-22 10:38:31,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4468b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:31, skipping insertion in model container [2022-07-22 10:38:31,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:30" (2/3) ... [2022-07-22 10:38:31,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4468b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:31, skipping insertion in model container [2022-07-22 10:38:31,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:31" (3/3) ... [2022-07-22 10:38:31,193 INFO L111 eAbstractionObserver]: Analyzing ICFG brs5.c [2022-07-22 10:38:31,203 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:38:31,203 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:38:31,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:38:31,254 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@2666b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a4bb608 [2022-07-22 10:38:31,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:38:31,259 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-22 10:38:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 10:38:31,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:31,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:31,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-22 10:38:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:31,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215439825] [2022-07-22 10:38:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:31,407 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-22 10:38:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215439825] [2022-07-22 10:38:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215439825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:38:31,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:38:31,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:38:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080580352] [2022-07-22 10:38:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:38:31,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:38:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:38:31,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:38:31,441 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-22 10:38:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:31,453 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-22 10:38:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:38:31,456 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-22 10:38:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:31,461 INFO L225 Difference]: With dead ends: 36 [2022-07-22 10:38:31,461 INFO L226 Difference]: Without dead ends: 16 [2022-07-22 10:38:31,464 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-22 10:38:31,467 INFO L413 NwaCegarLoop]: 24 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, 24 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-22 10:38:31,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:38:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-22 10:38:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 10:38:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-22 10:38:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-22 10:38:31,489 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-07-22 10:38:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:31,490 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-22 10:38:31,490 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-22 10:38:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-22 10:38:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 10:38:31,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:31,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:31,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:38:31,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-22 10:38:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:31,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308571343] [2022-07-22 10:38:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:31,596 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-22 10:38:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308571343] [2022-07-22 10:38:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308571343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:38:31,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:38:31,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:38:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965014175] [2022-07-22 10:38:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:38:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:38:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:38:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:38:31,599 INFO L87 Difference]: Start difference. First operand 16 states and 19 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-22 10:38:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:31,679 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-22 10:38:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:38:31,679 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-22 10:38:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:31,680 INFO L225 Difference]: With dead ends: 33 [2022-07-22 10:38:31,680 INFO L226 Difference]: Without dead ends: 22 [2022-07-22 10:38:31,680 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-22 10:38:31,681 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:31,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:38:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-22 10:38:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-22 10:38:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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-22 10:38:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 10:38:31,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-07-22 10:38:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:31,686 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 10:38:31,686 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-22 10:38:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 10:38:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 10:38:31,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:31,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:31,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:38:31,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-22 10:38:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:31,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408253472] [2022-07-22 10:38:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:31,799 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-22 10:38:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:31,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408253472] [2022-07-22 10:38:31,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408253472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:38:31,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:38:31,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:38:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601976954] [2022-07-22 10:38:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:38:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:38:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:38:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:38:31,802 INFO L87 Difference]: Start difference. First operand 20 states and 23 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-22 10:38:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:31,836 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-22 10:38:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 10:38:31,836 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-22 10:38:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:31,837 INFO L225 Difference]: With dead ends: 27 [2022-07-22 10:38:31,837 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 10:38:31,838 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-22 10:38:31,838 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:31,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:38:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 10:38:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-22 10:38:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-22 10:38:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-22 10:38:31,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-07-22 10:38:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:31,843 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-22 10:38:31,843 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-22 10:38:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-22 10:38:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:38:31,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:31,844 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-22 10:38:31,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 10:38:31,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:31,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-22 10:38:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:31,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706782551] [2022-07-22 10:38:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:31,922 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-22 10:38:31,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706782551] [2022-07-22 10:38:31,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706782551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521494467] [2022-07-22 10:38:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:31,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:31,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:31,925 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-22 10:38:31,926 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-22 10:38:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:31,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:38:32,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:32,101 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-22 10:38:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:32,144 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-22 10:38:32,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521494467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:32,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:32,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:38:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878797816] [2022-07-22 10:38:32,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:32,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:38:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:38:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:38:32,149 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-22 10:38:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:32,263 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-07-22 10:38:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 10:38:32,263 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-22 10:38:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:32,264 INFO L225 Difference]: With dead ends: 43 [2022-07-22 10:38:32,264 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 10:38:32,265 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-22 10:38:32,265 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:32,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:38:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 10:38:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-22 10:38:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-22 10:38:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-22 10:38:32,269 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2022-07-22 10:38:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:32,269 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-22 10:38:32,270 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-22 10:38:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-22 10:38:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 10:38:32,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:32,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:32,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:38:32,490 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-22 10:38:32,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2022-07-22 10:38:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244821650] [2022-07-22 10:38:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:32,886 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-22 10:38:32,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:32,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244821650] [2022-07-22 10:38:32,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244821650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:32,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807980127] [2022-07-22 10:38:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:32,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:32,892 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-22 10:38:32,893 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-22 10:38:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:32,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 10:38:32,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:32,968 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-22 10:38:33,050 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 21 treesize of output 17 [2022-07-22 10:38:33,143 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 29 treesize of output 28 [2022-07-22 10:38:33,232 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 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-22 10:38:33,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 10:38:33,340 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-22 10:38:33,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:35,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 0)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_73)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_73) (* c_~N~0 5)))) is different from false [2022-07-22 10:38:36,003 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 222 treesize of output 210 [2022-07-22 10:38:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-22 10:38:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807980127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:36,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:36,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2022-07-22 10:38:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084392221] [2022-07-22 10:38:36,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:38:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:38:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=529, Unknown=3, NotChecked=48, Total=702 [2022-07-22 10:38:36,896 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 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-22 10:38:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:37,118 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-07-22 10:38:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 10:38:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 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) Word has length 23 [2022-07-22 10:38:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:37,119 INFO L225 Difference]: With dead ends: 56 [2022-07-22 10:38:37,120 INFO L226 Difference]: Without dead ends: 36 [2022-07-22 10:38:37,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=176, Invalid=755, Unknown=3, NotChecked=58, Total=992 [2022-07-22 10:38:37,121 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:37,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 67 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 237 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-07-22 10:38:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-22 10:38:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-07-22 10:38:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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-22 10:38:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-07-22 10:38:37,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-07-22 10:38:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:37,126 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-07-22 10:38:37,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 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-22 10:38:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-07-22 10:38:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:38:37,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:37,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:37,146 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-22 10:38:37,331 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-22 10:38:37,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2022-07-22 10:38:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:37,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773425206] [2022-07-22 10:38:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:37,402 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-22 10:38:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:37,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773425206] [2022-07-22 10:38:37,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773425206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:37,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399447374] [2022-07-22 10:38:37,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:38:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:37,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:37,404 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-22 10:38:37,405 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-22 10:38:37,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:38:37,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:38:37,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:38:37,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:37,493 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-22 10:38:37,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:38:37,518 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-22 10:38:37,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399447374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:38:37,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:38:37,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:38:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015086926] [2022-07-22 10:38:37,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:38:37,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:38:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:38:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:38:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:38:37,520 INFO L87 Difference]: Start difference. First operand 34 states and 38 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-22 10:38:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:38:37,646 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-07-22 10:38:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:38:37,647 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-22 10:38:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:38:37,648 INFO L225 Difference]: With dead ends: 79 [2022-07-22 10:38:37,648 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:38:37,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:38:37,652 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:38:37,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 41 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:38:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:38:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-22 10:38:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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-22 10:38:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-22 10:38:37,663 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 26 [2022-07-22 10:38:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:38:37,663 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-22 10:38:37,664 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-22 10:38:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-22 10:38:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:38:37,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:38:37,665 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:38:37,687 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-22 10:38:37,878 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-22 10:38:37,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:38:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:38:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950171, now seen corresponding path program 3 times [2022-07-22 10:38:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:38:37,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392611312] [2022-07-22 10:38:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:38:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:38:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:38:38,319 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-22 10:38:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:38:38,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392611312] [2022-07-22 10:38:38,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392611312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:38:38,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246250982] [2022-07-22 10:38:38,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:38:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:38:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:38:38,321 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-22 10:38:38,323 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-22 10:38:38,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:38:38,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:38:38,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 10:38:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:38:38,393 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-22 10:38:38,423 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-22 10:38:38,499 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-22 10:38:38,500 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 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-22 10:38:42,636 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:38:42,637 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-22 10:38:42,707 INFO L356 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-07-22 10:38:42,707 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-22 10:38:42,853 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-07-22 10:38:42,853 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-22 10:38:53,609 INFO L356 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-07-22 10:38:53,610 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-22 10:38:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:38:53,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:39:30,407 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:39:30,407 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 2688 treesize of output 2606 [2022-07-22 10:39:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:39:30,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246250982] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:39:30,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:39:30,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 48 [2022-07-22 10:39:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736584006] [2022-07-22 10:39:30,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:39:30,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-22 10:39:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:39:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-22 10:39:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1862, Unknown=22, NotChecked=0, Total=2256 [2022-07-22 10:39:30,997 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 48 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 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-22 10:39:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:39:40,889 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-07-22 10:39:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-22 10:39:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 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-22 10:39:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:39:40,890 INFO L225 Difference]: With dead ends: 108 [2022-07-22 10:39:40,890 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 10:39:40,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=702, Invalid=3432, Unknown=26, NotChecked=0, Total=4160 [2022-07-22 10:39:40,892 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:39:40,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 59 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 150 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2022-07-22 10:39:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 10:39:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-07-22 10:39:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 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-22 10:39:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-07-22 10:39:40,899 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 29 [2022-07-22 10:39:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:39:40,899 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-07-22 10:39:40,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 48 states have internal predecessors, (76), 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-22 10:39:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-07-22 10:39:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:39:40,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:39:40,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:39:40,927 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-22 10:39:41,115 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-22 10:39:41,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:39:41,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:39:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1722173266, now seen corresponding path program 4 times [2022-07-22 10:39:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:39:41,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839062813] [2022-07-22 10:39:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:39:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:39:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:39:41,196 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-22 10:39:41,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:39:41,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839062813] [2022-07-22 10:39:41,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839062813] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:39:41,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017874265] [2022-07-22 10:39:41,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:39:41,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:39:41,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:39:41,208 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-22 10:39:41,209 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-22 10:39:41,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:39:41,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:39:41,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:39:41,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:39:41,333 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-22 10:39:41,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:39:41,370 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-22 10:39:41,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017874265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:39:41,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:39:41,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:39:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584249351] [2022-07-22 10:39:41,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:39:41,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:39:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:39:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:39:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:39:41,372 INFO L87 Difference]: Start difference. First operand 60 states and 70 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-22 10:39:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:39:41,581 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2022-07-22 10:39:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 10:39:41,581 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-22 10:39:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:39:41,583 INFO L225 Difference]: With dead ends: 137 [2022-07-22 10:39:41,583 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 10:39:41,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2022-07-22 10:39:41,584 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:39:41,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 57 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:39:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 10:39:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2022-07-22 10:39:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 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-22 10:39:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-07-22 10:39:41,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 32 [2022-07-22 10:39:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:39:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-07-22 10:39:41,591 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-22 10:39:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-07-22 10:39:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 10:39:41,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:39:41,592 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:39:41,609 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-22 10:39:41,795 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-22 10:39:41,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:39:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:39:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 456261758, now seen corresponding path program 5 times [2022-07-22 10:39:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:39:41,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004632817] [2022-07-22 10:39:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:39:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:39:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:39:42,541 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-22 10:39:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:39:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004632817] [2022-07-22 10:39:42,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004632817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:39:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33541828] [2022-07-22 10:39:42,541 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:39:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:39:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:39:42,543 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-22 10:39:42,544 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-22 10:39:42,604 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:39:42,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:39:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 10:39:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:39:42,614 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-22 10:39:42,647 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-22 10:39:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,712 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-22 10:39:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,785 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-22 10:39:42,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-22 10:39:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:42,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:39:43,000 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-22 10:39:43,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:39:43,129 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-22 10:39:43,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:39:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,314 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-22 10:39:43,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:39:43,408 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-22 10:39:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:39:43,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:39:50,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 Int) (v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 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_236)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_240 (+ v_ArrVal_238 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_240 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_238 0)) (not (<= v_ArrVal_236 0)) (<= (div (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* v_ArrVal_243 (- 1))) (- 5)) 4))))) is different from false [2022-07-22 10:39:52,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 Int) (v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 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_236)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (div (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* v_ArrVal_243 (- 1))) (- 5)) 4) (not (<= v_ArrVal_243 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_240))) (not (<= v_ArrVal_238 0)) (not (<= v_ArrVal_236 0)) (not (<= v_ArrVal_240 (+ v_ArrVal_238 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) is different from false [2022-07-22 10:40:10,989 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 10:40:10,990 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 24102 treesize of output 23802 [2022-07-22 10:40:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 32 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-22 10:40:23,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33541828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:40:23,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:40:23,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 51 [2022-07-22 10:40:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169384576] [2022-07-22 10:40:23,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:40:23,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 10:40:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:40:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 10:40:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2092, Unknown=14, NotChecked=190, Total=2550 [2022-07-22 10:40:23,029 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 51 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 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-22 10:40:50,663 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (div (+ (* v_ArrVal_243 (- 1)) (* (- 1) (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_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (- 5)) 4) (not (<= v_ArrVal_240 (+ v_ArrVal_238 (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_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_240 (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_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_238 0))))) (forall ((v_ArrVal_236 Int) (v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 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_236)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (div (+ (* (- 1) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* v_ArrVal_243 (- 1))) (- 5)) 4) (not (<= v_ArrVal_243 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_240))) (not (<= v_ArrVal_238 0)) (not (<= v_ArrVal_236 0)) (not (<= v_ArrVal_240 (+ v_ArrVal_238 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))))) is different from false [2022-07-22 10:40:52,678 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (div (+ (* v_ArrVal_243 (- 1)) (* (- 1) (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_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (- 5)) 4) (not (<= v_ArrVal_240 (+ v_ArrVal_238 (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_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_240 (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_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_238 0))))) (forall ((v_ArrVal_236 Int) (v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 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|) v_ArrVal_236)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_240 (+ v_ArrVal_238 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_240 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_238 0)) (not (<= v_ArrVal_236 0)) (<= (div (+ (* (- 1) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* v_ArrVal_243 (- 1))) (- 5)) 4)))))) is different from false [2022-07-22 10:41:13,729 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_243 Int) (v_ArrVal_240 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_238 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (div (+ (* v_ArrVal_243 (- 1)) (* (- 1) (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_243)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (- 5)) 4) (not (<= v_ArrVal_240 (+ v_ArrVal_238 (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_238)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_243 (+ v_ArrVal_240 (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_240)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_238 0))))) (or (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 20) (* c_~N~0 5)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2022-07-22 10:41:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:14,193 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2022-07-22 10:41:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-22 10:41:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 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-22 10:41:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:14,197 INFO L225 Difference]: With dead ends: 179 [2022-07-22 10:41:14,197 INFO L226 Difference]: Without dead ends: 120 [2022-07-22 10:41:14,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 78.9s TimeCoverageRelationStatistics Valid=637, Invalid=4608, Unknown=31, NotChecked=730, Total=6006 [2022-07-22 10:41:14,199 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:14,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 386 Unchecked, 0.1s Time] [2022-07-22 10:41:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-22 10:41:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-07-22 10:41:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 103 states have internal predecessors, (125), 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-22 10:41:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-07-22 10:41:14,211 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 35 [2022-07-22 10:41:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:14,211 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-07-22 10:41:14,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 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-22 10:41:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-07-22 10:41:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 10:41:14,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:14,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:14,231 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-22 10:41:14,427 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-22 10:41:14,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash -734241511, now seen corresponding path program 6 times [2022-07-22 10:41:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:14,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395694884] [2022-07-22 10:41:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:41:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395694884] [2022-07-22 10:41:14,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395694884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607987247] [2022-07-22 10:41:14,528 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:41:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:14,530 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-22 10:41:14,531 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-22 10:41:14,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:41:14,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:41:14,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 10:41:14,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:41:14,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:41:14,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607987247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:14,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:14,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2022-07-22 10:41:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995485901] [2022-07-22 10:41:14,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:14,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:41:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:41:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:41:14,770 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-22 10:41:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:15,079 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-07-22 10:41:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 10:41:15,080 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-22 10:41:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:15,080 INFO L225 Difference]: With dead ends: 125 [2022-07-22 10:41:15,081 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 10:41:15,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 10:41:15,082 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:15,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 37 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:41:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 10:41:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 40. [2022-07-22 10:41:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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-22 10:41:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-22 10:41:15,088 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2022-07-22 10:41:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-22 10:41:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-22 10:41:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-22 10:41:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 10:41:15,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:15,089 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:15,099 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-22 10:41:15,293 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-22 10:41:15,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:15,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash 518824043, now seen corresponding path program 7 times [2022-07-22 10:41:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:15,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174722033] [2022-07-22 10:41:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:15,374 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-22 10:41:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174722033] [2022-07-22 10:41:15,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174722033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140229466] [2022-07-22 10:41:15,375 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:41:15,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:15,376 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-22 10:41:15,377 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-22 10:41:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:15,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:41:15,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:15,542 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-22 10:41:15,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:15,605 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-22 10:41:15,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140229466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:41:15,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:41:15,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:41:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511897790] [2022-07-22 10:41:15,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:41:15,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:41:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:41:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:41:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:41:15,607 INFO L87 Difference]: Start difference. First operand 40 states and 42 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-22 10:41:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:41:15,898 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-07-22 10:41:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 10:41:15,904 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-22 10:41:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:41:15,905 INFO L225 Difference]: With dead ends: 109 [2022-07-22 10:41:15,905 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 10:41:15,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 10:41:15,907 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:41:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 37 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:41:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 10:41:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-07-22 10:41:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 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-22 10:41:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-07-22 10:41:15,916 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 38 [2022-07-22 10:41:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:41:15,916 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-07-22 10:41:15,916 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-22 10:41:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-07-22 10:41:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 10:41:15,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:41:15,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:41:15,936 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-22 10:41:16,123 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-22 10:41:16,124 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:41:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:41:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1270625221, now seen corresponding path program 8 times [2022-07-22 10:41:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:41:16,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660686908] [2022-07-22 10:41:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:41:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:41:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:41:17,196 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-22 10:41:17,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:41:17,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660686908] [2022-07-22 10:41:17,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660686908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:41:17,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745034613] [2022-07-22 10:41:17,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:41:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:41:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:41:17,204 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-22 10:41:17,204 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-22 10:41:17,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:41:17,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:41:17,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 10:41:17,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:41:17,288 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-22 10:41:17,360 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-22 10:41:17,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,445 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-22 10:41:17,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,566 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-22 10:41:17,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-07-22 10:41:17,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-22 10:41:17,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:17,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:17,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-22 10:41:18,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:18,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2022-07-22 10:41:18,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:41:18,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:41:18,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2022-07-22 10:41:18,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2022-07-22 10:41:18,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-07-22 10:41:18,592 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-22 10:41:18,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:41:26,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_397 Int) (v_ArrVal_395 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_393 Int) (v_ArrVal_391 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_391)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_393 0)) (<= (+ v_ArrVal_400 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 5)) (not (<= v_ArrVal_400 (+ v_ArrVal_397 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_397 (+ v_ArrVal_395 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_391 0)) (not (<= v_ArrVal_395 (+ v_ArrVal_393 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) is different from false [2022-07-22 10:41:45,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_397 Int) (v_ArrVal_395 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int) (v_ArrVal_390 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_390) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_391))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_393 0)) (not (<= v_ArrVal_390 0)) (not (<= v_ArrVal_400 (+ v_ArrVal_397 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_391 0)) (<= (+ v_ArrVal_400 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 5)) (not (<= v_ArrVal_395 (+ v_ArrVal_393 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_397 (+ v_ArrVal_395 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) is different from false [2022-07-22 10:42:41,297 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-22 10:42:41,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102296 treesize of output 101648