./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-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-?-791161d [2022-07-22 09:46:37,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 09:46:37,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 09:46:37,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 09:46:37,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 09:46:37,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 09:46:37,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 09:46:37,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 09:46:37,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 09:46:37,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 09:46:37,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 09:46:37,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 09:46:37,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 09:46:38,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 09:46:38,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 09:46:38,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 09:46:38,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 09:46:38,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 09:46:38,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 09:46:38,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 09:46:38,015 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 09:46:38,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 09:46:38,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 09:46:38,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 09:46:38,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 09:46:38,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 09:46:38,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 09:46:38,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 09:46:38,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 09:46:38,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 09:46:38,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 09:46:38,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 09:46:38,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 09:46:38,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 09:46:38,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 09:46:38,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 09:46:38,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 09:46:38,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 09:46:38,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 09:46:38,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 09:46:38,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 09:46:38,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 09:46:38,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 09:46:38,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 09:46:38,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 09:46:38,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 09:46:38,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 09:46:38,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 09:46:38,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 09:46:38,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 09:46:38,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 09:46:38,070 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 09:46:38,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 09:46:38,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 09:46:38,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 09:46:38,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 09:46:38,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 09:46:38,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 09:46:38,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 09:46:38,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 09:46:38,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 09:46:38,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 09:46:38,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 09:46:38,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 09:46:38,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 09:46:38,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 09:46:38,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 09:46:38,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:46:38,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 09:46:38,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 09:46:38,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 09:46:38,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 09:46:38,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 09:46:38,076 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 09:46:38,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 09:46:38,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 09:46:38,076 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-22 09:46:38,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 09:46:38,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 09:46:38,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 09:46:38,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 09:46:38,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 09:46:38,367 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-22 09:46:38,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba8fb3c7/08d75a61eefd48d1a2aff07c0d3e196d/FLAG897286aa4 [2022-07-22 09:46:38,832 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 09:46:38,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr2.c [2022-07-22 09:46:38,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba8fb3c7/08d75a61eefd48d1a2aff07c0d3e196d/FLAG897286aa4 [2022-07-22 09:46:39,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba8fb3c7/08d75a61eefd48d1a2aff07c0d3e196d [2022-07-22 09:46:39,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 09:46:39,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 09:46:39,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 09:46:39,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 09:46:39,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 09:46:39,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bbe8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39, skipping insertion in model container [2022-07-22 09:46:39,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 09:46:39,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 09:46:39,360 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-22 09:46:39,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:46:39,402 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 09:46:39,416 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-22 09:46:39,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 09:46:39,447 INFO L208 MainTranslator]: Completed translation [2022-07-22 09:46:39,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39 WrapperNode [2022-07-22 09:46:39,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 09:46:39,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 09:46:39,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 09:46:39,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 09:46:39,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,496 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-22 09:46:39,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 09:46:39,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 09:46:39,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 09:46:39,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 09:46:39,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 09:46:39,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 09:46:39,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 09:46:39,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 09:46:39,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (1/1) ... [2022-07-22 09:46:39,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 09:46:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:39,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 09:46:39,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 09:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 09:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 09:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 09:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 09:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 09:46:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 09:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 09:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 09:46:39,730 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 09:46:39,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 09:46:39,856 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 09:46:39,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 09:46:39,868 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 09:46:39,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:46:39 BoogieIcfgContainer [2022-07-22 09:46:39,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 09:46:39,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 09:46:39,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 09:46:39,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 09:46:39,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:46:39" (1/3) ... [2022-07-22 09:46:39,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd21b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:46:39, skipping insertion in model container [2022-07-22 09:46:39,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:46:39" (2/3) ... [2022-07-22 09:46:39,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd21b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:46:39, skipping insertion in model container [2022-07-22 09:46:39,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:46:39" (3/3) ... [2022-07-22 09:46:39,900 INFO L111 eAbstractionObserver]: Analyzing ICFG nr2.c [2022-07-22 09:46:39,913 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 09:46:39,920 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 09:46:39,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 09:46:39,978 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@690b91a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72d1be02 [2022-07-22 09:46:39,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 09:46:39,982 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-22 09:46:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:46:39,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:39,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:39,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:39,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-22 09:46:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469948111] [2022-07-22 09:46:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469948111] [2022-07-22 09:46:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469948111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:46:40,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:46:40,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 09:46:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467962685] [2022-07-22 09:46:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:46:40,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 09:46:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 09:46:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 09:46:40,179 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-22 09:46:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:40,199 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-22 09:46:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 09:46:40,202 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-22 09:46:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:40,209 INFO L225 Difference]: With dead ends: 45 [2022-07-22 09:46:40,209 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 09:46:40,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 09:46:40,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-22 09:46:40,220 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-22 09:46:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 09:46:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 09:46:40,249 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-22 09:46:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-22 09:46:40,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-22 09:46:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:40,253 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-22 09:46:40,254 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-22 09:46:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-22 09:46:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:46:40,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:40,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 09:46:40,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-22 09:46:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:40,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008896843] [2022-07-22 09:46:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008896843] [2022-07-22 09:46:40,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008896843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:46:40,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:46:40,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 09:46:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121883088] [2022-07-22 09:46:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:46:40,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 09:46:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:40,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 09:46:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 09:46:40,373 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-22 09:46:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:40,408 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-22 09:46:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:46:40,408 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-22 09:46:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:40,409 INFO L225 Difference]: With dead ends: 29 [2022-07-22 09:46:40,409 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:46:40,410 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-22 09:46:40,411 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-22 09:46:40,412 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-22 09:46:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:46:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-22 09:46:40,416 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-22 09:46:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 09:46:40,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-22 09:46:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:40,417 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 09:46:40,417 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-22 09:46:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 09:46:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 09:46:40,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:40,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 09:46:40,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-22 09:46:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667870660] [2022-07-22 09:46:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:40,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667870660] [2022-07-22 09:46:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667870660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:46:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:46:40,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 09:46:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912434584] [2022-07-22 09:46:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:46:40,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:46:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:46:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 09:46:40,590 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-22 09:46:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:40,630 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-22 09:46:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:46:40,634 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-22 09:46:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:40,634 INFO L225 Difference]: With dead ends: 38 [2022-07-22 09:46:40,635 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:46:40,635 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-22 09:46:40,636 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-22 09:46:40,637 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-22 09:46:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:46:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-22 09:46:40,642 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-22 09:46:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 09:46:40,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-22 09:46:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:40,643 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 09:46:40,644 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-22 09:46:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 09:46:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 09:46:40,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:40,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:46:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 09:46:40,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-22 09:46:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811856749] [2022-07-22 09:46:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,733 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-22 09:46:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811856749] [2022-07-22 09:46:40,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811856749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:46:40,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 09:46:40,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 09:46:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427622809] [2022-07-22 09:46:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:46:40,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 09:46:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 09:46:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 09:46:40,742 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-22 09:46:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:40,774 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-22 09:46:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 09:46:40,775 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-22 09:46:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:40,777 INFO L225 Difference]: With dead ends: 42 [2022-07-22 09:46:40,777 INFO L226 Difference]: Without dead ends: 26 [2022-07-22 09:46:40,778 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-22 09:46:40,780 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-22 09:46:40,780 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-22 09:46:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-22 09:46:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-22 09:46:40,785 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-22 09:46:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 09:46:40,786 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-22 09:46:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:40,787 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 09:46:40,787 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-22 09:46:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 09:46:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 09:46:40,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:40,788 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-22 09:46:40,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 09:46:40,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-22 09:46:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:40,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708931508] [2022-07-22 09:46:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,843 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-22 09:46:40,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:40,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708931508] [2022-07-22 09:46:40,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708931508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:40,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694246785] [2022-07-22 09:46:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:40,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:40,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 09:46:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:40,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 09:46:40,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:40,980 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-22 09:46:40,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:46:40,992 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-22 09:46:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694246785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:46:40,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:46:40,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-22 09:46:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35777911] [2022-07-22 09:46:40,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:46:40,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:46:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:46:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 09:46:40,995 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-22 09:46:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:41,034 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-22 09:46:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 09:46:41,035 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-22 09:46:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:41,036 INFO L225 Difference]: With dead ends: 44 [2022-07-22 09:46:41,037 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:46:41,038 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-22 09:46:41,039 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-22 09:46:41,042 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-22 09:46:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:46:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 09:46:41,048 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-22 09:46:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-07-22 09:46:41,051 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2022-07-22 09:46:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-07-22 09:46:41,052 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-22 09:46:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-07-22 09:46:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 09:46:41,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:41,054 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-22 09:46:41,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 09:46:41,278 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-22 09:46:41,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1955154983, now seen corresponding path program 2 times [2022-07-22 09:46:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71391996] [2022-07-22 09:46:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:46:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71391996] [2022-07-22 09:46:41,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71391996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:41,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322663701] [2022-07-22 09:46:41,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:46:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:41,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:41,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:41,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 09:46:41,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:46:41,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:46:41,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 09:46:41,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:41,448 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-22 09:46:41,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 09:46:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322663701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:46:41,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 09:46:41,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-22 09:46:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008718224] [2022-07-22 09:46:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:46:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:46:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:46:41,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:46:41,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-22 09:46:41,452 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-22 09:46:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:46:41,481 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-22 09:46:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:46:41,482 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-22 09:46:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:46:41,484 INFO L225 Difference]: With dead ends: 47 [2022-07-22 09:46:41,484 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 09:46:41,485 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-22 09:46:41,490 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-22 09:46:41,491 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-22 09:46:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 09:46:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 09:46:41,503 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-22 09:46:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-22 09:46:41,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2022-07-22 09:46:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:46:41,508 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-22 09:46:41,508 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-22 09:46:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-22 09:46:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 09:46:41,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:46:41,510 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-22 09:46:41,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 09:46:41,736 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-22 09:46:41,736 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:46:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:46:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1638747735, now seen corresponding path program 1 times [2022-07-22 09:46:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:46:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793516668] [2022-07-22 09:46:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:46:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:42,074 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-22 09:46:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:46:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793516668] [2022-07-22 09:46:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793516668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:46:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91537273] [2022-07-22 09:46:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:46:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:46:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:46:42,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:46:42,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 09:46:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:46:42,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 09:46:42,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:46:42,254 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-22 09:46:42,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:46:42,337 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-22 09:46:42,412 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-22 09:46:42,451 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-22 09:46:42,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:02,620 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-22 09:47:02,626 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-22 09:47:04,767 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-22 09:47:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91537273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:04,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:04,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-07-22 09:47:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732461166] [2022-07-22 09:47:04,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 09:47:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:04,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 09:47:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=462, Unknown=11, NotChecked=0, Total=600 [2022-07-22 09:47:04,770 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-22 09:47:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:07,117 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-07-22 09:47:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 09:47:07,120 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-22 09:47:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:07,120 INFO L225 Difference]: With dead ends: 91 [2022-07-22 09:47:07,120 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 09:47:07,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=235, Invalid=809, Unknown=12, NotChecked=0, Total=1056 [2022-07-22 09:47:07,125 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:47:07,126 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.2s Time] [2022-07-22 09:47:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 09:47:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2022-07-22 09:47:07,135 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-22 09:47:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-22 09:47:07,136 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-07-22 09:47:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:07,142 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 09:47:07,143 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-22 09:47:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-22 09:47:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 09:47:07,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:07,144 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-22 09:47:07,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:07,359 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-22 09:47:07,360 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:07,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash -565805188, now seen corresponding path program 1 times [2022-07-22 09:47:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:07,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198329671] [2022-07-22 09:47:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:07,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198329671] [2022-07-22 09:47:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198329671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611897506] [2022-07-22 09:47:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:07,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:07,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:07,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 09:47:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:07,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 09:47:07,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:07,726 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-22 09:47:07,914 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-22 09:47:07,915 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-22 09:47:07,933 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-22 09:47:07,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:08,006 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-22 09:47:08,009 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-22 09:47:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:47:08,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611897506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:47:08,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:47:08,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2022-07-22 09:47:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106848180] [2022-07-22 09:47:08,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:47:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 09:47:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:47:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 09:47:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-07-22 09:47:08,097 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-22 09:47:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:47:08,654 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-07-22 09:47:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 09:47:08,655 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-22 09:47:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:47:08,656 INFO L225 Difference]: With dead ends: 102 [2022-07-22 09:47:08,656 INFO L226 Difference]: Without dead ends: 100 [2022-07-22 09:47:08,657 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-22 09:47:08,657 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 181 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 09:47:08,658 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-22 09:47:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-22 09:47:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 59. [2022-07-22 09:47:08,670 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-22 09:47:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-07-22 09:47:08,674 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2022-07-22 09:47:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:47:08,674 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-07-22 09:47:08,674 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-22 09:47:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-07-22 09:47:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 09:47:08,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:47:08,677 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-22 09:47:08,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 09:47:08,891 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-22 09:47:08,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:47:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:47:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1346440327, now seen corresponding path program 2 times [2022-07-22 09:47:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:47:08,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836599729] [2022-07-22 09:47:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:47:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:47:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:47:09,283 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-22 09:47:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:47:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836599729] [2022-07-22 09:47:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836599729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:47:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989573825] [2022-07-22 09:47:09,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:47:09,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:47:09,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:47:09,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:47:09,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 09:47:09,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:47:09,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:47:09,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-22 09:47:09,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:47:09,418 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-22 09:47:09,474 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-22 09:47:09,474 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-22 09:47:09,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:09,686 INFO L356 Elim1Store]: treesize reduction 45, result has 36.6 percent of original size [2022-07-22 09:47:09,687 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 47 treesize of output 59 [2022-07-22 09:47:09,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 09:47:09,774 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-22 09:47:09,952 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-22 09:47:09,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:47:59,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_25| 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|) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |v_ULTIMATE.start_main_~j~0#1_26|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_26| 2)))) is different from false [2022-07-22 09:48:30,321 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-22 09:48:30,329 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 13711 treesize of output 13647 [2022-07-22 09:48:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 4 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 09:48:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989573825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:48:57,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:48:57,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 43 [2022-07-22 09:48:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512792381] [2022-07-22 09:48:57,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:48:57,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-22 09:48:57,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:48:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-22 09:48:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1415, Unknown=51, NotChecked=80, Total=1806 [2022-07-22 09:48:57,965 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 43 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:49:00,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_25| 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|) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |v_ULTIMATE.start_main_~j~0#1_26|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_26| 2)))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (= 2 (select .cse2 0)) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4) (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse3 0) (and (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8)))) (<= 2 .cse3)))))) is different from false [2022-07-22 09:49:05,344 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 0))) (or (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 .cse0)) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_30| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_30|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_25| Int) (v_ArrVal_86 Int) (v_ArrVal_84 Int)) (let ((.cse1 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_30| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) .cse2 |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| .cse1) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |v_ULTIMATE.start_main_~j~0#1_26|)) (= .cse1 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_26| 2)))))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_25| Int) (|v_ULTIMATE.start_main_~j~0#1_26| Int) (v_ArrVal_86 Int) (|v_ULTIMATE.start_main_~i~0#1_30| Int) (v_ArrVal_84 Int)) (let ((.cse3 (select (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_30| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_30|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_26| 2)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |v_ULTIMATE.start_main_~j~0#1_26|)) (= 0 .cse3) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse3)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 09:49:07,360 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|v_ULTIMATE.start_main_~j~0#1_26| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_25| 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|) (+ (* |v_ULTIMATE.start_main_~j~0#1_26| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_84) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |v_ULTIMATE.start_main_~j~0#1_26|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_26| 2)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 0)) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4) (* 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-22 09:49:13,999 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|v_ULTIMATE.start_main_~j~0#1_25| 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 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_84) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |c_ULTIMATE.start_main_~j~0#1|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0)))) (not (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) 0)) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_25| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_86 Int)) (let ((.cse2 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2))))))) is different from false [2022-07-22 09:49:16,003 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_25| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_25| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_86 Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (* |v_ULTIMATE.start_main_~j~0#1_25| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_86) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0))))))) is different from false [2022-07-22 09:50:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:14,983 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2022-07-22 09:50:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-22 09:50:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 43 states have internal predecessors, (85), 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-22 09:50:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:14,986 INFO L225 Difference]: With dead ends: 159 [2022-07-22 09:50:14,986 INFO L226 Difference]: Without dead ends: 157 [2022-07-22 09:50:14,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 159.3s TimeCoverageRelationStatistics Valid=711, Invalid=3932, Unknown=73, NotChecked=834, Total=5550 [2022-07-22 09:50:14,988 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 119 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:14,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 321 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 415 Invalid, 0 Unknown, 398 Unchecked, 0.3s Time] [2022-07-22 09:50:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-22 09:50:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 87. [2022-07-22 09:50:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.255813953488372) internal successors, (108), 86 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2022-07-22 09:50:15,003 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 31 [2022-07-22 09:50:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:15,004 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2022-07-22 09:50:15,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 43 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-07-22 09:50:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 09:50:15,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:15,005 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-22 09:50:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 09:50:15,206 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-22 09:50:15,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 321872655, now seen corresponding path program 2 times [2022-07-22 09:50:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:15,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317208889] [2022-07-22 09:50:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317208889] [2022-07-22 09:50:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317208889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824239281] [2022-07-22 09:50:15,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 09:50:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:15,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:15,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 09:50:15,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 09:50:15,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:15,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 09:50:15,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:15,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:50:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:15,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824239281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:50:15,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:50:15,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-07-22 09:50:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505370310] [2022-07-22 09:50:15,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:50:15,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 09:50:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 09:50:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2022-07-22 09:50:15,881 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 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-22 09:50:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:16,066 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2022-07-22 09:50:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 09:50:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 09:50:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:16,068 INFO L225 Difference]: With dead ends: 130 [2022-07-22 09:50:16,068 INFO L226 Difference]: Without dead ends: 106 [2022-07-22 09:50:16,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2022-07-22 09:50:16,070 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 221 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:16,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 137 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 09:50:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-22 09:50:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2022-07-22 09:50:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2022-07-22 09:50:16,084 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 34 [2022-07-22 09:50:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:16,084 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2022-07-22 09:50:16,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 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-22 09:50:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-07-22 09:50:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 09:50:16,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:16,086 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-22 09:50:16,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 09:50:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:16,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1630657204, now seen corresponding path program 3 times [2022-07-22 09:50:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:16,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331343020] [2022-07-22 09:50:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:50:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331343020] [2022-07-22 09:50:16,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331343020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:16,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489433845] [2022-07-22 09:50:16,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 09:50:16,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:16,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:16,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 09:50:16,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-22 09:50:16,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:16,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 09:50:16,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:16,805 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-22 09:50:16,869 INFO L356 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-07-22 09:50:16,869 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 26 treesize of output 37 [2022-07-22 09:50:16,958 INFO L356 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-07-22 09:50:16,958 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 40 treesize of output 51 [2022-07-22 09:50:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 09:50:17,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:50:18,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) is different from false [2022-07-22 09:50:20,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_46| Int)) (or (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_46| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_46|)))) is different from false [2022-07-22 09:50:20,141 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 39 treesize of output 37 [2022-07-22 09:50:20,145 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 468 treesize of output 460 [2022-07-22 09:50:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-07-22 09:50:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489433845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:50:20,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:50:20,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2022-07-22 09:50:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588592738] [2022-07-22 09:50:20,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:50:20,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-22 09:50:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 09:50:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=857, Unknown=2, NotChecked=126, Total=1190 [2022-07-22 09:50:20,323 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:22,383 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (and (< (+ 3 (* |c_ULTIMATE.start_main_~j~0#1| 4)) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_46| Int)) (or (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_46| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_46|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)))) 0) (<= 1 |c_ULTIMATE.start_main_~j~0#1|) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-07-22 09:50:24,387 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_46| Int)) (or (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_46| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_46|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4) 0) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-22 09:50:24,903 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4) 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-22 09:50:25,428 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~j~0#1_39| Int) (v_ArrVal_124 Int) (v_ArrVal_121 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_39|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_39| 1))) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_121) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_39| (- 4))) v_ArrVal_124)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4) 0) (= (+ (- 2) |c_ULTIMATE.start_main_~j~0#1|) 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-22 09:50:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:25,981 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2022-07-22 09:50:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-22 09:50:25,982 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 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-22 09:50:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:25,982 INFO L225 Difference]: With dead ends: 192 [2022-07-22 09:50:25,983 INFO L226 Difference]: Without dead ends: 190 [2022-07-22 09:50:25,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=529, Invalid=2245, Unknown=6, NotChecked=642, Total=3422 [2022-07-22 09:50:25,984 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 232 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:25,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 224 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 445 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2022-07-22 09:50:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-22 09:50:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 98. [2022-07-22 09:50:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2022-07-22 09:50:26,001 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 37 [2022-07-22 09:50:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:26,002 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2022-07-22 09:50:26,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2022-07-22 09:50:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 09:50:26,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:26,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:50:26,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 09:50:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:26,220 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -695744907, now seen corresponding path program 4 times [2022-07-22 09:50:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807160729] [2022-07-22 09:50:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 09:50:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:26,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807160729] [2022-07-22 09:50:26,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807160729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:26,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719350314] [2022-07-22 09:50:26,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 09:50:26,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:26,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:26,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:26,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 09:50:26,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 09:50:26,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:26,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 09:50:26,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 09:50:26,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 09:50:26,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719350314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 09:50:26,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 09:50:26,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-22 09:50:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692058897] [2022-07-22 09:50:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 09:50:26,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 09:50:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:26,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 09:50:26,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-22 09:50:26,343 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-22 09:50:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:26,369 INFO L93 Difference]: Finished difference Result 162 states and 204 transitions. [2022-07-22 09:50:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 09:50:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 40 [2022-07-22 09:50:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:26,370 INFO L225 Difference]: With dead ends: 162 [2022-07-22 09:50:26,371 INFO L226 Difference]: Without dead ends: 84 [2022-07-22 09:50:26,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-22 09:50:26,372 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:26,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 09:50:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-22 09:50:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-22 09:50:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-07-22 09:50:26,392 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 40 [2022-07-22 09:50:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:26,392 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-07-22 09:50:26,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-22 09:50:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-07-22 09:50:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 09:50:26,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:26,395 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-22 09:50:26,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 09:50:26,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 09:50:26,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1907846367, now seen corresponding path program 5 times [2022-07-22 09:50:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:26,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395528249] [2022-07-22 09:50:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395528249] [2022-07-22 09:50:26,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395528249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134643685] [2022-07-22 09:50:26,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 09:50:26,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:26,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:26,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 09:50:26,931 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 09:50:26,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:26,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 09:50:26,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:27,031 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-22 09:50:27,099 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-22 09:50:27,099 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 26 treesize of output 25 [2022-07-22 09:50:27,251 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 7 [2022-07-22 09:50:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:27,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:50:43,414 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 27 [2022-07-22 09:50:43,418 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 100 treesize of output 96 [2022-07-22 09:50:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 09:50:43,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134643685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 09:50:43,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 09:50:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-07-22 09:50:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845587674] [2022-07-22 09:50:43,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 09:50:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 09:50:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 09:50:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 09:50:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=714, Unknown=8, NotChecked=0, Total=870 [2022-07-22 09:50:43,513 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 09:50:43,926 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-07-22 09:50:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 09:50:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 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-22 09:50:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 09:50:43,927 INFO L225 Difference]: With dead ends: 158 [2022-07-22 09:50:43,927 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 09:50:43,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=266, Invalid=1208, Unknown=8, NotChecked=0, Total=1482 [2022-07-22 09:50:43,928 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 207 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 09:50:43,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 230 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 356 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2022-07-22 09:50:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 09:50:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2022-07-22 09:50:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-22 09:50:43,939 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 43 [2022-07-22 09:50:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 09:50:43,940 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-22 09:50:43,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 09:50:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-22 09:50:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 09:50:43,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 09:50:43,941 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 09:50:43,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 09:50:44,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 09:50:44,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 09:50:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 09:50:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1471940988, now seen corresponding path program 6 times [2022-07-22 09:50:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 09:50:44,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45009848] [2022-07-22 09:50:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 09:50:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 09:50:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 09:50:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:50:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 09:50:44,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45009848] [2022-07-22 09:50:44,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45009848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 09:50:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361006718] [2022-07-22 09:50:44,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 09:50:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 09:50:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 09:50:44,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 09:50:44,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 09:50:44,811 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-22 09:50:44,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 09:50:44,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 09:50:44,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 09:50:44,845 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-22 09:50:45,026 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-22 09:50:45,026 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 30 [2022-07-22 09:50:45,108 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-22 09:50:45,109 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 30 [2022-07-22 09:50:45,242 INFO L356 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2022-07-22 09:50:45,243 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 44 [2022-07-22 09:50:45,381 INFO L356 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2022-07-22 09:50:45,382 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 46 treesize of output 59 [2022-07-22 09:50:45,655 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-22 09:50:45,656 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-22 09:50:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 09:50:45,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 09:50:51,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~j~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) (div c_~CELLCOUNT~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse2 (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))))) (and (or .cse0 (< c_~CELLCOUNT~0 0)) (or (not (= (mod c_~CELLCOUNT~0 2) 0)) .cse0) (forall ((|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (forall ((|ULTIMATE.start_main_~j~0#1| Int)) (or (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_65| (div c_~CELLCOUNT~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))))))))) is different from false [2022-07-22 09:50:53,849 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_207 Int) (v_ArrVal_205 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (= (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_205) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= v_subst_2 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) (div c_~CELLCOUNT~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)))))) (and (or .cse0 (not (= (mod c_~CELLCOUNT~0 2) 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (forall ((v_subst_3 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_65| (div c_~CELLCOUNT~0 2)) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_205) (+ .cse1 (* (- 4) v_subst_3) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)))) (not (<= v_subst_3 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))))))) (or .cse0 (< c_~CELLCOUNT~0 0)))) is different from false [2022-07-22 09:50:56,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_207 Int) (v_ArrVal_205 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (not (<= v_subst_2 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) (div c_~CELLCOUNT~0 2)) (= (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |c_ULTIMATE.start_main_~j~0#1|)))))) (and (or .cse0 (< c_~CELLCOUNT~0 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (forall ((v_subst_3 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_65| (div c_~CELLCOUNT~0 2)) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205) (+ .cse1 (* (- 4) v_subst_3) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)))) (not (<= v_subst_3 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (or .cse0 (not (= (mod c_~CELLCOUNT~0 2) 0))))) is different from false [2022-07-22 09:50:58,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_207 Int) (v_ArrVal_205 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int) (v_ArrVal_204 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (= (select (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse3 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_204) (+ .cse3 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse4 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= v_subst_2 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) (div c_~CELLCOUNT~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |c_ULTIMATE.start_main_~j~0#1|)))))) (and (or .cse0 (< c_~CELLCOUNT~0 0)) (forall ((v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (forall ((v_subst_3 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_ArrVal_207 Int)) (or (= 0 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (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 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4))) v_ArrVal_204) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse2 (* (- 4) v_subst_3) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (<= |v_ULTIMATE.start_main_~i~0#1_65| (div c_~CELLCOUNT~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)))) (not (<= v_subst_3 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (or (not (= (mod c_~CELLCOUNT~0 2) 0)) .cse0))) is different from false [2022-07-22 09:51:00,644 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~j~0#1_64| (+ |v_ULTIMATE.start_main_~j~0#1_63| 1)) (< 2 |v_ULTIMATE.start_main_~j~0#1_64|) (< (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) v_subst_2) (< |v_ULTIMATE.start_main_~i~0#1_65| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_3 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (not (<= |v_ULTIMATE.start_main_~j~0#1_64| 2)) (= (select (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse3 (* (- 4) v_subst_3) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse3 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |v_ULTIMATE.start_main_~j~0#1_64|)) (not (<= v_subst_3 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_65|)))) (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (= (select (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse4 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse5 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~j~0#1_64| (+ |v_ULTIMATE.start_main_~j~0#1_63| 1)) (< 2 |v_ULTIMATE.start_main_~j~0#1_64|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) v_subst_2) (< |v_ULTIMATE.start_main_~i~0#1_65| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-07-22 09:51:02,744 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_3 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) |v_ULTIMATE.start_main_~i~0#1_65|)) (not (<= |v_ULTIMATE.start_main_~j~0#1_64| 2)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_63| 1) |v_ULTIMATE.start_main_~j~0#1_64|)) (not (<= v_subst_3 (+ |v_ULTIMATE.start_main_~j~0#1_60| 1))) (= (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_66| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse0 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse1 (* (- 4) v_subst_3) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_207) (+ .cse1 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (< |v_ULTIMATE.start_main_~i~0#1_65| (+ |v_ULTIMATE.start_main_~i~0#1_66| 1)) (< |v_ULTIMATE.start_main_~j~0#1_64| (+ |v_ULTIMATE.start_main_~j~0#1_63| 1)) (< 2 |v_ULTIMATE.start_main_~j~0#1_64|) (= (select (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_66| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse2 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse3 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (<= (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) v_subst_2))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_64| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_209 Int) (v_subst_2 Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_205 Int) (v_ArrVal_204 Int) (|v_ULTIMATE.start_main_~j~0#1_63| Int)) (or (<= 2 |v_ULTIMATE.start_main_~j~0#1_60|) (< |v_ULTIMATE.start_main_~i~0#1_65| (+ |v_ULTIMATE.start_main_~i~0#1_66| 1)) (< |v_ULTIMATE.start_main_~j~0#1_64| (+ |v_ULTIMATE.start_main_~j~0#1_63| 1)) (< 2 |v_ULTIMATE.start_main_~j~0#1_64|) (= (select (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_65| 8))) (store (store (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_66| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_64| (- 4)) .cse4 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_204) (+ .cse4 (* |v_ULTIMATE.start_main_~j~0#1_63| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_205)) (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* (- 4) v_subst_2)) v_ArrVal_207) (+ .cse5 (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_209)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) 0) (< (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) v_subst_2))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|))))) is different from false [2022-07-22 09:51:09,396 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 82 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)