./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr2.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 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:09:19,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:09:19,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:09:19,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:09:19,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:09:19,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:09:19,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:09:19,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:09:19,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:09:19,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:09:19,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:09:19,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:09:19,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:09:19,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:09:19,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:09:19,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:09:19,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:09:19,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:09:19,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:09:19,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:09:19,939 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:09:19,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:09:19,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:09:19,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:09:19,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:09:19,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:09:19,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:09:19,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:09:19,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:09:19,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:09:19,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:09:19,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:09:19,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:09:19,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:09:19,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:09:19,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:09:19,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:09:19,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:09:19,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:09:19,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:09:19,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:09:19,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:09:19,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:09:19,975 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:09:19,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:09:19,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:09:19,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:09:19,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:09:19,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:09:19,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:09:19,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:09:19,978 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:09:19,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:09:19,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:09:19,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:09:19,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:09:19,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:09:19,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:09:19,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:09:19,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:09:19,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:09:19,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:09:19,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:09:19,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:09:19,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:09:19,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:09:19,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:09:19,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:09:19,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:09:19,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:09:19,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:09:19,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:09:19,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:09:19,983 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:09:19,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:09:19,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:09:19,983 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 -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2022-07-20 21:09:20,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:09:20,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:09:20,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:09:20,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:09:20,282 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:09:20,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr2.c [2022-07-20 21:09:20,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d78d1dc/8db2d112dc1d42cfa671d91370b8213b/FLAG1aacc858f [2022-07-20 21:09:20,764 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:09:20,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2022-07-20 21:09:20,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d78d1dc/8db2d112dc1d42cfa671d91370b8213b/FLAG1aacc858f [2022-07-20 21:09:21,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d78d1dc/8db2d112dc1d42cfa671d91370b8213b [2022-07-20 21:09:21,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:09:21,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:09:21,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:09:21,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:09:21,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:09:21,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d5f4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21, skipping insertion in model container [2022-07-20 21:09:21,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:09:21,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:09:21,430 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-tiling/nr2.c[394,407] [2022-07-20 21:09:21,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:09:21,461 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:09:21,475 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-tiling/nr2.c[394,407] [2022-07-20 21:09:21,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:09:21,505 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:09:21,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21 WrapperNode [2022-07-20 21:09:21,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:09:21,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:09:21,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:09:21,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:09:21,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,549 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-20 21:09:21,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:09:21,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:09:21,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:09:21,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:09:21,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:09:21,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:09:21,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:09:21,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:09:21,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (1/1) ... [2022-07-20 21:09:21,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:09:21,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:21,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 21:09:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 21:09:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:09:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:09:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:09:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:09:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:09:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:09:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:09:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:09:21,729 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:09:21,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:09:21,905 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:09:21,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:09:21,910 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:09:21,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:09:21 BoogieIcfgContainer [2022-07-20 21:09:21,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:09:21,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:09:21,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:09:21,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:09:21,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:09:21" (1/3) ... [2022-07-20 21:09:21,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cee725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:09:21, skipping insertion in model container [2022-07-20 21:09:21,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:09:21" (2/3) ... [2022-07-20 21:09:21,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cee725c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:09:21, skipping insertion in model container [2022-07-20 21:09:21,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:09:21" (3/3) ... [2022-07-20 21:09:21,932 INFO L111 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-07-20 21:09:21,945 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:09:21,946 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:09:21,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:09:21,990 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@609c3471, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c3edceb [2022-07-20 21:09:21,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:09:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:22,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-20 21:09:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:22,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577449660] [2022-07-20 21:09:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:22,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577449660] [2022-07-20 21:09:22,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577449660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:22,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:22,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:09:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637562551] [2022-07-20 21:09:22,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:22,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:09:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:22,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:09:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:09:22,187 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:22,198 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-20 21:09:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:09:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-20 21:09:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:22,205 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:09:22,206 INFO L226 Difference]: Without dead ends: 20 [2022-07-20 21:09:22,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:09:22,219 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:22,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-20 21:09:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-20 21:09:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-20 21:09:22,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-20 21:09:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:22,246 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-20 21:09:22,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-20 21:09:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:22,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:09:22,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-20 21:09:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:22,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285129980] [2022-07-20 21:09:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:22,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285129980] [2022-07-20 21:09:22,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285129980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:22,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:22,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:09:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784759126] [2022-07-20 21:09:22,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:22,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:09:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:09:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:09:22,337 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:22,375 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-20 21:09:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-20 21:09:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:22,376 INFO L225 Difference]: With dead ends: 29 [2022-07-20 21:09:22,376 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:22,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:22,378 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:22,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-20 21:09:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 21:09:22,383 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-20 21:09:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:22,384 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 21:09:22,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 21:09:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:09:22,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:09:22,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:22,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-20 21:09:22,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:22,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690972734] [2022-07-20 21:09:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:22,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690972734] [2022-07-20 21:09:22,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690972734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:22,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:22,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 21:09:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057403705] [2022-07-20 21:09:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:22,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:09:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:09:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:22,566 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:22,601 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-20 21:09:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-07-20 21:09:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:22,603 INFO L225 Difference]: With dead ends: 38 [2022-07-20 21:09:22,603 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:22,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:22,605 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:22,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-20 21:09:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 21:09:22,611 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-20 21:09:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:22,611 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 21:09:22,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 21:09:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:09:22,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 21:09:22,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-20 21:09:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:22,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723279503] [2022-07-20 21:09:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:22,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723279503] [2022-07-20 21:09:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723279503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:22,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:09:22,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:09:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489118951] [2022-07-20 21:09:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:22,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:09:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:09:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:09:22,681 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:22,699 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-20 21:09:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:09:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-20 21:09:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:22,700 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:09:22,700 INFO L226 Difference]: Without dead ends: 26 [2022-07-20 21:09:22,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:09:22,702 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:22,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-20 21:09:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-20 21:09:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 21:09:22,708 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-20 21:09:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:22,709 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 21:09:22,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 21:09:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 21:09:22,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 21:09:22,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-20 21:09:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:22,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334179401] [2022-07-20 21:09:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:22,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334179401] [2022-07-20 21:09:22,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334179401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:22,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853323300] [2022-07-20 21:09:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:22,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:22,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:22,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:09:22,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 21:09:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:22,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:09:22,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:09:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853323300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:09:22,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:09:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 21:09:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603301577] [2022-07-20 21:09:22,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:09:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:09:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:09:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:22,903 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:22,924 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-20 21:09:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:09:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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) Word has length 19 [2022-07-20 21:09:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:22,926 INFO L225 Difference]: With dead ends: 44 [2022-07-20 21:09:22,926 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:22,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:09:22,928 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:22,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 21:09:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-20 21:09:22,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2022-07-20 21:09:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:22,934 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-20 21:09:22,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-20 21:09:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:09:22,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:22,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:22,961 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-20 21:09:23,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:23,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1955154983, now seen corresponding path program 2 times [2022-07-20 21:09:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:23,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302681328] [2022-07-20 21:09:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302681328] [2022-07-20 21:09:23,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302681328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:23,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125969181] [2022-07-20 21:09:23,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:09:23,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:23,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:09:23,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 21:09:23,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:09:23,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:09:23,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:09:23,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:23,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:09:23,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125969181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:09:23,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 21:09:23,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-20 21:09:23,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382141375] [2022-07-20 21:09:23,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:09:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:09:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:09:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:09:23,405 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:23,428 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-20 21:09:23,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:09:23,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-07-20 21:09:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:23,430 INFO L225 Difference]: With dead ends: 47 [2022-07-20 21:09:23,431 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:09:23,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:09:23,432 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:23,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:09:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:09:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 21:09:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 21:09:23,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2022-07-20 21:09:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:23,444 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 21:09:23,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 21:09:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:09:23,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:23,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:23,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:09:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-20 21:09:23,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1638747735, now seen corresponding path program 1 times [2022-07-20 21:09:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018077887] [2022-07-20 21:09:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:23,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018077887] [2022-07-20 21:09:23,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018077887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220930834] [2022-07-20 21:09:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:23,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:09:23,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 21:09:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:24,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 21:09:24,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:24,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-20 21:09:24,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:09:24,236 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 24 treesize of output 23 [2022-07-20 21:09:24,309 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 15 treesize of output 7 [2022-07-20 21:09:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:24,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:09:36,504 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 27 treesize of output 25 [2022-07-20 21:09:36,512 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 196 treesize of output 192 [2022-07-20 21:09:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220930834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:09:38,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:09:38,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-07-20 21:09:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846163139] [2022-07-20 21:09:38,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:09:38,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 21:09:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 21:09:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=470, Unknown=3, NotChecked=0, Total=600 [2022-07-20 21:09:38,661 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:38,965 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-07-20 21:09:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 21:09:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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 22 [2022-07-20 21:09:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:38,967 INFO L225 Difference]: With dead ends: 91 [2022-07-20 21:09:38,967 INFO L226 Difference]: Without dead ends: 71 [2022-07-20 21:09:38,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=235, Invalid=818, Unknown=3, NotChecked=0, Total=1056 [2022-07-20 21:09:38,968 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 187 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:38,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 140 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 243 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-07-20 21:09:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-20 21:09:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2022-07-20 21:09:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-20 21:09:38,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-07-20 21:09:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:38,976 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-20 21:09:38,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-20 21:09:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 21:09:38,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:38,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:39,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 21:09:39,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:39,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -565805188, now seen corresponding path program 1 times [2022-07-20 21:09:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890487497] [2022-07-20 21:09:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:39,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890487497] [2022-07-20 21:09:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890487497] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:39,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685798754] [2022-07-20 21:09:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:39,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:09:39,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 21:09:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:39,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 21:09:39,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:39,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 21:09:39,789 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-20 21:09:39,789 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 38 treesize of output 20 [2022-07-20 21:09:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:39,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:09:39,885 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 19 treesize of output 17 [2022-07-20 21:09:39,887 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 34 treesize of output 30 [2022-07-20 21:09:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:39,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685798754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:09:39,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:09:39,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2022-07-20 21:09:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088701905] [2022-07-20 21:09:39,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:09:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 21:09:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:09:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 21:09:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-07-20 21:09:39,978 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:09:40,479 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-07-20 21:09:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 21:09:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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 28 [2022-07-20 21:09:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:09:40,482 INFO L225 Difference]: With dead ends: 102 [2022-07-20 21:09:40,482 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 21:09:40,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=410, Invalid=1942, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 21:09:40,484 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 181 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:09:40,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 142 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 282 Invalid, 0 Unknown, 3 Unchecked, 0.2s Time] [2022-07-20 21:09:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 21:09:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2022-07-20 21:09:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-07-20 21:09:40,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2022-07-20 21:09:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:09:40,502 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-07-20 21:09:40,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:09:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-07-20 21:09:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:09:40,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:09:40,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:09:40,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 21:09:40,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:40,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:09:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:09:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1346440327, now seen corresponding path program 2 times [2022-07-20 21:09:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:09:40,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741141445] [2022-07-20 21:09:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:09:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:09:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:09:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:41,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:09:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741141445] [2022-07-20 21:09:41,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741141445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:09:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737003630] [2022-07-20 21:09:41,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:09:41,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:09:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:09:41,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:09:41,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 21:09:41,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:09:41,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:09:41,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 21:09:41,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:09:41,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 21:09:41,328 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-20 21:09:41,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-20 21:09:41,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:09:41,534 INFO L356 Elim1Store]: treesize reduction 45, result has 36.6 percent of original size [2022-07-20 21:09:41,535 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 2 case distinctions, treesize of input 44 treesize of output 60 [2022-07-20 21:09:43,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:09:43,681 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 34 treesize of output 29 [2022-07-20 21:09:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:09:43,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:10:41,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_27| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_27| 2)) (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int) (v_ArrVal_86 Int) (v_ArrVal_84 Int)) (let ((.cse0 (select (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_27| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_26| 1) |v_ULTIMATE.start_main_~j~0#1_27|))))))) is different from false [2022-07-20 21:11:16,448 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 95 treesize of output 91 [2022-07-20 21:11:16,456 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 6831 treesize of output 6799 [2022-07-20 21:12:42,708 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 21:12:42,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:42,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:12:42,910 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 21:12:42,914 INFO L158 Benchmark]: Toolchain (without parser) took 201727.34ms. Allocated memory was 104.9MB in the beginning and 589.3MB in the end (delta: 484.4MB). Free memory was 71.3MB in the beginning and 264.1MB in the end (delta: -192.8MB). Peak memory consumption was 345.6MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,915 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 73.4MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:12:42,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.44ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 80.2MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.26ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,916 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 77.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,916 INFO L158 Benchmark]: RCFGBuilder took 321.08ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 66.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,916 INFO L158 Benchmark]: TraceAbstraction took 201000.05ms. Allocated memory was 104.9MB in the beginning and 589.3MB in the end (delta: 484.4MB). Free memory was 65.6MB in the beginning and 264.1MB in the end (delta: -198.6MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. [2022-07-20 21:12:42,918 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 73.4MB. Free memory was 37.2MB in the beginning and 37.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.44ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 80.2MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.26ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 77.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.08ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 66.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 201000.05ms. Allocated memory was 104.9MB in the beginning and 589.3MB in the end (delta: 484.4MB). Free memory was 65.6MB in the beginning and 264.1MB in the end (delta: -198.6MB). Peak memory consumption was 342.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 21:12:43,141 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-20 21:12:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-tiling/nr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:12:44,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:12:44,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:12:44,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:12:44,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:12:44,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:12:44,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:12:44,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:12:44,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:12:44,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:12:44,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:12:44,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:12:44,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:12:44,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:12:44,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:12:44,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:12:44,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:12:44,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:12:44,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:12:44,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:12:44,954 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:12:44,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:12:44,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:12:44,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:12:44,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:12:44,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:12:44,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:12:44,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:12:44,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:12:44,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:12:44,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:12:44,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:12:44,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:12:44,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:12:44,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:12:44,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:12:44,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:12:44,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:12:44,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:12:44,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:12:44,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:12:44,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:12:44,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 21:12:45,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:12:45,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:12:45,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:12:45,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:12:45,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:12:45,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:12:45,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:12:45,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:12:45,018 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:12:45,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:12:45,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:12:45,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:12:45,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:12:45,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:12:45,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:12:45,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:12:45,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 21:12:45,020 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 21:12:45,021 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 21:12:45,021 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:12:45,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:12:45,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:12:45,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:12:45,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:12:45,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:12:45,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:12:45,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:12:45,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:12:45,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:12:45,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:12:45,023 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 21:12:45,023 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 21:12:45,023 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:12:45,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:12:45,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:12:45,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 21:12:45,024 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 2a5d4c3d8db636946363c81d25b5c2e381fc236cdcde6b4765d7ce6e059d8a21 [2022-07-20 21:12:45,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:12:45,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:12:45,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:12:45,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:12:45,364 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:12:45,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr2.c [2022-07-20 21:12:45,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5883c3a30/9b4327d47cef4481b88210fa69bd4d04/FLAG5d90a0133 [2022-07-20 21:12:45,936 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:12:45,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2022-07-20 21:12:45,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5883c3a30/9b4327d47cef4481b88210fa69bd4d04/FLAG5d90a0133 [2022-07-20 21:12:46,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5883c3a30/9b4327d47cef4481b88210fa69bd4d04 [2022-07-20 21:12:46,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:12:46,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:12:46,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:12:46,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:12:46,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:12:46,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e5c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46, skipping insertion in model container [2022-07-20 21:12:46,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:12:46,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:12:46,561 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-tiling/nr2.c[394,407] [2022-07-20 21:12:46,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:12:46,581 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:12:46,598 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-tiling/nr2.c[394,407] [2022-07-20 21:12:46,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:12:46,632 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:12:46,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46 WrapperNode [2022-07-20 21:12:46,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:12:46,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:12:46,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:12:46,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:12:46,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,659 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-20 21:12:46,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:12:46,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:12:46,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:12:46,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:12:46,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:12:46,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:12:46,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:12:46,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:12:46,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (1/1) ... [2022-07-20 21:12:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:12:46,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:12:46,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 21:12:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 21:12:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:12:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 21:12:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:12:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 21:12:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:12:46,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:12:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 21:12:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:12:46,820 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:12:46,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:12:47,143 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:12:47,148 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:12:47,148 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:12:47,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:12:47 BoogieIcfgContainer [2022-07-20 21:12:47,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:12:47,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:12:47,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:12:47,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:12:47,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:12:46" (1/3) ... [2022-07-20 21:12:47,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e736230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:12:47, skipping insertion in model container [2022-07-20 21:12:47,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:12:46" (2/3) ... [2022-07-20 21:12:47,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e736230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:12:47, skipping insertion in model container [2022-07-20 21:12:47,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:12:47" (3/3) ... [2022-07-20 21:12:47,157 INFO L111 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-07-20 21:12:47,170 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:12:47,170 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:12:47,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:12:47,261 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@5c5d299, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@708cfdb7 [2022-07-20 21:12:47,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:12:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:12:47,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:47,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:47,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-20 21:12:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:47,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297322887] [2022-07-20 21:12:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:47,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:47,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 21:12:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:47,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 21:12:47,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:47,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:12:47,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:47,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297322887] [2022-07-20 21:12:47,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297322887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:12:47,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:12:47,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:12:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991586099] [2022-07-20 21:12:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:12:47,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:12:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:12:47,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:12:47,475 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:47,494 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-20 21:12:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:12:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-20 21:12:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:47,504 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:12:47,504 INFO L226 Difference]: Without dead ends: 20 [2022-07-20 21:12:47,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:12:47,513 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:47,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:12:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-20 21:12:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-20 21:12:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-20 21:12:47,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-20 21:12:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:47,560 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-20 21:12:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-20 21:12:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 21:12:47,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:47,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:47,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:47,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-20 21:12:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:47,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227741977] [2022-07-20 21:12:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:47,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 21:12:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:47,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:12:47,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:47,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:12:47,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:47,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227741977] [2022-07-20 21:12:47,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227741977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:12:47,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:12:47,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:12:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373412916] [2022-07-20 21:12:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:12:47,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:12:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:12:47,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:12:47,915 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:48,021 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-20 21:12:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:12:48,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-20 21:12:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:48,023 INFO L225 Difference]: With dead ends: 34 [2022-07-20 21:12:48,023 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 21:12:48,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:12:48,025 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:48,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:12:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 21:12:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-20 21:12:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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-20 21:12:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-20 21:12:48,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-07-20 21:12:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:48,031 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-20 21:12:48,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-20 21:12:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:12:48,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:48,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:48,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:48,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -715226615, now seen corresponding path program 1 times [2022-07-20 21:12:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713946759] [2022-07-20 21:12:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:48,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:48,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:48,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 21:12:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:48,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 21:12:48,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:48,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:12:48,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713946759] [2022-07-20 21:12:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713946759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:12:48,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:12:48,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:12:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369298690] [2022-07-20 21:12:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:12:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:12:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:12:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:12:48,295 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:48,323 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-20 21:12:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:12:48,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-20 21:12:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:48,325 INFO L225 Difference]: With dead ends: 38 [2022-07-20 21:12:48,325 INFO L226 Difference]: Without dead ends: 24 [2022-07-20 21:12:48,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:12:48,327 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:48,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:12:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-20 21:12:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-20 21:12:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 21:12:48,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-07-20 21:12:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:48,332 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 21:12:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 21:12:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 21:12:48,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:48,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:48,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-20 21:12:48,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1618608002, now seen corresponding path program 1 times [2022-07-20 21:12:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:48,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791703540] [2022-07-20 21:12:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:48,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:48,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 21:12:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:48,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:12:48,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:48,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:48,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:48,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791703540] [2022-07-20 21:12:48,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791703540] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:48,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:12:48,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 21:12:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915842493] [2022-07-20 21:12:48,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:48,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 21:12:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 21:12:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:12:48,677 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:48,747 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-07-20 21:12:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:12:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 19 [2022-07-20 21:12:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:48,749 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:12:48,749 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:12:48,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:12:48,750 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:48,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:12:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:12:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-20 21:12:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-20 21:12:48,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-07-20 21:12:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:48,756 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-20 21:12:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-20 21:12:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:12:48,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:48,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:48,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1955095401, now seen corresponding path program 2 times [2022-07-20 21:12:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:48,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329623870] [2022-07-20 21:12:48,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:12:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:48,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:48,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 21:12:48,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 21:12:48,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:12:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:12:49,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 21:12:49,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:12:49,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:49,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329623870] [2022-07-20 21:12:49,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329623870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:12:49,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:12:49,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:12:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021177314] [2022-07-20 21:12:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:12:49,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:12:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:12:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:12:49,021 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 21:12:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:49,051 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-20 21:12:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:12:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Word has length 22 [2022-07-20 21:12:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:49,052 INFO L225 Difference]: With dead ends: 35 [2022-07-20 21:12:49,052 INFO L226 Difference]: Without dead ends: 33 [2022-07-20 21:12:49,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:12:49,054 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:49,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:12:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-20 21:12:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-20 21:12:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-20 21:12:49,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 22 [2022-07-20 21:12:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:49,059 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-20 21:12:49,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-20 21:12:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-20 21:12:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:12:49,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:49,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:49,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:49,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:49,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1955154983, now seen corresponding path program 1 times [2022-07-20 21:12:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181374736] [2022-07-20 21:12:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:49,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:49,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:49,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:49,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 21:12:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:49,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:12:49,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:49,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:49,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:49,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181374736] [2022-07-20 21:12:49,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181374736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:49,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:12:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 21:12:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102467100] [2022-07-20 21:12:49,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:49,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 21:12:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 21:12:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:12:49,507 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:49,643 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-20 21:12:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 21:12:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 22 [2022-07-20 21:12:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:49,646 INFO L225 Difference]: With dead ends: 47 [2022-07-20 21:12:49,646 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:12:49,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 21:12:49,648 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:49,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 50 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:12:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:12:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 21:12:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-20 21:12:49,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2022-07-20 21:12:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:49,658 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-20 21:12:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-20 21:12:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:12:49,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:49,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:49,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:49,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:49,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1638747735, now seen corresponding path program 1 times [2022-07-20 21:12:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:49,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915934547] [2022-07-20 21:12:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:49,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:49,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:49,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 21:12:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:49,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 21:12:49,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:50,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-20 21:12:50,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:12:50,171 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 21 treesize of output 20 [2022-07-20 21:12:50,262 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 29 treesize of output 17 [2022-07-20 21:12:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:50,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:50,538 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 31 treesize of output 29 [2022-07-20 21:12:50,556 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 222 treesize of output 218 [2022-07-20 21:12:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:50,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:50,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915934547] [2022-07-20 21:12:50,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915934547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:50,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:12:50,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-20 21:12:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123816461] [2022-07-20 21:12:50,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:50,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:12:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:12:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:12:50,897 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-20 21:12:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:51,581 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-20 21:12:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 21:12:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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) Word has length 22 [2022-07-20 21:12:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:51,584 INFO L225 Difference]: With dead ends: 99 [2022-07-20 21:12:51,584 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 21:12:51,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-20 21:12:51,585 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 105 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:51,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 154 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-07-20 21:12:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 21:12:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 42. [2022-07-20 21:12:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-20 21:12:51,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 22 [2022-07-20 21:12:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:51,594 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-20 21:12:51,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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-20 21:12:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-20 21:12:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 21:12:51,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:51,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:51,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:51,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:51,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 271931977, now seen corresponding path program 2 times [2022-07-20 21:12:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:51,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818422127] [2022-07-20 21:12:51,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:12:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:51,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:51,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 21:12:51,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:12:51,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:12:51,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:12:51,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:12:51,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:12:51,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818422127] [2022-07-20 21:12:51,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818422127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:51,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:12:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 21:12:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540854860] [2022-07-20 21:12:51,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:51,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 21:12:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 21:12:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:12:51,958 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:52,043 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-20 21:12:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:12:52,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 28 [2022-07-20 21:12:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:52,051 INFO L225 Difference]: With dead ends: 67 [2022-07-20 21:12:52,051 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 21:12:52,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:12:52,052 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:52,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:12:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 21:12:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-20 21:12:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-20 21:12:52,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2022-07-20 21:12:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:52,066 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-20 21:12:52,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-20 21:12:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 21:12:52,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:52,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:52,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:52,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:52,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash -565805188, now seen corresponding path program 1 times [2022-07-20 21:12:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:52,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244441644] [2022-07-20 21:12:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:12:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:52,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:52,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 21:12:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:12:52,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 21:12:52,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:52,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 21:12:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:52,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:12:52,717 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 20 treesize of output 18 [2022-07-20 21:12:52,721 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 36 treesize of output 32 [2022-07-20 21:12:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:52,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:12:52,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244441644] [2022-07-20 21:12:52,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244441644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:12:52,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:12:52,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-20 21:12:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309411404] [2022-07-20 21:12:52,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:12:52,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 21:12:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:12:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 21:12:52,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-20 21:12:52,882 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:12:53,616 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-20 21:12:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 21:12:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 28 [2022-07-20 21:12:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:12:53,617 INFO L225 Difference]: With dead ends: 81 [2022-07-20 21:12:53,617 INFO L226 Difference]: Without dead ends: 79 [2022-07-20 21:12:53,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=834, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 21:12:53,618 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 157 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 21:12:53,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 160 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 21:12:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-20 21:12:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 45. [2022-07-20 21:12:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-07-20 21:12:53,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2022-07-20 21:12:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:12:53,626 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-07-20 21:12:53,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:12:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-07-20 21:12:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:12:53,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:12:53,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:12:53,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 21:12:53,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:12:53,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:12:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:12:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1346440327, now seen corresponding path program 3 times [2022-07-20 21:12:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:12:53,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485439431] [2022-07-20 21:12:53,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:12:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:12:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:12:53,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:12:53,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 21:12:53,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 21:12:53,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:12:53,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 21:12:53,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:12:53,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-20 21:12:54,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:12:54,079 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-20 21:12:54,199 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-20 21:12:54,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-07-20 21:12:54,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:12:54,417 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 36 treesize of output 35 [2022-07-20 21:12:54,506 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 29 treesize of output 17 [2022-07-20 21:12:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:12:54,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:02,150 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 57 treesize of output 55 [2022-07-20 21:13:02,157 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 8464 treesize of output 8432 [2022-07-20 21:13:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:13:13,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:13:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485439431] [2022-07-20 21:13:13,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485439431] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:13,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:13:13,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-20 21:13:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757732144] [2022-07-20 21:13:13,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 21:13:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:13:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 21:13:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=554, Unknown=4, NotChecked=0, Total=702 [2022-07-20 21:13:13,201 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:15,481 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (= (select .cse0 (bvadd (_ bv4294967280 32) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (_ bv2 32)) (= (bvadd (_ bv16 32) (bvmul (bvneg (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (_ bv4 32))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (bvsge (select .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse2 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse2 (bvmul (_ bv4 32) (bvneg .cse1)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-20 21:13:17,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (or (= (select .cse0 (bvadd (_ bv4294967280 32) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (_ bv2 32)) (= (bvadd (_ bv16 32) (bvmul (bvneg (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (_ bv4 32))) (_ bv0 32))) (= (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv1 32)) (= (_ bv2 32) (select .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse2 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse2 (bvmul (_ bv4 32) (bvneg .cse1)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|))) is different from false [2022-07-20 21:13:19,529 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32)) (|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (not (bvsge .cse0 (_ bv1 32))) (bvsge .cse0 |c_ULTIMATE.start_main_~MINVAL~0#1|) (bvsge (select (let ((.cse1 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (_ bv8 32) (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd (_ bv8 32) .cse1 (bvmul (_ bv4 32) (bvneg .cse0)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|)) is different from false [2022-07-20 21:13:21,542 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |c_ULTIMATE.start_main_~MINVAL~0#1|) (forall ((|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (bvsge (select (let ((.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd .cse0 (bvmul (_ bv4 32) (bvneg (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|))))) is different from false [2022-07-20 21:13:23,605 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_67 (_ BitVec 32))) (bvsge (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (_ bv4 32) (bvneg |c_ULTIMATE.start_main_~j~0#1|)) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (bvsge |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~MINVAL~0#1|)) (forall ((|ULTIMATE.start_main_~j~0#1| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) (or (forall ((v_ArrVal_66 (_ BitVec 32)) (v_ArrVal_67 (_ BitVec 32))) (bvsge (select (let ((.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (bvadd (bvmul (bvneg |ULTIMATE.start_main_~j~0#1|) (_ bv4 32)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_66) (bvadd .cse0 (bvmul (_ bv4 32) (bvneg (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|))) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_67)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (not (bvsge .cse1 (_ bv1 32))) (bvsge .cse1 |c_ULTIMATE.start_main_~MINVAL~0#1|))))) is different from false [2022-07-20 21:13:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:23,839 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-07-20 21:13:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 21:13:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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 31 [2022-07-20 21:13:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:23,841 INFO L225 Difference]: With dead ends: 117 [2022-07-20 21:13:23,841 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 21:13:23,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=223, Invalid=910, Unknown=9, NotChecked=340, Total=1482 [2022-07-20 21:13:23,844 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:23,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 170 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 277 Unchecked, 0.3s Time] [2022-07-20 21:13:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 21:13:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2022-07-20 21:13:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-07-20 21:13:23,861 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 31 [2022-07-20 21:13:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:23,861 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-07-20 21:13:23,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-07-20 21:13:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 21:13:23,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:23,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:23,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 21:13:24,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:13:24,073 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash 321872655, now seen corresponding path program 2 times [2022-07-20 21:13:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:13:24,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459618092] [2022-07-20 21:13:24,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:13:24,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:13:24,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:13:24,076 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:13:24,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 21:13:24,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:13:24,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:24,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 21:13:24,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 21:13:25,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 21:13:27,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:13:27,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459618092] [2022-07-20 21:13:27,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459618092] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:27,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:13:27,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2022-07-20 21:13:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294428781] [2022-07-20 21:13:27,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:13:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:13:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:13:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:13:27,601 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:28,888 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-07-20 21:13:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 21:13:28,892 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 21:13:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:28,892 INFO L225 Difference]: With dead ends: 101 [2022-07-20 21:13:28,893 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 21:13:28,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-07-20 21:13:28,894 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:28,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 137 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 21:13:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 21:13:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-07-20 21:13:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-20 21:13:28,902 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-07-20 21:13:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:28,903 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-20 21:13:28,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-20 21:13:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 21:13:28,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:28,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:28,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 21:13:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:13:29,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1630657204, now seen corresponding path program 3 times [2022-07-20 21:13:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:13:29,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406266621] [2022-07-20 21:13:29,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:13:29,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:13:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:13:29,115 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:13:29,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 21:13:29,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 21:13:29,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:29,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 21:13:29,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:29,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 21:13:29,357 INFO L356 Elim1Store]: treesize reduction 28, result has 41.7 percent of original size [2022-07-20 21:13:29,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2022-07-20 21:13:29,509 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-07-20 21:13:29,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-20 21:13:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:13:29,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:32,401 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 44 treesize of output 42 [2022-07-20 21:13:32,405 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 754 treesize of output 738 [2022-07-20 21:13:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:13:36,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:13:36,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406266621] [2022-07-20 21:13:36,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406266621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:36,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:13:36,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-07-20 21:13:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069214019] [2022-07-20 21:13:36,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:36,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 21:13:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:13:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 21:13:36,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=571, Unknown=2, NotChecked=0, Total=702 [2022-07-20 21:13:36,328 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:37,284 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-07-20 21:13:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 21:13:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 21:13:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:37,285 INFO L225 Difference]: With dead ends: 89 [2022-07-20 21:13:37,285 INFO L226 Difference]: Without dead ends: 87 [2022-07-20 21:13:37,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=438, Invalid=1366, Unknown=2, NotChecked=0, Total=1806 [2022-07-20 21:13:37,286 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 125 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:37,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 150 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 243 Invalid, 0 Unknown, 94 Unchecked, 0.3s Time] [2022-07-20 21:13:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-20 21:13:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-07-20 21:13:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-07-20 21:13:37,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 37 [2022-07-20 21:13:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-07-20 21:13:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 27 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-07-20 21:13:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:13:37,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:37,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:37,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 21:13:37,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:13:37,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1907846367, now seen corresponding path program 4 times [2022-07-20 21:13:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:13:37,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104050525] [2022-07-20 21:13:37,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:13:37,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:13:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:13:37,511 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:13:37,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 21:13:37,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:13:37,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:37,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 21:13:37,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:37,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 21:13:37,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:37,752 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-20 21:13:37,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:37,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 21:13:37,905 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 29 treesize of output 17 [2022-07-20 21:13:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 21:13:37,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:39,238 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 36 treesize of output 34 [2022-07-20 21:13:39,241 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 974 treesize of output 958 [2022-07-20 21:13:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 21:13:39,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:13:39,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104050525] [2022-07-20 21:13:39,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104050525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:39,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:13:39,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-07-20 21:13:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098625169] [2022-07-20 21:13:39,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:39,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 21:13:39,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:13:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 21:13:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-07-20 21:13:39,585 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:41,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 21:13:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:42,122 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-07-20 21:13:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 21:13:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 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 43 [2022-07-20 21:13:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:42,124 INFO L225 Difference]: With dead ends: 90 [2022-07-20 21:13:42,124 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 21:13:42,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2022-07-20 21:13:42,125 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:42,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 193 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 1 Unknown, 61 Unchecked, 2.4s Time] [2022-07-20 21:13:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 21:13:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-07-20 21:13:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 75 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-20 21:13:42,136 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 43 [2022-07-20 21:13:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:42,136 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-20 21:13:42,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:13:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-20 21:13:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:13:42,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:42,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:42,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 21:13:42,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:13:42,347 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1514819357, now seen corresponding path program 5 times [2022-07-20 21:13:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:13:42,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518179159] [2022-07-20 21:13:42,348 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 21:13:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:13:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:13:42,349 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:13:42,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 21:13:42,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 21:13:42,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:42,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 21:13:42,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:42,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-20 21:13:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:42,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 21:13:43,217 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 29 treesize of output 17 [2022-07-20 21:13:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:13:43,241 INFO L328 TraceCheckSpWp]: Computing backward predicates...